`%0 Conference Proceedings`

`%4 sid.inpe.br/banon/2005/07.15.17.44`

`%2 sid.inpe.br/banon/2005/07.15.17.45.01`

`%A Consularo, Luís Augusto,`

`%A Cesar Jr, Roberto Marcondes,`

`%@affiliation UNIMEP - Methodist University of Piracicaba`

`%@affiliation IME-USP - Department of Computer Science - IME - University of São Paulo`

`%T Quadtree-based inexact graph matching for image analysis`

`%B Brazilian Symposium on Computer Graphics and Image Processing, 18 (SIBGRAPI)`

`%D 2005`

`%E Rodrigues, Maria Andréia Formico,`

`%E Frery, Alejandro César,`

`%S Proceedings`

`%8 9-12 Oct. 2005`

`%J Los Alamitos`

`%I IEEE Computer Society`

`%C Natal`

`%K inexact graph matching, quadtree, homomorphism.`

`%X This paper presents a new method for segmentation and recognition of image objects based on structural pattern recognition. The input image is decomposed into regions through a quadtree algorithm. The decomposed image is represented by an attributed relational graph (ARG) named input graph. The objects to be recognized are also stored in an ARG named model graph. Object segmentation and recognition are accomplished by matching the input graph to the model graph. The possible inexact matches between the two graphs are cliques of the association graph between them. An objective function, to be optimized, is defined for each clique in order to measure how suitable is the match between the graphs. Therefore, recognition is modeled as an optimization procedure. A beam-search algorithm is used to optimize the objective function. Experimental results corroborating the proposed approach are presented.`

`%@language en`

`%3 consularol_quadtree.pdf`