Finding the Correspondence Points in Images of Multi-Views

There are many approaches being proposed to find the correspondence points between two images. They generally perform when used to find the correspondences between two images of the same object, such as in a video sequence or in a stereo camera. However, they fail if the number of true matches between two images was small compared to all the potential correspondence points found, which could happen if both scenes vary significantly, such as when the objects are not the same but of the same class. In this paper, we proposed an approach which uses both the geometric and appearance features to find the true correspondence points even if the number of true matches was small portion compared to all the correspondence points found. The experimental results show that the proposed method also stabilizes very fast compared to the other approaches in the literature.

[1]  L. Goddard Information Theory , 1962, Nature.

[2]  Jiri Matas,et al.  Randomized RANSAC with sequential probability ratio test , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

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

[4]  Song Ji,et al.  Multiple-View Matching AMMGC Model for Three-Line-Array Digital Images , 2008, 2008 International Symposium on Information Science and Engineering.

[5]  Cordelia Schmid,et al.  Selection of scale-invariant parts for object class recognition , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[6]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[7]  Zheng Liu,et al.  Image Fast Template Matching Algorithm Based on Projection and Sequential Similarity Detecting , 2009, 2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing.

[8]  G LoweDavid,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004 .

[9]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[10]  Jiri Matas,et al.  Optimal Randomized RANSAC , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Andrew Zisserman,et al.  Robust Detection of Degenerate Configurations while Estimating the Fundamental Matrix , 1998, Comput. Vis. Image Underst..

[12]  Cordelia Schmid,et al.  Indexing Based on Scale Invariant Interest Points , 2001, ICCV.

[13]  Pascal Fua,et al.  On benchmarking camera calibration and multi-view stereo for high resolution imagery , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[14]  Cordelia Schmid,et al.  A Performance Evaluation of Local Descriptors , 2005, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Jiri Matas,et al.  Epipolar Geometry from Two Correspondences , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[16]  Cordelia Schmid,et al.  Scale & Affine Invariant Interest Point Detectors , 2004, International Journal of Computer Vision.

[17]  Wen-Hsiang Tsai,et al.  Perspective-transformation-invariant generalized hough transform for perspective planar shape detection and matching , 1997, Pattern Recognit..

[18]  Zoran Duric,et al.  Using Local Affine Invariants to Improve Image Matching , 2010, 2010 20th International Conference on Pattern Recognition.