2 December 2011 Image matching by affine speed-up robust features
Author Affiliations +
Proceedings Volume 8004, MIPPR 2011: Pattern Recognition and Computer Vision; 80040G (2011) https://doi.org/10.1117/12.900333
Event: Seventh International Symposium on Multispectral Image Processing and Pattern Recognition (MIPPR2011), 2011, Guilin, China
Abstract
Affine invariant image comparison is always consequential in computer vision. In this paper, affine-SURF (ASURF) is introduced. Through a series of affine transformations and feature extraction, the matching algorithm becomes more robust with the view and scale change. A kd-tree structure is build to store the feature sets and BBF search algorithm is used in feature matching, then duplicates are removed by the conditional of Euclidean distance ratio. Experiments show it has a good result, comparisons with SIFT and SURF is made to prove its performance.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chen Lin, Chen Lin, Jin Liu, Jin Liu, Liang Cao, Liang Cao, } "Image matching by affine speed-up robust features", Proc. SPIE 8004, MIPPR 2011: Pattern Recognition and Computer Vision, 80040G (2 December 2011); doi: 10.1117/12.900333; https://doi.org/10.1117/12.900333
PROCEEDINGS
5 PAGES


SHARE
Back to Top