IRI - Distance between attributed graphs and function-described graphs relaxing 2nd order restrictions

Publication

Distance between attributed graphs and function-described graphs relaxing 2nd order restrictions

Conference Article

Conference

Joint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition (SSPR&SPR)

Edition

8th

Pages

277-286

Doc link

http://dx.doi.org/10.1007/3-540-44522-6_29

File

Download the digital copy of the doc pdf document

Authors

Alquézar Mancho, Renato
Serratosa Casanelles, Francesc
Sanfeliu Cortés, Alberto

Projects associated

MARCO: Active vision systems based in automatic learning for industrial applications

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.

Scientific reference

R. Alquézar Mancho, F. Serratosa and A. Sanfeliu. Distance between attributed graphs and function-described graphs relaxing 2nd order restrictions, 8th Joint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition, 2000, Alicante, Spain, in Advances in Pattern Recognition, Vol 1876 of Lecture Notes in Computer Science, pp. 277-286, 2000, Springer, Berlin.