Abstract
This paper proposes a novel and efficient feature-point matching algorithm for finding point correspondences between two uncalibrated images. The striking feature of the proposed algorithm is that the algorithm is based on the motion coherence/smoothness constraint only, which states that neighboring features in an image tend to move coherently. In the algorithm, the correspondences of feature points in a neighborhood are collectively determined in a way such that the smoothness of the local motion field is maximized. The smoothness constraint does not rely on any image feature, and is self-contained in the motion field. It is robust to the camera motion, scene structure, illumination, etc. This makes the proposed algorithm texture-independent and robust. Experimental results show that the proposed method outperforms existing methods for feature-point tracking in image sequences.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ogale, A.S., Aloimonos, Y.: Robust Constrast Invariant Stereo Correspondence. In: Proc. IEEE Int. Conf. Robotics and Automation, pp. 819–824 (2005)
Hu, X., Ahuja, N.: Matching point feature with ordered geometric rigidity, and disparity constraints. IEEE Trans. Pattern Analysis and Machine Intelligence 16(10), 1041–1049 (1994)
Yuille, A., Grzywacz, N.: A Mathematical Analysis of the Motion Coherence Theory. In: Proc. 2nd Int. Conf. Computer Vision. (1988)
Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. of Computer Vision 60(2), 91–110 (2004)
Baumberg, A.: Reliable feature matching across widely separated videws. In: Proc. IEEE Comp. Vision and Pattern Recognition. vol. 1, pp. 774–781 (2000)
Schaffalitzky, F., Zisserman, A.: Multi-view Matching for Unordered Image Sets. In: Proc. 7th European Conf. Computer Vision, pp. 414–431 (2002)
Mikolajczyk, K., Schmid, C.: A Performance Evaluation of Local Descriptors. IEEE Trans. Pattern Analysis and Machine Intelligence 27(10), 1615–1629 (2005)
Bay, H., Tuytelaars, T., Gool, L.V.: SURF: Speeded Up Robust Features. In: Proc. 9th European Conf. Computer Vision (2006)
Tomasi, C., Kanade, T.: Detecting and Tracking of Point Features. Carnegie Mellon University Technical Report CMU-CS-91-132 (1991)
Maciel, J., Costeira, J.P.: A Global Solution to Sparse Correspondence Problems. IEEE Trans. Pattern Analysis and Machine Intelligence 25(2), 187–199 (2003)
Scott, G., Longuet-Higgins, H.: An Algorithm for Associating the Features of Two Images. In: Proc. of the Royal Soc, London. vol. B–244, pp. 21–26 (1991)
Harris, C., Stephens, M.: A combined corner and edge detector. In: Proc. 4th Alvey Vision Conf., pp. 147–151 (1988)
Fischler, M.A., Bolles, R.C.: Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM 24(6), 381–393 (1981)
Han, M., Kanade, T.: A perspective factorization method for Euclidean reconstruction with uncalibrated cameras. J. of Visualization and Computer Animation 13(4), 211–223 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, P., Farin, D., Klein Gunnewiek, R., de With, P.H.N. (2007). Texture-Independent Feature-Point Matching (TIFM) from Motion Coherence. In: Yagi, Y., Kang, S.B., Kweon, I.S., Zha, H. (eds) Computer Vision – ACCV 2007. ACCV 2007. Lecture Notes in Computer Science, vol 4843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76386-4_75
Download citation
DOI: https://doi.org/10.1007/978-3-540-76386-4_75
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76385-7
Online ISBN: 978-3-540-76386-4
eBook Packages: Computer ScienceComputer Science (R0)