Skip to main content
Springer Nature Link
Log in

Line Matching Using Appearance Similarities and Geometric Constraints

  • Conference paper
Pattern Recognition (DAGM/OAGM 2012)

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

Abstract

Line matching for image pairs under various transformations is a challenging task. In this paper, we present a line matching algorithm which considers both the local appearance of lines and their geometric attributes. A relational graph is built for candidate matches and a spectral technique is employed to solve this matching problem efficiently. Extensive experiments on a dataset which includes various image transformations validate the matching performance and the efficiency of the proposed line matching algorithm.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
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.

Similar content being viewed by others

References

  1. Mikolajczyk, K., Schmid, C.: A performance evaluation of local descriptors. PAMI 27, 1615–1630 (2005)

    Article  Google Scholar 

  2. Wang, L., Neumann, U., You, S.: Wide-baseline image matching using line signatures. In: ICCV, pp. 1311–1318 (2009)

    Google Scholar 

  3. Fan, B., Wu, F., Hu, Z.: Line matching leveraged by point correspondences. In: CVPR, pp. 390–397 (2010)

    Google Scholar 

  4. Schmid, C., Zisserman, A.: Automatic line matching across views. In: CVPR, pp. 666–671 (1997)

    Google Scholar 

  5. Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints. In: ICCV, pp. 1482–1489 (2005)

    Google Scholar 

  6. Neubert, P., Protzel, P., Vidal-Calleja, T., Lacroix, S.: A fast visual line segment tracker. In: ETFA, pp. 353–360 (2008)

    Google Scholar 

  7. Woo, D.M., Park, D.C., Han, S.S., Beack, S.: 2d line matching using geometric and intensity data. In: AICI, pp. 99–103 (2009)

    Google Scholar 

  8. Wang, Z., Wu, F., Hu, Z.: Msld: A robust descriptor for line matching. PR 42, 941–953 (2009)

    Article  Google Scholar 

  9. Horaud, R., Skordas, T.: Stereo correspondence through feature grouping and maximal cliques. PAMI 11, 1168–1180 (1989)

    Article  Google Scholar 

  10. Christmas, W., Kittler, J., Petrou, M.: Structural matching in computer vision using probabilistic relaxation. PAMI 17, 749–764 (1995)

    Article  Google Scholar 

  11. Wilson, R.C., Hancock, E.R.: Structural matching by discrete relaxation. PAMI 19, 634–648 (1997)

    Article  Google Scholar 

  12. Bay, H., Ferrari, V., Van Gool, L.: Wide-baseline stereo matching with line segments. In: CVPR, pp. 329–336 (2005)

    Google Scholar 

  13. Akinlar, C., Topal, C.: Edlines: A real-time line segment detector with a false detection control. Pattern Recognition Letters 32, 1633–1642 (2011)

    Article  Google Scholar 

  14. Zhang, L., Koch, R.: Lbd: A fast and robust line descriptor based on line band representation. Technical Report (2012), http://www.mip.informatik.uni-kiel.de

  15. Leordeanu, M., Sukthankar, R., Hebert, M.: Unsupervised learning for graph matching. IJCV, 1–18 (2011)

    Google Scholar 

  16. http://www.caam.rice.edu/software/ARPACK/

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Kiel, Germany

    Lilian Zhang & Reinhard Koch

Authors
  1. Lilian Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Reinhard Koch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Electrical Measurement and Measurement Signal Processing, Graz University of Technology, Kronesgasse 5, 8010, Graz, Austria

    Axel Pinz

  2. Institute for Computer Graphics and Vision, Graz University of Technology, Inffeldgasse 16, 8010, Graz, Austria

    Thomas Pock , Horst Bischof  & Franz Leberl ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, L., Koch, R. (2012). Line Matching Using Appearance Similarities and Geometric Constraints. In: Pinz, A., Pock, T., Bischof, H., Leberl, F. (eds) Pattern Recognition. DAGM/OAGM 2012. Lecture Notes in Computer Science, vol 7476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32717-9_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32717-9_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32716-2

  • Online ISBN: 978-3-642-32717-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics