8 March 2018 A new matching algorithm for affine point sets
Author Affiliations +
Proceedings Volume 10609, MIPPR 2017: Pattern Recognition and Computer Vision; 106090T (2018) https://doi.org/10.1117/12.2284970
Event: Tenth International Symposium on Multispectral Image Processing and Pattern Recognition (MIPPR2017), 2017, Xiangyang, China
Abstract
A novel point pattern matching algorithm based on point feature is proposed. In the paper, we construct the point's feature map, according to the point set's distribution and points' position. Then the log-polar coordinate transformation is applied to the feature map, and the moment invariants method is used to describe the transformed feature map and it's written by the form of vectors. Thus, the curse matching results is acquired by comparing the feature vectors. After these, an iterative method,the relaxation labeling method, is introduced for the final matching result. There are two contributions made in this paper. Firstly, we construct a log-polar coordinate transformation based point feature(L-PTM), which can stand affine transformation.Secondly, a new point pattern matching algorithm is proposed, which is combined L-PTM with the relaxation labeling. The method is insensitive to outliers and noises. Experiments demonstrate the validity and robustness of the algorithm.
© (2018) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Zhiguo Tan, Jianping Ou, Fubing Chen, Jie He, "A new matching algorithm for affine point sets", Proc. SPIE 10609, MIPPR 2017: Pattern Recognition and Computer Vision, 106090T (8 March 2018); doi: 10.1117/12.2284970; https://doi.org/10.1117/12.2284970
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT


Back to Top