doi: 10.4304/jsw.8.9.2197-2201
Real-Time Feature Descriptor Matching via a Multi-Resolution Exhaustive Search Method
Abstract—Feature descriptor matching plays an important role in many computer vision applications. This paper presents a novel fast linear exhaustive search algorithm combined with a multi-resolution candidate elimination technique to deal with this problem efficiently. The proposed algorithm is inspired from the existing multiresolution image retrieval approaches, but releasing the requirement on a norm-sorted database with pre-computed multi-resolution tables. This helps to increase the applicability of the proposed method. Moreover, the computations of candidate elimination are fully performed using a simple L1 distance metric, which is able to speedup the entire search process without loss of accuracy. This property leads to an accurate feature descriptor matching algorithm with real-time performance, which will be validated in the experiments by testing with the matching of SURF descriptors.
Index Terms—Descriptor matching, linear exhaustive search, L1 norm pyramid, multi-resolution examination.
Cite: Chi-Yi Tsai, An-Hung Tsao, Chuan-Wei Wang, "Real-Time Feature Descriptor Matching via a Multi-Resolution Exhaustive Search Method," Journal of Software vol. 8, no. 9, pp. 2197-2201, 2013.
General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Quarterly
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Abstracting/ Indexing: DBLP, EBSCO,
CNKI, Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Oct 22, 2024 News!
Vol 19, No 3 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Jun 12, 2024 News!
Vol 19, No 2 has been published with online version [Click]