Issue No. 09 - September (2010 vol. 32)
Jan Čech , Czech Technical University, Prague
Jiří Matas , Czech Technical University, Prague
Michal Perdoch , Czech Technical University, Prague
In many retrieval, object recognition, and wide-baseline stereo methods, correspondences of interest points (distinguished regions) are commonly established by matching compact descriptors such as SIFTs. We show that a subsequent cosegmentation process coupled with a quasi-optimal sequential decision process leads to a correspondence verification procedure that 1) has high precision (is highly discriminative), 2) has good recall, and 3) is fast. The sequential decision on the correctness of a correspondence is based on simple statistics of a modified dense stereo matching algorithm. The statistics are projected on a prominent discriminative direction by SVM. Wald's sequential probability ratio test is performed on the SVM projection computed on progressively larger cosegmented regions. We show experimentally that the proposed sequential correspondence verification (SCV) algorithm significantly outperforms the standard correspondence selection method based on SIFT distance ratios on challenging matching problems.
Correspondence, matching, verification, sequential decision, growing, cosegmentation, stereo, image retrieval, learning.
Jan Čech, Jiří Matas, Michal Perdoch, "Efficient Sequential Correspondence Selection by Cosegmentation", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 32, no. , pp. 1568-1581, September 2010, doi:10.1109/TPAMI.2009.176