Skip to main content

Marrying Level Lines for Stereo or Motion

  • Conference paper
Image Analysis and Recognition (ICIAR 2005)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 3656))

Included in the following conference series:

Abstract

Efficient matching methods are crucial in Image Processing. In the present paper we outline a novel algorithm of ”stable marriages” that is also fair and globally satisfactory for both populations to be paired. Our applicative examples here being stereo or motion we match primitives based on level lines segments, known for their robustness to contrast changes. They are separately extracted from images, and we draft the corresponding process too. Then for marriages to be organised each primitive needs to be given a preference list sorting potential mates in the antagonist image: parameters of the resemblance founding preferences are explained. Eventually all operators above are embedded within a recursive least squares method and results are shown and compared with a successful Hough based matching that we had used so far.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Burg, B., Zavidovique, B.: Pattern recognitions and image compression by means of a time warping algorithm. In: ICPR Paris (October 1986)

    Google Scholar 

  2. Bouchafa, S., Zavidovique, B.: Stratégie de vote pour la mise en correspondance de lignes de niveaux. In: RFIA 2004 (January 2004)

    Google Scholar 

  3. Zemirli, K., Seetharamann, G., Zavidovique, B.: Stable matching for selective junction points grouping. IEEE JCIS (February 2000)

    Google Scholar 

  4. Caselles, V., Coll, B., Morel, J.: Topographic maps and local contrast changes in natural images. International Journal of Computer Vision 33(1), 5–27 (1999)

    Article  MathSciNet  Google Scholar 

  5. Monasse, P., Guichard, F.: Fast computation of a contrast-invariant image representation. IEEE Trans. on Image Proc. 9(5), 860–872 (1998)

    Article  Google Scholar 

  6. Suvonvorn, N., Bouchafa, S., Lacassagne, L.: Fast reliable level-lines segments extraction. In: ICTTA (2004)

    Google Scholar 

  7. Bouchafa, S., Zavidovique, B.: Cumulative level-line matching for image registration. In: IEEE 12th International Conference on Image Analysis and Processing, September 2003, pp. 176–180 (2003)

    Google Scholar 

  8. Gal, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly 69, 9–15 (1962)

    Article  MathSciNet  Google Scholar 

  9. McVitie, D.G., Wilson, L.B.: Three procedures for the stable marriage problem. Communications of the ACM 14(7), 491–492 (1971)

    Article  MathSciNet  Google Scholar 

  10. Blanchet, G., Charbit, M.: Signaux et images sous Matlab. HERMES Science Europe Ltd. (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suvonvorn, N., Bouchafa, S., Zavidovique, B. (2005). Marrying Level Lines for Stereo or Motion. In: Kamel, M., Campilho, A. (eds) Image Analysis and Recognition. ICIAR 2005. Lecture Notes in Computer Science, vol 3656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11559573_49

Download citation

  • DOI: https://doi.org/10.1007/11559573_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29069-8

  • Online ISBN: 978-3-540-31938-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics