Synthesis of function-described graphs and clustering of attributed graphs

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 16, Issue 6, 2002, Pages 621-655

  Serratosa, Francesc ^a   Alquézar, René ^b   Sanfeliu, Alberto ^b  

^a UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

3D object recognition; Attributed graphs; Clustering; Error tolerant graph matching; Function described graphs; Probabilistic and structural synthesis; Random graphs; Structural pattern recognition

Indexed keywords

ALGORITHMS; DATA STRUCTURES; GRAPH THEORY; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; THREE DIMENSIONAL;

ATTRIBUTED GRAPHS; CLUSTERING; ERROR TOLERANT GRAPH MATCHING; FUNCTION-DESCRIBED GRAPHS; RANDOM GRAPHS; STRUCTURAL PATTERN RECOGNITION; THREE DIMENSIONAL-OBJECT RECOGNITION;

PATTERN RECOGNITION;

EID: 0036757929     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218001402001915     Document Type: Article

References (35)

1. R. Alquézar, F. Serratosa and A. Sanfeliu, "Distance between attributed graphs and function-described graphs relaxing 2nd order restrictions," Advances in Pattern Recognition, Proc. Joint IAPR Int. Workshops SSPR'2000 and SPR'2000, Barcelona, Spain, Springer LNCS-1876, 2000, pp. 277-286.
2. R. Alquézar, A. Sanfeliu and F. Serratosa, "Synthesis of function-described graphs," Advances in Pattern Recognition, Proc. Joint IAPR Int. Workshops SSPR'98 and SPR'98, Sydney, Australia, Springer LNCS-1451, 1998, pp. 112-121.
3. H. G. Barrow and R. M Burstall, "Subgraph isomorphism, matching relational structures and maximal cliques," Inform. Process. Lett. 4 (1976) 83-84.
4. B. Bollobas, Modern Graph Theory, Springer-Verlag, 1998.
5. H. Bunke, "Structural and syntactic pattern recognition," Handbook of Pattern Recognition and Computer Vision, World Scientific, Singapore, 1993, pp. 163-209.
6. H. Bunke, "Error-tolerant graph matching: a formal framework and algorithms," Advances in Pattern Recognition, Proc. Joint IAPR Int. Workshops SSPR'98 and SPR'98, Sydney, Australia, Springer LNCS-1451, 1998, pp. 1-14.
7. H. Bunke and B. Messmer, "Recent advances in graph matching," Int. J. Pattern Recognition and Artificial Intelligence 11 (1997) 169-203.
8. W. J. Christmas, J. Kittler and M. Petrou, "Structural matching in computer vision using probabilistic relaxation," IEEE Trans. Patt. Anal. Mach. Intell. 17 (1995) 749-764.
9. K. P. Chan, "Learning templates from fuzzy examples in structural pattern recognition," IEEE Trans. Syst. Man Cybern. 26 (1996) 118-123.
10. M. A. Eshera and K. S. Fu, "A graph distance measure for image analysis," IEEE Trans. Syst. Man Cybern. 14 (1984) 398-408.
11. P. F. Fenzenswalb and D. P. Huttenlocher, "Image segmentation using local variation," Proc. IEEE Computer Society Conf. Computer Vision and Pattern Recognition, 1998, pp. 98-104.
12. D. H. Fisher, "Knowledge acquisition via incremental conceptual clustering," Mach. Learn. 2 (1987) 139-172.
13. P. Foggia, R. Genna and M. Vento, "Symbolic versus connectionist learning: an experimental comparison in a structured domain," IEEE Trans. Knowl. Data Eng. 13, 2 (2001) 176-195.
14. A. D. Gordon, "A review of hierarchical classification," J. R. Statist. Soc. A150, 2 (1987) 119-137.
15. F. McGregor, "Backtrack search algorithms and the maximal common subgraph problem," Software-Practice and Experience 12 (1982) 23-34.
16. J. Kittler, W. J. Christmas and M. Petrou, "Probabilistic relaxation for matching problems in machine vision," Proc. 4th Int. Conf. Computer Vision, 1993, pp. 666-674.
17. B. T. Messmer and H. Bunke, "Efficient error-tolerant subgraph isomorphism detection," Shape, Structure and Pattern Recognition, eds. D. Dori and A. Bruckstein, World Scientific, 1994.
18. A. Pearce, T. Caelly and W. F. Bischof, "Rulegraphs for graph matching in pattern recognition," Patt. Recogn. 27, 9 (1994) 1231-1247.
19. A. Sanfeliu and K. Fu, "A distance measure between attributed relational graphs for pattern recognition," IEEE Trans. Syst. Man Cybern. 13 (1983) 353-362.
20. A. Sanfeliu, F. Serratosa and R. Alquezar, "Clustering of attributed graphs and unsupervised synthesis of function-described graphs," Proc. ICPR'2000, 15th Int. Conf. Pattern Recognition, Barcelona, Spain, Vol. 2, 2000, pp. 1026-1029.
21. D. S. Seong, H. S. Kim and K. H. Park, "Incremental clustering of attributed graphs," IEEE Trans. Syst. Man Cybern. 23 (1993) 1399-1411.
22. F. Serratosa, Function-Described Graphs for Structural Pattern Recognition, Ph.D. Thesis dissertation, Universitat Politécnica de Catalunya, Barcelona, Spain, 2000.
23. F. Serratosa, R. Alquezar and A. Sanfeliu, "Efficient algorithms for matching attributed graphs and function-described graphs," Proc. ICPR'2000, 15th Int. Conf. Pattern Recognition, Barcelona, Spain, Vol. 2, 2000, pp. 871-876.
24. F. Serratosa and A. Sanfeliu, "Function-described graphs applied to 3D object recognition," Proc. ICIAP'97, 9th Int. Conf. Image Analysis and Processing, Firenze, Italy, Vol. I, 1997, pp. 701-708.
25. A. Sanfeliu, R. Alquézar, J. Andrade, J. Climent, F. Serratosa and J. Vergés, "Graph-based representations and techniques for image processing and image analysis," Patt. Recogn. 35 (2002) 639-650.
26. L. Shapiro and R. M. Haralick, "A metric for comparing relational descriptions," IEEE Trans. Patt. Anal. Mach. Intell. 7 (1985) 90-94.
27. A. Sperduti and A. Starita, "Supervised neural networks for the classification of structures," IEEE Trans. Neural Networks 8, 3 (1997) 714-735.
28. W. H. Tsai and K. S. Fu, "Error-correcting isomorphism of attributed relational graphs for pattern analysis," IEEE Trans. Syst. Man Cybern. 9 (1979) 757-768.
29. J. R. Ullman, "An algorithm for sub-graph isomorphism," J. Assoc. Comput. Mach. 23 (1976) 31-42.
30. R. S. Wallace and T. Kanade, "Finding natural clusters having minimum description length," Proc. 10th Int. Conf. Pattern Recognition, 1990, pp. 438-442.
31. J. Vergés, A. Sanfeliu, F. Serratosa and R. Alquézar, "Face recognition: graph matching versus neural techniques," 8th Nat. Symp. Pattern Recognition and Image Analysis, Vol. I, 1999, pp. 259-266.
32. R. C. Wilson and E. R. Hancock, "Structural matching by discrete relaxation," IEEE Trans. Patt. Anal. Mach. Intell. 19 (1997) 634-648.
33. P. H. Winston, "Learning structural descriptions from examples," Technical Report MAC-TR-76, Department of Electrical Engineering and Computer Science-MIT, 1976.
34. A. K. C. Wong and M. You, "Entropy and distance of random graphs with application to structural pattern recognition," IEEE Trans. Patt. Anal. Mach. Intell. 7 (1985) 599-609.
35. A. K. C. Wong, M. You and S. C. Chan, "An algorithm for graph optimal monomorphism," IEEE Trans. Syst. Man Cybern. 20 (1990) 628-636.