Paper
30 October 2009 Point pattern matching using modified ant colony optimization
Yu Guo, Min Lu, Zhiguo Tan, Ge Ren
Author Affiliations +
Proceedings Volume 7496, MIPPR 2009: Pattern Recognition and Computer Vision; 74960Y (2009) https://doi.org/10.1117/12.833054
Event: Sixth International Symposium on Multispectral Image Processing and Pattern Recognition, 2009, Yichang, China
Abstract
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.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yu Guo, Min Lu, Zhiguo Tan, and Ge Ren "Point pattern matching using modified ant colony optimization", Proc. SPIE 7496, MIPPR 2009: Pattern Recognition and Computer Vision, 74960Y (30 October 2009); https://doi.org/10.1117/12.833054
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Detection and tracking algorithms

Computer vision technology

Machine vision

Algorithm development

Associative arrays

Binary data

Expectation maximization algorithms

Back to Top