Paper
8 September 2011 A fast algorithm for wide baseline match basing on feature points filtration
Zhenjun Zhang, Zhiguo Cao
Author Affiliations +
Abstract
A fast algorithm for wide baseline image match is proposed. The algorithm mainly follows the framework of SIFT (scale invariant feature transform) and bases on analytic signal theory. The proposed method firstly evaluates the characteristics of feature points detected by SIFT basing on criterions educed from Laguerre-Gauss function, and then groups all the feature points into two sets according to their robustness and the criterions. It preserves robust feature points to construct local descriptor and ignores the unstable ones in the later computation. Experiments demonstrate, compared with Lowe's SIFT, that the proposed method not only decreases computing tasks, reduces consumed time, but also improves correct match ratio. It is especially suitable for implementation in real-time system.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Zhenjun Zhang and Zhiguo Cao "A fast algorithm for wide baseline match basing on feature points filtration", Proc. SPIE 8193, International Symposium on Photoelectronic Detection and Imaging 2011: Advances in Infrared Imaging and Applications, 81934Q (8 September 2011); https://doi.org/10.1117/12.903225
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image analysis

Signal analyzers

Detection and tracking algorithms

Machine vision

Real-time computing

Algorithms

Computer vision technology

Back to Top