Abstract
The problem of establishing image-to-image correspondences is fundamental in computer vision. Recently, several wide baseline matching algorithms capable of handling large changes of viewpoint have appeared. By computing feature values from image data, these algorithms mainly use appearance as a cue for matching. Topological information, i.e. spatial relations between features, has also been used, but not nearly to the same extent as appearance. In this paper, we incorporate topological constraints into an existing matching algorithm [1] which matches image intensity profiles between interest points. We show that the algorithm can be improved by exploiting the constraint that the intensity profiles around each interest point should be cyclically ordered. String matching techniques allows for an efficient implementation of the ordering constraint. Experiments with real data indicate that the modified algorithm indeed gives superior results to the original one. The method of enforcing the spatial constraints is not limited to the presented case, but can be used on any algorithm where interest point correspondences are sought.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Tell and S. Carlsson. Wide baseline point matching using affine invariants computed from intensity profiles. In ECCV, volume 1, pages 814–828, 2000.
A. W. Fitzgibbon and A. Zisserman. Automatic camera recovery for closed or open image sequences. In Proc. European Conference on Computer Vision, pages 311–326. Springer-Verlag, June 1998.
D. Nistér. Automatic dense reconstruction from uncalibrated video sequences. KTH, 2001.
C. Schmid and R. Mohr. Local greyvalue invariants for image retrieval. PAMI, 19(5):872–877, 1997.
P. Montesinos, V. Gouet, and R. Deriche. Differential invariants for color images. In ICPR, 1998.
A. Baumberg. Reliable feature matching across widely separated views. In CVPR, pages 774–781, 2000.
P.H.S. Torr and C. Davidson. Impsac: Synthesis of importance sampling and random sample consensus. In ECCV, pages 819–833, 2000.
T. Tuytelaars and L. van Gool et. al. Matching of affinely invariant regions for visual servoing. In IGRA, pages 1601–1606, 1999.
Z. Zhang, R. Deriche, O. Faugeras, and Q.-T. Luong. A robust technique for matching two uncalibrated images through the recovery of the unknown epipolar geometry. Artificial Intelligence Journal, 78:87–119, oct 1995.
S. Belongie, J. Malik, and J. Puzicha. Matching shapes. In Proc. ICCV01, pages 454–461. IEEE, July 2001.
T. Cormen, C. Leiserson, and R. Rivest. Introduction to algorithms. MIT Press, 1992.
J. Gregor and M.G. Thomason. Dynamic programming alignment of sequences representing cyclic patterns. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 15:129–135, 1993.
G.M. Landau, E.W. Myers, and J.P. Schmidt. Incremental string comparison. SIAM Journal of computing, 27(2):557–582, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tell, D., Carlsson, S. (2002). Combining Appearance and Topology for Wide Baseline Matching. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds) Computer Vision — ECCV 2002. ECCV 2002. Lecture Notes in Computer Science, vol 2350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47969-4_5
Download citation
DOI: https://doi.org/10.1007/3-540-47969-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43745-1
Online ISBN: 978-3-540-47969-7
eBook Packages: Springer Book Archive