Towards bridging the gap between statistical and structural pattern recognition: Two new concepts in graph matching

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

Volumn 2013, Issue , 2001, Pages 1-11

  Bunke, H ^a   Gunter S ^a   Jiang, X ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Edit distance; Error tolerant matching; Graph matching; Median graph; Weighted mean

Indexed keywords

GRAPHIC METHODS; K-MEANS CLUSTERING;

EDIT DISTANCE; ERROR TOLERANT; GRAPH MATCHINGS; MEDIAN GRAPH; WEIGHTED MEAN;

PATTERN RECOGNITION;

EID: 84944036030     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44732-6_1     Document Type: Conference Paper

References (24)

1. A. Admin, D. Dori, P. Pudil, and H. Freemann, editors. Advances in Pattern Recognition. Number 1451 in LNCS. Springer, 1998.
2. H. Bunke, editor. Advances in Structural and Syntactical Pattern Recognition. World Scientific Publ. Co., 1992.
3. H. Bunke. Error-tolerant graph matching: a formal framework and algorithms. In [1], pages 1-14. 1998.
4. H. Bunke and A. Kandel. Mean and maximum common subgraph of two graphs. Pattern Recognition Letters, 21:163-168, 2000.
5. H. Bunke, A. Münger, and X. Jiang. Combinatorial search versus genetic algorithms: a case study based on the generalized mean graph problem. Pattern Recognition Letters, 20:1271-1277, 1999.
6. H. Bunke and A. Sanfeliu, editors. Syntactic and Structural Pattern Recognition - Theory and Applications. World Scientific Publ. Co., 1990.
7. F. Casacuberta and M. Antonia. A greedy algorithm for computing approximate median strings. In Proc. Nat. Symp. of Pattern Recognition and Image Analysis, pages 193-198, Barcelona, Spain, 1996.
8. D. Dori and A. Bruckstein, editors. Shape, Structure and Pattern Recognition. World Scientific Publ. Co., 1995.
9. R. Englert and R. Glanz. Towards the clustering of graphs. In Proc. 2nd IAPR- TG-15 Workshop on Graph Based Representations, pages 125-133, 2000.
10. K. Fu. Syntactic Pattern Recognition and Applications. Prentice Hall, 1982.
11. S. Günter. Kohonen map for the domain of graphs. Master’s thesis, University of Bern. In progress (in German).
12. A. Jain, R. Duin, and J. Mao. Statistical Pattern Recognition: A Review. IEEE Trans PAMI, 22:4-37, 2000.
13. X. Jiang, A. Münger, and H. Bunke. Synthesis of representative symbols by computing generalized median graphs. In Proc. Int. Workshop on Graphics Recognition GREG’99, pages 187-194, Jaipur, 1999.
14. X. Jiang, A. Münger, and H. Bunke. Computing the generalized median of a set of graphs. In Proc. 2nd IAPR-TG-15 Workshop on Graph Based Representations, pages 115-124, 2000.
15. X. Jiang, A. Münger, and H. Bunke. On median graphs: Properties, algorithms, and applications. Submitted, 2000.
16. X. Jiang, L. Schiffmann, and H. Bunke. Computation of median shapes. In 4th, Asian Gonf. on Computer Vision, pages 300-305, Taipei, Taiwan, 2000.
17. T. Kohonen. Self-Organizing Maps. Springer Verlag, 1995.
18. F. Kruzslicz. Improved greedy algorithm for computing approximate median strings. Acta Cybernetica, 14:331-339, 1999.
19. D. Lopresti and J. Zhou. Using consensus voting to correct OCR errors. Computer Vision and Image Understanding, 67(l):39-47, 1997.
20. S.-Y. Lu. A tree-to-tree distance and its application to cluster analysis. IEEE Trans. PAMI, 1:219-224, 1979.
21. P. Perner, P. Wang, and A. Rosenfeld, editors. Advances in Structural and Syntactical Pattern Recognition. Number 1121 in LNCS. Springer, 1996.
22. S. Rice, J. Kanai, and T. Nartker. A difference algorithm for OCR-generated text. In [2], pages 333-341, 1992.
23. D. Seong, H. Kim, and K. Park. Incremental clustering of attributed graphs. IEEE Trans. SMC, 23:1399-1411, 1993.
24. R. Wagner and M. Fischer. The string-to-string correction problem. Journal of the Association for Computing Machinery, 21(1):168-173, 1974.