Skip to main content
Springer Nature Link
Log in

Robust Artificial Landmark Recognition Using Polar Histograms

  • Conference paper
Progress in Artificial Intelligence (EPIA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3808))

Included in the following conference series:

  • 1525 Accesses

Abstract

New results on our artificial landmark recognition approach are presented, as well as new experiments in order to demonstrate the robustness of our method. The objective of our work is the localization and recognition of artificial landmarks to help in the navigation of a mobile robot. Recognition is based on interpretation of histograms obtained from polar coordinates of the landmark symbol. Experiments prove that our approach is fast and robust even if the database has an high number of landmarks to compare with.

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

Access this chapter

Log in via an institution

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. Todt, E., Torras, C.: Detection of Natural Landmarks Through Multiscale Opponent Features. In: 15th International Conference on Pattern Recognition (ICPR 2000), Barcelona, Spain, vol. 3, pp. 3988–3991 (2000)

    Google Scholar 

  2. Hsien, J.C., Chen, S.Y.: Road Sign Detection and Recognition Using Markov Model. In: 14th Workshop on Object-Orient Technology and Applications (OOTA 2003), Taiwan, pp. 529–536 (2003)

    Google Scholar 

  3. Piccioli, G., De Micheli, E., Parodi, P., Campani, M.: A Robust method for road sign detection and recognition. Image and Vision Computing 14, 209–223 (1996)

    Article  Google Scholar 

  4. Zadeh, M.M., Kasvand, T., Suen, C.Y.: Localization and Recognition of Traffic Signs for Automated Vehicle Control Systems. In: Conf. on Intelligent Transportation Systems, part of SPIE’s Intelligent Systems and Automated Manufacturing, Pittsburgh, USA, pp. 272–282 (1997)

    Google Scholar 

  5. Bernier, T., Landry, J.A.: A New Method for Representationg and Matching Shapes of Natural Objects. Pattern Recognition 36(8), 1711–1723 (2003)

    Article  Google Scholar 

  6. Fekete, S.P.: Simplicity and Hardness of the Maximum Traveling Salesman Problem under Geometric Distances. In: Proc. Tenth ACM-SIAM Symposium on Discard Algorithms (SODA 1999), Maryland, USA, pp. 337–345 (1999)

    Google Scholar 

  7. Cha, S.H., Srihari, S.N.: Distance Between Histograms of Angular Measurements and its Application to Handwritten Character Similarity. In: 15th International Conference on Pattern Recognition (ICPR 2000), Barcelona, Spain, pp. 21–24 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Ciencia de la Computación e Inteligencia Artificial, Universidad de Alicante, Ap. de correos 99, 03080, Alicante, Spain

    Pablo Suau

Authors
  1. Pablo Suau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Portugal Telecom Inovação (PTI), Centro de Informatica e Sistemas da Universidade de Coimbra (CISUC),  

    Carlos Bento

  2. Department of Informatics Engineering, Coimbra University, Portugal

    Amílcar Cardoso

  3. Centre of Human Language Technology and Bioinformatics, University of Beira Interior, 6201-001, Covilhã, Portugal

    Gaël Dias

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suau, P. (2005). Robust Artificial Landmark Recognition Using Polar Histograms. In: Bento, C., Cardoso, A., Dias, G. (eds) Progress in Artificial Intelligence. EPIA 2005. Lecture Notes in Computer Science(), vol 3808. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11595014_45

Download citation

  • DOI: https://doi.org/10.1007/11595014_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30737-2

  • Online ISBN: 978-3-540-31646-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics