Abstract
Point pattern matching is a fundamental problem in computer vision and pattern recognition. Membrane computing is an emergent branch of bio-inspired computing, which provides a novel idea to solve computationally hard problems. In this paper, a new point pattern matching algorithm with local elitism strategy is proposed based on membrane computing models. Local elitism strategy is used to keep good correspondences of point pattern matching found during the search, so the matching rate and the convergence speed are improved. Five heuristic mutation rules are introduced to avoid the local optimum. Experiment results on both synthetic data and real world data illustrate that the proposed algorithm is of higher matching rate and better stability.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.