Abstract
Function-described graphs (FDGs) have been introduced very recently as a representation of an ensemble of attributed relational graphs (ARGs) for structural pattern recognition [1, 2]. In this paper, the relationship between FDGs and Random Graphs [3] is analysed and the synthesis process of FDGs is studied, whereas the matching process between FDGs and ARGs is discussed elsewhere [4]. Two procedures are described to synthesize an FDG from a set of commonly labelled ARGs or FDGs, respectively. Then, a general incremental method to synthesize an FDG from a sequence of unlabelled ARGs is proposed. Specific methods are obtained when an ARG-to-FDG matching algorithm is selected to find optimal morphisms.
Chapter PDF
Keywords
References
F. Serratosa and A. Sanfeliu: Function-described graphs. In Pattern Recognition and Image Analysis, Preprints of the 7th National Symposium on Pattern Recognition and Image Analysis, Centre de Visió per Computador, Univ. Autònoma de Barcelona, Vol.I (1997) 37–42
F. Serratosa and A. Sanfeliu: Function-described graphs applied to 3D object recognition. In Proc. ICIAP'97, 9th Int. Conf. Image Analysis and Processing, Firenze, Italy, Vol.I (1997) 701–708
A.K.C. Wong, J. Constant and M.L. You: Random graphs. In Syntactic and Structural Pattern Recognition: Theory and Applications, H.Bunke and A.Sanfeliu (eds.), World Scientific Publishing Co. Pte. Ltd., Singapore (1990) 197–234
F. Serratosa, A. Sanfeliu and R. Alquézaar: Distance and matching between functiondescribed graphs. Tech. Rep. IRI-DT-9803, Inst. de Robòtica i Informàtica Industrial, Univ. Politècnica de Catalunya-CSIC, Barcelona, Spain (1998)
W.H. Tsai and K.S. Fu: Error-correcting isomorphism of attributed relational graphs for pattern analysis. IEEE Trans. Systems, Man and Cybernetics 9 (1979) 757–768
A. Sanfeliu and K.S. Fu: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Systems, Man and Cybernetics 13 (1983) 353–362
A.K.C. Wong and M.L. You: Entropy and distance of random graphs with application to structural pattern recognition. IEEE Trans. Pattern Analysis and Machine Intelligence 7 (1985) 599–609
D.S. Seong, H.S. Kim and K.H. Park: Incremental clustering of attributed graphs. IEEE Trans. Systems, Man and Cybernetics 23 (1993) 1399–1411
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alquézar, R., Sanfeliu, A., Serratosa, F. (1998). Synthesis of function-described graphs. In: Amin, A., Dori, D., Pudil, P., Freeman, H. (eds) Advances in Pattern Recognition. SSPR /SPR 1998. Lecture Notes in Computer Science, vol 1451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0033229
Download citation
DOI: https://doi.org/10.1007/BFb0033229
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64858-1
Online ISBN: 978-3-540-68526-5
eBook Packages: Springer Book Archive