Projective invariants and the correspondence problem

The correspondence problem has been difficult for the computer vision community to automate robustly. Typically, correspondence can only be obtained if the epipolar geometry is known (stereo camera pair), or the images are very similar (a video sequence for example). This paper proposes an new algorithm for solving the correspondence problem of line matching for uncalibrated cameras and large motion between images. The algorithm uses the cross-ratio, an invariant from projective geometry, and the minimum line border intensity difference for line matching. The algorithm was tested on real and synthetic data. Line matches with very low error were achieved for camera relations of up to 45 degrees about an object with partial image overlap.

[1]  Eamon B. Barrett,et al.  General methods for determining projective invariants in imagery , 1991, CVGIP Image Underst..

[2]  Allen R. Hanson,et al.  Extracting Straight Lines , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Long Quan,et al.  Matching Perspective Images Using Geometric Constraints And Perceptual Grouping , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[4]  G. F. McLean,et al.  Vanishing Point Detection by Line Clustering , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  John C. H. Leung,et al.  Vanishing point matching , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[6]  Aaron Heller,et al.  An experimental evaluation of projective invariants , 1992 .