Skip to main content
SpringerLink
Log in

Synthesis of Representative Graphical Symbols by Computing Generalized Median Graph

  • Conference paper
  • First Online:
Graphics Recognition Recent Advances (GREC 1999)

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

Included in the following conference series:

Abstract

Median is a general concept of capturing the essential information of a given set of objects. In this work we adopt this concept to the problem of learning, or synthesis, of representative graphical symbols from given examples. Graphical symbols are represented by graphs. This way the learning task is transformed into that of computing the generalized median of a given set of graphs, which is a novel graph matching problem and solved by a genetic algorithm.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. A. D. J. Cross, R. C. Wilson, and E. R. Hancock, Inexact graph matching using genetic search, Pattern Recognition, 30(6): 953–970, 1997. 185

    Article  Google Scholar 

  2. D. E. Goldberg, Genetic algorithms in search, optimization and machine learning, Addison-Wesley, 1989. 185

    Google Scholar 

  3. A. H. Habacha, Structural recognition of disturbed symbols using discrete relaxation, Proc. of 1st Int. Conf. on Document Analysis and Recognition, Saint Malo, France, 170–178, 1991. 183

    Google Scholar 

  4. A. Hutchinson, Algorithmic Learning, Oxford University Press, 1994. 183

    Google Scholar 

  5. X. Jiang, A. Münger, and H. Bunke, Computing the generalized median of a set of graphs, Proc. of 2nd ICPAR Workshop on Graph-based Representations, Haindorf, Austria, 115–124, 1999. 183, 185, 187

    Google Scholar 

  6. R. Kasturi and K. Tmobre (Eds.), Graphics Recognition: Methods and Applications, Springer-Verlag, 1996. 183

    Google Scholar 

  7. P. Kuner and B. Ueberreiter, Pattern recognition by graph matching: combinatorial versus continuous optimization, Int. Journal of Pattern Recognition and Artificial Intelligence, 2(3): 527–542, 1988. 183

    Article  Google Scholar 

  8. S. Lee, Recognizing hand-written electrical circuit symbols with attributed graph matching, in H. S. Baird, H. Bunke, and K. Yamamoto (Eds.), Structured Document Analysis, 340–358, Springer-Verlag, 1988. 183

    Google Scholar 

  9. S. W. Lee, J. H. Kim, and F. C. A. Groen, Translation-, rotation-, and scaleinvariant recognition of hand-drawn symbols in schematic diagrams, Int. Journal of Pattern Recognition and Artificial Intelligence, 4(1): 1–25, 1990. 183

    Article  Google Scholar 

  10. J. Lladós, G. Sánchez, and E. Martí, A string based method to recognize symbols and structural textures in architectural plans, Proc. of 2nd IAPR Workshop on Graphics Recognition, Nancy, France, 287–294, 1997. 183

    Google Scholar 

  11. D. Lopresti and J. Zhou, Using consensus sequence voting to correct OCR errors, Computer Vision and Image Understanding, 67(1): 39–47, 1997. 184

    Article  Google Scholar 

  12. B. T. Messmer and H. Bunke, A new algorithm for error-tolerant subgraph isomorphism detection, IEEE Trans. on Pattern Analysis and Machine Intelligence, 20(5): 493–504, 1998. 184

    Article  Google Scholar 

  13. A. Münger, Synthesis of prototype graphs from sample graphs, Diploma Thesis, University of Bern, 1998. (in German) 185

    Google Scholar 

  14. Y.-K. Wang, K.-C. Fan, and J.-T. Horng, Genetic-based search for error-correcting graph isomorphism, IEEE Trans. on Systems, Man and Cybernetics — Part B: Cybernetics, 27(4): 588–597, 1997. 185

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bern, Switzerland

    Xiaoyi Jiang, Andreas Münger & Horst Bunke

Authors
  1. Xiaoyi Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Münger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Horst Bunke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Verizon Communications, 500 Westchester Avenue, White Plains, 10604, NY, USA

    Atul K. Chhabra

  2. School of Engineering, Engineering Systems Division, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139-4307, USA

    Dov Dori

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiang, X., Münger, A., Bunke, H. (2000). Synthesis of Representative Graphical Symbols by Computing Generalized Median Graph. In: Chhabra, A.K., Dori, D. (eds) Graphics Recognition Recent Advances. GREC 1999. Lecture Notes in Computer Science, vol 1941. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40953-X_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-40953-X_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41222-9

  • Online ISBN: 978-3-540-40953-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation