Fast Feature Matching by Coarse-to-Fine Comparison of Rearranged SURF Descriptors

Hanhoon PARK  Kwang-Seok MOON  

IEICE TRANSACTIONS on Information and Systems   Vol.E98-D   No.1   pp.210-213
Publication Date: 2015/01/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2014EDL8149
Type of Manuscript: LETTER
Category: Image Processing and Video Processing
feature matching,  partial comparison,  descriptor rearrangement,  entropy analysis,  SURF,  coarse-to-fine approach,  

Full Text: PDF(410.1KB)
>>Buy this Article

Speeded up robust features (SURF) can detect/describe scale- and rotation-invariant features at high speed by relying on integral images for image convolutions. However, the time taken for matching SURF descriptors is still long, and this has been an obstacle for use in real-time applications. In addition, the matching time further increases in proportion to the number of features and the dimensionality of the descriptor. Therefore, we propose a fast matching method that rearranges the elements of SURF descriptors based on their entropies, divides SURF descriptors into sub-descriptors, and sequentially and analytically matches them to each other. Our results show that the matching time could be reduced by about 75% at the expense of a small drop in accuracy.