loading...
Quadtree-Based Inexact Graph Matching for Image Analysis
Natal, Rio Grande do Norte, Brazil October 09-October 12
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SIBGRAPI.2005.41XVIII Brazilian Symposium on Computer ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Luís Augusto Consularo, Methodist University of Piracicaba
Roberto M. Cesar-Jr., University of São Paulo
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.
Citation:
Luís Augusto Consularo, Roberto M. Cesar-Jr., "Quadtree-Based Inexact Graph Matching for Image Analysis," sibgrapi, pp.205-212, XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.