Pixel-based template matching suffers from computational cost by increasing potential solutions. Genetic algorithms has been adopted to search hopeful solutions, whereas there is a demand for more accurate matching. In this paper, we propose to employ a modified real-coded genetic algorithm to solve the template matching problem. Specifically, individuals sampled during the exploration process are stored in an archive and spatially clustered in the search space. An enhanced crossover (abbreviated as SHX) exploits the extra cluster information to generate new individuals in more promising regions. To solve the matching problem, this algorithm searches for suitable geometric parameters using a pixel-level dense similarity measure. Experimental results show the effectiveness of SHX for solving the template matching problem.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.