Skip to main content

Recent Advances in Structural Pattern Recognition with Applications to Visual Form Analysis

  • Conference paper
  • First Online:
Visual Form 2001 (IWVF 2001)

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

Included in the following conference series:

Abstract

Structural pattern recognition is characterized by the representation of patterns in terms of symbolic data structures, such as strings, trees, and graphs. In this paper we review recent developments in this field. The focus of the paper will be on new methods that allow to transfer some well established procedures from statistical pattern recognition to the symbolic domain. Examples from visual form analysis will be given to demonstrate the feasibility of the proposed methods.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Jain, A., Duin, R. and Mao, J.: Statistical Pattern Recognition: A Review, IEEE Trans. PAMI 22, 2000, 4–37.

    Google Scholar 

  2. Fu, K. Syntactic Pattern Recognition and Applications, Prentice Hall, 1982.

    Google Scholar 

  3. Bunke, H. and Sanfeliu, A. editors. Syntactic and Structural Pattern Recognition-Theory and Applications, World Scientific Publ. Co., 1990.

    Google Scholar 

  4. Wagner, R. and Fischer, M. The string-to-string correction problem, Journal of the ACM 21, 1974, 168–173.

    Google Scholar 

  5. Sanfeliu, A., and Fu, K.: A distance measure between attributed relational graphs for pattern recognition, IEEE Trans. SMC 13, 1998, 353–362.

    Google Scholar 

  6. Wang, J., Zhang, K. and Chirn, G. Algorithms for approximate graph matching, Information Sciences, 82, 1995, 45–74.

    Article  MATH  MathSciNet  Google Scholar 

  7. Messmer, B., and Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection, IEEE Trans. PAMI 20, 1998, 493–504.

    Google Scholar 

  8. Myers, R., Wilson, R., and Hancock, E.: Bayesian graph edit distance, IEEE Trans. PAMI 22, 2000, 628–635.

    Google Scholar 

  9. Christmas, W.J., Kittler, J., and Petrou, M.: Structural matching in computer vision using probabilistic relaxation, IEEE Trans. PAMI 8, 1995, 749–764.

    Google Scholar 

  10. Pelillo, M., Siddiqi, K. and Zucker, S.: Matching hierarchical structures using associated graphs, IEEE Trans. PAMI 21, 1999, 1105–1120.

    Google Scholar 

  11. Cross, A., Wilson, R., and Hancock, E.: Genetic search for structural matching, In B. Buxton, R. Cipolla (eds.): Computer Vision-ECCV’ 96, LNCS 1064, Springer Verlag, 1996, 514–525.

    Chapter  Google Scholar 

  12. Englert, R. and Glanz, R. Towards the clustering of graphs. Proc. 2nd IAPR-TC-15 Workshop on Graph Based Representations, 125–133, 2000.

    Google Scholar 

  13. Lu, S.-Y. A tree-to-tree distance and its application to cluster analysis, IEEE Trans. PAMI 1, 1979, 219–224.

    Google Scholar 

  14. Seong, D., Kim, D. and Park, K. Incremental clustering of attributed graphs, IEEE Trans. SMC 23, 1993, 1399–1411.

    Google Scholar 

  15. Kohonen, T.: Median strings, Pattern Recognition Letters 3, 1985, 309–313.

    Google Scholar 

  16. Kruskal, J.B.: An overview of sequence comparison: Time warps, string edits and macromolecules, SIAM Review 25, 1983, 201–237.

    Google Scholar 

  17. Lopresti, D., Zhou, J.: Using consensus sequence voting to correct OCR errors, Comp. Vision and Image Understanding 67, 1997, 39–47.

    Google Scholar 

  18. Marti, U.-V., Bunke, H.: Use of positional information in sequence alignment for multiple classifier combination, submitted.

    Google Scholar 

  19. Casacuberta, F., de Antonio, M. D.: A greedy algorithm for computing approximate median strings, Proc. of National Symposium on Pattern Recognition and Image Analysis, Barcelona Spain, 1997, 193–198.

    Google Scholar 

  20. Kruzslicz, F.: Improved Greedy Algorithm for Computing Approximate Median Strings, Acta Cybernetica 14, 1999, 331–339.

    Google Scholar 

  21. Jiang, X., Schimann, L., Bunke, H.: Computation of median shapes, Proc. 4th Asian Conference on Computer Vision, Taipei, Taiwan, 2000, 300–305.

    Google Scholar 

  22. Martinez-Hinarejos, C., Juan, A., Casacuberta, F.: Use of median string for classification, Proc. 15th Int. Conf. on Pattern Recognition, Barcelona, 2000, Vol.2, 907–910.

    Google Scholar 

  23. Abegglen, K.: Computing the Generalized Median of a Set of Strings, MS Thesis, Department of Computer Science University of Bern, forthcoming (in German).

    Google Scholar 

  24. Bunke, H., Münger, A. and Jiang, X. Combinatorial search versus genetic algorithms: a case study based on the generalized mean graph problem, Pattern Recognition Letters 20, 1999, 1271–1277.

    Google Scholar 

  25. Jiang, X., Münger, A. and Bunke, H. Computing the generalized median of a set of graphs, Proc. 2nd IAPR-TC-15 Workshop on Graph Based Representations, 2000, 115–124.

    Google Scholar 

  26. Jiang, X., Münger, A., Bunke, H.: Synthesis of representative Graphical symbols by computing generalized means, A. Chhabra, D. Dori (eds.); Graphics Recognition, Springer Verlag, LNCS 1941, 2000, 183–192.

    Chapter  Google Scholar 

  27. Bunke, H., Jiang, X., Abegglen, K., Kandel, A.: On the weighted mean of a pair of strings, submitted.

    Google Scholar 

  28. Bunke, H., Günter, S.: Weighted mean of a pair of graphs, sumbitted.

    Google Scholar 

  29. Kohonen, T. Self-Organizing Map, Springer Verlag, 1997.

    Google Scholar 

  30. Günter, S., Graph Clustering Using Kohonen’s Method, MS Thesis, Department of Computer Science University of Bern, 2000.

    Google Scholar 

  31. Günter, S., Bunke, H.: Self-organizing feature map for clustering in the graph domain, submitted.

    Google Scholar 

  32. Kohonen, T., Somervuo, P.: Self-organizing maps of symbol strings, Neurocomputing 21, 1998, 19–30.

    Google Scholar 

  33. Jain, A.K., Murty, M.N. and Flynn, P.J. Data Clustering: A Review, ACM Computing Surveys 31, 1999, 264–323.

    Google Scholar 

  34. Kohonen, T.: The self-organizing map, Neurocomputing 21, 1998, 1–6.

    Google Scholar 

  35. Günter, S., Bunke, H.: Validation indices for graph clustering, submitted.

    Google Scholar 

  36. Alpaydin, E., Alimoglu, F.: Pen-Based Recognition of Handwritten Digits, Department of Computer Engineering, Bogazici University, Istanbul Turkey, ftp://ftp.ics.uci.edu/pub/machine-learning-databases/pendigits/

  37. Guyon, I., Schomaker, L., Plamondon, R., Liberman, M., Janet, S.: UNIPEN project of on-line data exchange and recognizer benchmarks, Proc. 12th Int. Conf. on Pattern Recognition, Jerusalem, 1994, 29–33.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bunke, H. (2001). Recent Advances in Structural Pattern Recognition with Applications to Visual Form Analysis. In: Arcelli, C., Cordella, L.P., di Baja, G.S. (eds) Visual Form 2001. IWVF 2001. Lecture Notes in Computer Science, vol 2059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45129-3_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45129-3_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42120-7

  • Online ISBN: 978-3-540-45129-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics