Feature Correspondence with Even Distribution

This paper presents a new method for finding feature correspondences between a pair of stereo images, which can be used to perform 3D reconstruction and object recognition. This paper uses epiploar geometry to determine the location of potential matching points which allow the finding of the correspondences faster and more accurately. An adaptive smoothness algorithm is also proposed to filter out false matches based on the disparity jump in neighboring correspondences. More correspondences are then identified in such a way that they are evenly distributed in the images. Experimental results show that the proposed method effectively improve the percentage of correct matches, total number of correct matches, and even distribution of the correspondences.

[1]  Zhengyou Zhang,et al.  Determining the Epipolar Geometry and its Uncertainty: A Review , 1998, International Journal of Computer Vision.

[2]  Kyoung Mu Lee,et al.  Unsupervised detection and segmentation of identical objects , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[3]  Harry Shum,et al.  Stereo computation using radial adaptive windows , 2002, Object recognition supported by user interaction for service robots.

[4]  Min-Hyung Choi,et al.  Two quantitative measures of inlier distributions for precise fundamental matrix estimation , 2004, Pattern Recognit. Lett..

[5]  Matthew A. Brown,et al.  Recognising panoramas , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[6]  Michel Dhome,et al.  Real Time Localization and 3D Reconstruction , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[7]  Richard I. Hartley,et al.  In Defense of the Eight-Point Algorithm , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  David G. Lowe,et al.  Object recognition from local scale-invariant features , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[9]  Martial Hebert,et al.  A spectral technique for correspondence problems using pairwise constraints , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[10]  João Paulo Costeira,et al.  A Global Solution to Sparse Correspondence Problems , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Jitendra Malik,et al.  Shape matching and object recognition using shape contexts , 2010, 2010 3rd International Conference on Computer Science and Information Technology.

[12]  Rachid Deriche,et al.  A Robust Technique for Matching two Uncalibrated Images Through the Recovery of the Unknown Epipolar Geometry , 1995, Artif. Intell..

[13]  Philip H. S. Torr,et al.  The Development and Comparison of Robust Methods for Estimating the Fundamental Matrix , 1997, International Journal of Computer Vision.

[14]  In-So Kweon,et al.  Adaptive Support-Weight Approach for Correspondence Search , 2006, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Zhengyou Zhang,et al.  A Flexible New Technique for Camera Calibration , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Richard I. Hartley,et al.  Theory and Practice of Projective Rectification , 1999, International Journal of Computer Vision.

[17]  Xiaochun Cao,et al.  Good match exploration using triangle constraint , 2012, Pattern Recognit. Lett..

[18]  Christopher Hunt,et al.  Notes on the OpenSURF Library , 2009 .

[19]  Vincent Lepetit,et al.  A fast local descriptor for dense matching , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[20]  Cordelia Schmid,et al.  A performance evaluation of local descriptors , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  H. C. Longuet-Higgins,et al.  A computer algorithm for reconstructing a scene from two projections , 1981, Nature.