Recent advances in structural pattern recognition with applications to visual form analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2059, Issue , 2001, Pages 11-23

  Bunke, Horst ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Clustering; Edit distance; Median generalized median, and weighted mean computation; Self organizing map; String, tree and graph matching; Structural pattern recognition

Indexed keywords

CONFORMAL MAPPING; SELF ORGANIZING MAPS; TREES (MATHEMATICS);

CLUSTERING; EDIT DISTANCE; GRAPH MATCHINGS; STRUCTURAL PATTERN RECOGNITION; WEIGHTED MEAN;

PATTERN RECOGNITION;

EID: 84957572537     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45129-3_2     Document Type: Conference Paper

References (37)

1. Jain, A., Duin, R. and Mao, J.: Statistical Pattern Recognition: A Review, IEEE Trans. PAMI. 22, 2000, 4-37.
2. Fu, K. Syntactic Pattern Recognition and Applications, Prentice Hall, 1982.
3. Bunke, H. and Sanfeliu, A. editors. Syntactic and Structural Pattern Recognition - Theory and Applications, World Scientific Publ. Co., 1990.
4. Wagner, R. and Fischer, M. The string-to-string correction problem, Journal of the ACM. 21, 1974, 168-173.
5. Sanfeliu, A., and Fu, K.: A distance measure between attributed relational graphs for pattern recognition, IEEE Trans. SMC. 13, 1998, 353-362.
6. Wang, J., Zhang, K. and Chirn, G. Algorithms for approximate graph matching, Information Sciences, 82, 1995, 45-74.
7. Messmer, B., and Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection, IEEE Trans. PAMI. 20, 1998, 493-504.
8. Myers, R., Wilson, R., and Hancock, E.: Bayesian graph edit distance, IEEE Trans. PAMI. 22, 2000, 628-635.
9. Christmas, W.J., Kittler, J., and Petrou, M.: Structural matching in computer vision using probabilistic relaxation, IEEE Trans. PAMI. 8, 1995, 749-764.
10. Pelillo, M., Siddiqi, K. and Zucker, S.: Matching hierarchical structures using associated graphs, IEEE Trans. PAMI. 21, 1999, 1105-1120.
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.
12. Englert, R. and Glanz, R. Towards the clustering of graphs. Proc. 2nd IAPR-TC-15 Workshop on Graph Based Representations, 125-133, 2000.
13. Lu, S.-Y. A tree-to-tree distance and its application to cluster analysis, IEEE Trans. PAMI. 1, 1979, 219-224.
14. Seong, D., Kim, D. and Park, K. Incremental clustering of attributed graphs, IEEE Trans. SMC. 23, 1993, 1399-1411.
15. Kohonen, T.: Median strings, Pattern Recognition Letters. 3, 1985, 309-313.
16. Kruskal, J.B.: An overview of sequence comparison: Time warps, string edits and macromolecules, SIAM Review. 25, 1983, 201-237.
17. Lopresti, D., Zhou, J.: Using consensus sequence voting to correct OCR errors, Comp. Vision and Image Understanding. 67, 1997, 39-47.
18. Marti, U.-V., Bunke, H.: Use of positional information in sequence alignment for multiple classifier combination, submitted.
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.
20. Kruzslicz, F.: Improved Greedy Algorithm for Computing Approximate Median Strings, Acta Cybernetica. 14, 1999, 331-339.
21. Jiang, X., Schiffmann, L., Bunke, H.: Computation of median shapes, Proc. 4th Asian Conference on Computer Vision, Taipei, Taiwan, 2000, 300-305.
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.
23. Abegglen, K.: Computing the Generalized Median of a Set of Strings, MS Thesis, Department of Computer Science University of Bern, forthcoming (in German).
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.
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.
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.
27. Bunke, H., Jiang, X., Abegglen, K., Kandel, A.: On the weighted mean of a pair of strings, submitted.
28. Bunke, H., Günter, S.: Weighted mean of a pair of graphs, sumbitted.
29. Kohonen, T. Self-Organizing Map, Springer Verlag, 1997.
30. Günter, S., Graph Clustering Using Kohonen’s Method, MS Thesis, Department of Computer Science University of Bern, 2000.
31. Günter, S., Bunke, H.: Self-organizing feature map for clustering in the graph domain, submitted.
32. Kohonen, T., Somervuo, P.: Self-organizing maps of symbol strings, Neurocomputing. 21, 1998, 19-30.
33. Jain, A.K., Murty, M.N. and Flynn, P.J. Data Clustering: A Review, ACM Computing Surveys. 31, 1999, 264-323.
34. Kohonen, T.: The self-organizing map, Neurocomputing. 21, 1998, 1-6.
35. Günter, S., Bunke, H.: Validation indices for graph clustering, submitted.
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.