Abstract

This paper presents a genetic algorithm (GA) based optimization procedure for the solution of structural pattern recognition problem using the attributed relational graph representation and matching technique. In this study, candidate solutions are represented by integer strings and the population is randomly initialized. The GA is employed to generate a monomorphic mapping. As all the mapping constraints are not enforced during the search phase in order to speedup the search, an efficient pose clustering algorithm is used to eliminate spurious matches and to determine the presence of the model in the scene. The performance of the proposed approach to pattern recognition by subgraph isomorphism is demonstrated using line patterns and silhouette images.

Full Text
Paper version not known

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.