Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J.T.LWANG, KZHANG, G-W. CHIRN, “The approximate Graph Matching Problem”, IEEE pp. 284–288, 1994.
A.K.CWONG, J.CONSTANT and M.L.YOU, “Random graphs”, (H. BUNKE and A. SANFELIU eds.). “Syntactic and structural pattern recognition: Theory and applications”, World Scientific Publishing Co. Pte. Ltd pp 179–195, 1990.
A.SANFELIU and K.FU,“ A Distance Measure Between Attributed Relational Graphs for Pattern Recognition”, IEEE Trans. on Sys. man and cybern. Vol. smc 13 No 3 May/June, 1983.
R.C.WILSON, A.N.EVANS and E.R.HANCOCK, “Relational matching by discrete relaxation”, Image and vision computing, Vol. 13, pp 411–421, 1995.
W.Y.KIM and A.C.KAK, “3D object recognition using bipartite matching embedded in discrete relaxation”, IEEE Trans. Pattern anal. mach. intell. 13 pp 224–251, 1991.
L.SHAPIRO and R.M.HARALICK, “Matching relational structures using discrete relaxation”, (H. BUNKE and A. SANFELIU eds.). “Syntactic and structural pattern recognition: Theory and applications”, World Scientific Publishing Co. Pte. Ltd pp 179–195, 1990.
A. SANFELIU, “Matching Methods”, 8th Scandinavian conference on image analysis, 1993.
E.R.HANCOCK and J.KITTLER, “Discrete relaxation”, Pattern recognition Vol. 23 pp.711–733, 1990.
W.J.CHRISTMAS, J.KITTLER and M.PETROU, “Structural matching in computer vision using probabilistic relaxation”, PAMI, Vol. 17, No 8 pp 749–764, 1995.
D.H.BALLARD and C.M.BROWN, “Computer Vision”, Prentice Hall 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Serratosa, F., Sanfeliu, A. (1997). Function-described graphs applied to 3D object representation. In: Del Bimbo, A. (eds) Image Analysis and Processing. ICIAP 1997. Lecture Notes in Computer Science, vol 1310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63507-6_263
Download citation
DOI: https://doi.org/10.1007/3-540-63507-6_263
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63507-9
Online ISBN: 978-3-540-69585-1
eBook Packages: Springer Book Archive