title: Efficient sequential correspondence selection by cosegmentation.
abstract: 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.
authors.affiliation: Center for Machine Perception, Department ofCybernetics, Faculty of Electrical Engineering, Czech Technical University, Technicka 2, 16627 Praha 6, Czech Republic. cechj@cmp.felk.cvut.cz
authors.forename: Jan
authors.initials: J
authors.lastname: Cech
authors.forename: Jirí
authors.initials: J
authors.lastname: Matas
authors.forename: Michal
authors.initials: M
authors.lastname: Perdoch
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D016000:Cluster Analysis; D007089:Image Enhancement / Q000379:methods*; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D021621:Imaging, Three-Dimensional / Q000379:methods*; D010363:Pattern Recognition, Automated / Q000379:methods*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity