Function-Described Graphs Applied to 3D Object Representation

The aim of this work is the characterization of a new structure called Function-Described Graphs (FDG) which can be used to represent objects in computer vision. The FDGs are useful in synthesizing structural information from a set of objects described through their structure. The FDG nodes and arcs are characterized by the probability distribution of the attributes of the ARGs nodes and arcs from where they have been synthesized. The FDG incorporates information of the family of the synthesized ARG and of the antagonistic node and arcs. In this work we apply this new structure to 3D object labeling.

[1]  Horst Bunke,et al.  Syntactic and structural pattern recognition : theory and applications , 1990 .

[2]  Robert M. Haralick,et al.  MATCHING RELATIONAL STRUCTURES USING DISCRETE RELAXATION , 1990 .

[3]  William J. Christmas,et al.  Structural Matching in Computer Vision Using Probabilistic Relaxation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  Avinash C. Kak,et al.  3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Kaizhong Zhang,et al.  The approximate graph matching problem , 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 3 - Conference C: Signal Processing (Cat. No.94CH3440-5).

[7]  Josef Kittler,et al.  Discrete relaxation , 1990, Pattern Recognit..

[8]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[9]  Béla Bollobás,et al.  Random Graphs , 1985 .

[10]  Edwin R. Hancock,et al.  Relational matching by discrete relaxation , 1995, Image Vis. Comput..