The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
Download
Publications Copernicus
Download
Citation
Articles | Volume XLII-2/W16
https://doi.org/10.5194/isprs-archives-XLII-2-W16-215-2019
https://doi.org/10.5194/isprs-archives-XLII-2-W16-215-2019
17 Sep 2019
 | 17 Sep 2019

THE CORRESPONDING POINTS SCREENING ALGORITHM BASED ON GAUSSIAN KERNEL FUZZY CLUSTERING

Q. Tan, H. Zhao, and W. Wu

Keywords: Corresponding Points Matching, Gaussian Kernel, Fuzzy Clustering, High-dimensional Feature Space

Abstract. Corresponding points matching is the basis of three-dimensional reconstruction, but mismatching often occurs in feature matching. Existing algorithms for handling mismatches, such as RANSAC, mostly use the distance from the point to the polar line (i.e., the residual) to determine whether the matching relationship is correct. However, the residual cannot effectively ensure the correctness of the match. In this paper, the Gaussian kernel method is introduced to map the one-dimensional indivisible residual to the high-dimensional feature space, and the inliers and the outliers are distinguished by fuzzy clustering. After simulation data and actual image data verification, the proposed algorithm has significant improvement in accuracy and efficiency compared with the traditional RANSAC algorithm.