Digital.CSIC > Ciencia y Tecnologías Físicas > Instituto de Robótica e Informática Industrial (IRII) > (IRII) Comunicaciones congresos >




Open Access item Matching attributed graphs: 2nd-order probabilities for pruning the search tree

Authors:Serratosa Casanelles, Francesc
Sanfeliu Cortés, Alberto
Keywords:Pattern recognition, Pattern recognition systems
Issue Date:2005
Citation:2nd Iberian Conference on Pattern Recognition and Image Analysis: pp. 131-138 (2005)
Abstract: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.
Description:Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA), 2005, Estoril (Portugal)
Appears in Collections:(IRII) Comunicaciones congresos

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