Skip to main content
SpringerLink
Log in

Constraining probabilistic relaxation with symbolic attributes

  • Posters
  • Conference paper
  • First Online:
Computer Analysis of Images and Patterns (CAIP 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 970))

Included in the following conference series:

Abstract

In this paper we present a graph matching algorithm based on probabilistic relaxation. The distinctive feature of our work is that we included structural and symbolic attributes as well as the numeric attributes that are usually used in the updating process. We applied this algorithm in the matching phase of a totally unconstrained handwritten numeral recognition problem. The algorithm is shown to achieve good recognition rate on very poor data and at the same time it is computationally efficient owing to the use of symbolic attributes as constraining factors to exclude impossible matches.

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.

References

  1. J. Kittler and J. Illingworth: “Relaxation Labellin Algorithms — a Review”. Image and Vision Computing, 206–216, 1985.

    Google Scholar 

  2. R.A. Hummel and S.W. Zucker: “On the foundation of the relaxation labelling process”. IEEE Trans. Pattern Analysis and Machine Intelligence, PAMI-5 (3),267–286, 1983.

    Google Scholar 

  3. J. Kittler and E. Hancock: “Combining Evidence in Probabilistic Relaxation”. Int Jnl. Pattern Recognition and Artificial Intellegence, 3:29–51, 1989.

    Google Scholar 

  4. W. J. Christmas, J. Kittler and M. Petrou: Matching In Computer Vision Using Probabilistic Relaxation. To appear in IEEE Trans. on Pattern Analysis and Machine Intelligence,bf PAMI.

    Google Scholar 

  5. M. Hatef and J. Kittler: Combining Symbolic with Numeric Attributes in Multi-calss Object Recognition Problems. To appear in ICIP 1995.

    Google Scholar 

  6. V. G. Govindan: Character Recognition-Areview. Pattern Recognition, Vol. 23, No 7, 1990, 671–683.

    Google Scholar 

  7. S. Srihari: Recognition of Handwritten and Machine-printed Text for Postal Address Interpretation. Handwriten Numerals. Pattern Recognition letters 14 (1993), 291–302.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept of Electronics & Electrical Engineering, University of Surrey, GU2 5XH, Guildford, UK

    Mohamad Hatef & Josef Kittler

Authors
  1. Mohamad Hatef
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Josef Kittler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Václav Hlaváč Radim Šára

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hatef, M., Kittler, J. (1995). Constraining probabilistic relaxation with symbolic attributes. In: Hlaváč, V., Šára, R. (eds) Computer Analysis of Images and Patterns. CAIP 1995. Lecture Notes in Computer Science, vol 970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60268-2_394

Download citation

  • DOI: https://doi.org/10.1007/3-540-60268-2_394

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44781-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation