7 September 2010 Keypoint clustering for robust image matching
Author Affiliations +
Abstract
A number of popular image matching algorithms such as Scale Invariant Feature Transform (SIFT)1 are based on local image features. They first detect interest points (or keypoints) across an image and then compute descriptors based on patches around them. In this paper, we observe that in textured or feature-rich images, keypoints typically appear in clusters following patterns in the underlying structure. We show that such clustering phenomenon can be used to: 1) enhance recall and precision performance of the descriptor matching process, and 2) improve convergence rate of the RANSAC algorithm used in the geometric verification stage.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sundeep Vaddadi, Sundeep Vaddadi, Onur Hamsici, Onur Hamsici, Yuriy Reznik, Yuriy Reznik, John Hong, John Hong, Chong Lee, Chong Lee, } "Keypoint clustering for robust image matching", Proc. SPIE 7798, Applications of Digital Image Processing XXXIII, 77980K (7 September 2010); doi: 10.1117/12.862359; https://doi.org/10.1117/12.862359
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT


Back to Top