Combining Appearance and Topology for Wide Baseline Matching

  • Dennis Tell
  • Stefan Carlsson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2350)


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.


Interest Point String Match Left Image Cyclic Order Longe Common Subsequence 
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.


  1. 1.
    D. Tell and S. Carlsson. Wide baseline point matching using affine invariants computed from intensity profiles. In ECCV, volume 1, pages 814–828, 2000.CrossRefGoogle Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    D. Nistér. Automatic dense reconstruction from uncalibrated video sequences. KTH, 2001.Google Scholar
  4. 4.
    C. Schmid and R. Mohr. Local greyvalue invariants for image retrieval. PAMI, 19(5):872–877, 1997.Google Scholar
  5. 5.
    P. Montesinos, V. Gouet, and R. Deriche. Differential invariants for color images. In ICPR, 1998.Google Scholar
  6. 6.
    A. Baumberg. Reliable feature matching across widely separated views. In CVPR, pages 774–781, 2000.Google Scholar
  7. 7.
    P.H.S. Torr and C. Davidson. Impsac: Synthesis of importance sampling and random sample consensus. In ECCV, pages 819–833, 2000.Google Scholar
  8. 8.
    T. Tuytelaars and L. van Gool et. al. Matching of affinely invariant regions for visual servoing. In IGRA, pages 1601–1606, 1999.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    S. Belongie, J. Malik, and J. Puzicha. Matching shapes. In Proc. ICCV01, pages 454–461. IEEE, July 2001.Google Scholar
  11. 11.
    T. Cormen, C. Leiserson, and R. Rivest. Introduction to algorithms. MIT Press, 1992.Google Scholar
  12. 12.
    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.CrossRefGoogle Scholar
  13. 13.
    G.M. Landau, E.W. Myers, and J.P. Schmidt. Incremental string comparison. SIAM Journal of computing, 27(2):557–582, 1998.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Dennis Tell
    • 1
  • Stefan Carlsson
    • 1
  1. 1.Dept. of Numerical Analysis and Computer Science KTHComputational Vision and Active Perception Laboratory (CVAP)StockholmSweden

Personalised recommendations