Abstract

G.A. Bilodeau and R. Bergevin Laboratoire de vision et systemes numeriques, Pavillon Adrien-Pouliot Universite Laval, Sainte-Foy (QC), Canada, G1K 7P4 bilodeau@gel.ulaval.ca, bergevin@gel.ulaval.ca Abstract In object recognition and image querying applications, complex graphs often have to be compared to verify the similarity between two models. Since there is always uncertainty while models are constructed, the nodes and the edges require fuzzy attributes to properly describe the scene or the object. This paper addresses the problem of matching graphs with fuzzy attributes (GFAs) obtained by hypothesizing volumetric primitives from 2D parts. The GFAs of interests have nodes with many fuzzy attributes that correspond to volumetric hypotheses, and edges that describe the spatial relationship between the hypothesized volumetric primitives. A model for representing 2D parts by volumetric primitives is presented. Then, a method using structural indexing adapted to GFAs is proposed. This inexact matching method has been designed for matching GFAs in large databases.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.