Distance between Attributed Graphs and Function-Described Graphs Relaxing 2nd Order Restrictions
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.
KeywordsBoolean Function Order Restriction Attribute Graph Graph Element Individual Cost
- 1.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.Google Scholar
- 2.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.Google Scholar
- 3.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.Google Scholar
- 6.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.Google Scholar