Please use this identifier to cite or link to this item:
Título : Matching attributed graphs: 2nd-order probabilities for pruning the search tree
Autor : Serratosa Casanelles, Francesc, Sanfeliu Cortés, Alberto
Palabras clave : Pattern recognition
Pattern recognition systems
Fecha de publicación : 2005
Editor: Springer
Resumen: A branch-and-bound algorithm for matching Attributed Graphs (AGs) with Second-Order Random Graphs (SORGs) is presented. We show that the search space explored by this algorithm is drastically reduced by using the information of the 2nd-order joint probabilities of vertices of the SORGs. A SORG is a model graph, described elsewhere, that contains 1st and 2nd-order order probabilities of attribute relations between elements for representing a set of AGs compactly. In this work, we have applied SORGs and the reported algorithm to the recognition of real-life objects on images and the results show that the use of 2nd-order relations between vertices is not only useful to decrease the run time but also to increase the correct classification ratio.
Descripción : Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA), 2005, Estoril (Portugal)
ISBN : 9783540261544
Citación : 2nd Iberian Conference on Pattern Recognition and Image Analysis: pp. 131-138 (2005)
Appears in Collections:(IRII) Comunicaciones congresos

Files in This Item:
File Description SizeFormat 
doc1.pdf321,39 kBAdobe PDFView/Open
Show full item record

Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.