Abstract
Function-Described Graphs (FDGs) have been introduced as a representation of an ensemble of Attributed Graphs (AGs) for structural pattern recognition and a distance measure using restrictions between AGs and FDGs has been reported. Nevertheless, in real applications, AGs can be distorted by some external noise, and therefore some constraints have to be relaxed. To gain more flexibility and robustness, some local costs may be added to the global cost of the labelling depending on the fulfilment of the graph element constraints of the FDG instead of applying hard binary constraints.
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
R. Alquezar, 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, pp. 112–121, 1998.
F. Serratosa and A. Sanfeliu, “Function-Described Graphs applied to 3D object recognition”. In Proceedings ICIAP’97, 9 th Int. Conf. Image Analysis and Processing, Firenze, Italy, Vol. I, pp. 701–708, 1997.
F. Serratosa, R. Alquézar and A. Sanfeliu, “Function-Described Graphs for structural pattern recognition”, Technical report DEIM-RR-99-006, Universität Rovira i Virgili, Tarragona, Spain, 1999.
A. Sanfeliu and K. Fu, “A distance measure between attributed relational graphs for pattern recognition”, IEEE Transactions on Systems, Man and Cybernetics, vol. 13, pp. 353–362, 1983.
A.K.C. Wong and M. You, “Entropy and distance of random graphs with application to structural pattern recognition”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 7, pp. 599–609, 1985.
F. Serratosa, R. Alquézar and A. Sanfeliu, “Efficient algorithms for matching attributed graphs and function-described graphs”, Proceedings 15 th Int. Conf. Pattern Recognition, Barcelona, Spain, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alquézar, R., Serratosa, F., Sanfeiu, A. (2000). Distance between Attributed Graphs and Function-Described Graphs Relaxing 2nd Order Restrictions. In: Ferri, F.J., Iñesta, J.M., Amin, A., Pudil, P. (eds) Advances in Pattern Recognition. SSPR /SPR 2000. Lecture Notes in Computer Science, vol 1876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44522-6_29
Download citation
DOI: https://doi.org/10.1007/3-540-44522-6_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67946-2
Online ISBN: 978-3-540-44522-7
eBook Packages: Springer Book Archive