8 March 2018 Fast-match on particle swarm optimization with variant system mechanism
Author Affiliations +
Proceedings Volume 10609, MIPPR 2017: Pattern Recognition and Computer Vision; 106090W (2018) https://doi.org/10.1117/12.2284986
Event: Tenth International Symposium on Multispectral Image Processing and Pattern Recognition (MIPPR2017), 2017, Xiangyang, China
Fast-Match is a fast and effective algorithm for approximate template matching under 2D affine transformations, which can match the target with maximum similarity without knowing the target gesture. It depends on the minimum Sum-of-Absolute-Differences (SAD) error to obtain the best affine transformation. The algorithm is widely used in the field of matching images because of its fastness and robustness. In this paper, our approach is to search an approximate affine transformation over Particle Swarm Optimization (PSO) algorithm. We treat each potential transformation as a particle that possesses memory function. Each particle is given a random speed and flows throughout the 2D affine transformation space. To accelerate the algorithm and improve the abilities of seeking the global excellent result, we have introduced the variant system mechanism on this basis. The benefit is that we can avoid matching with huge amount of potential transformations and falling into local optimal condition, so that we can use a few transformations to approximate the optimal solution. The experimental results prove that our method has a faster speed and a higher accuracy performance with smaller affine transformation space.
© (2018) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yuehuang Wang, Yuehuang Wang, Xin Fang, Xin Fang, Jie Chen, Jie Chen, } "Fast-match on particle swarm optimization with variant system mechanism", Proc. SPIE 10609, MIPPR 2017: Pattern Recognition and Computer Vision, 106090W (8 March 2018); doi: 10.1117/12.2284986; https://doi.org/10.1117/12.2284986

Back to Top