This paper proposes an ant colony optimization (ACO) based approach for point pattern matching (PPM) under affine
transformation. In the paper, the point sets matching problem is formulated as a mixed variable (binary and continuous)
optimization problem. The ACO is used to search for the optimal transformation parameters. There are two contributions
made in this paper. Firstly, we manage to modify the original ACO method by combining it with the leastsquares
method. Thus, it can handle with the continuous spatial mapping parameters searching. Secondly, we introduce a
threshold to correspondence finding, which rejects outliers and enhances veracity while using "Nearest Neighbors
Search". Experiments demonstrate the validity and robustness of the algorithm.
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.