Research of image matching algorithm based on SURF features
Authors:
- 1 August 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1140-1143
Abstract
Previous images matching uses algorithm based on SIFT which has lots of calculating works and low time-efficiency. In this paper, we use SURF algorithm to detect and descript the interest points, and match the interest points by using high time-efficient KD-tree nearest neighbor searching method. The experimental result shows that it has good time efficiency and excellent robustness.Keywords
This publication has 7 references indexed in Scilit:
- Speeded-Up Robust Features (SURF)Computer Vision and Image Understanding, 2008
- New method for subpixel image matching with rotation invariance by combining the parametric template method and the ring projection transform processOptical Engineering, 2006
- SURF: Speeded Up Robust Features2006
- Distinctive Image Features from Scale-Invariant KeypointsInternational Journal of Computer Vision, 2004
- Scale & Affine Invariant Interest Point DetectorsInternational Journal of Computer Vision, 2004
- Object recognition from local scale-invariant features1999
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975