A Local Elitism Based Membrane Evolutionary Algorithm for Point Pattern Matching

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. © Springer-Verlag Berlin Heidelberg 2013.