Function-described graphs for modelling objects represented by sets of attributed graphs

Pattern Recognition

Volumn 36, Issue 3, 2003, Pages 781-798

  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 and face identification; Attributed graphs; Clustering; Error tolerant graph matching; Function described graphs; Random graphs; Synthesis

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; PROBABILITY;

FUNCTION-DESCRIBED GRAPHS (FDG);

OBJECT RECOGNITION;

GRAPHICAL METHOD;

EID: 0036522691     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(02)00107-3     Document Type: Article

References (27)

1. Graph based representations and techniques for image processing and image analysis
2. Random graphs
3. Entropy and distance of random graphs with application to structural pattern recognition
4. An algorithm for graph optimal monomorphism
5. Structural indexing: Efficient 3D object recognition
6. Rulegraphs for graph matching in pattern recognition
7. 3D object recognition using bipartite matching embedded in discrete relaxation
8. Model indexing: The graph-hashing approach
9. Organization of relational models for scene analysis
10. A distance measure between attributed relational graphs for pattern recognition
11. Clustering of attributed graphs and unsupervised synthesis of function-described graphs
12. A decision tree approach to graph and subgraph isomorphism detection
13. Learning in structured domains by attributed relational graphs
14. Learning templates from fuzzy examples in structural pattern recognition
15. Supervised neural networks for the classification of structures
16. Organizing large structural modelbases
17. Function-described graphs applied to 3D object recognition
18. Face recognition: Graph matching versus neural techniques
19. Synthesis of function-described graphs
20. Clustering of attributed graphs and unsupervised synthesis of function-described graphs
21. Efficient algorithms for matching attributed graphs and function-described graphs
22. Structural matching by discrete relaxation
23. A distance measure between attributed relational graphs for pattern recognition
24. Image segmentation using local variation
25. Distance between attributed graphs and function-described graphs relaxing 2nd-order restrictions