Efficient descriptor-filtering Algorithm for speeded up robust features matching

Minwoo Kim, Deokho Kim, Kyungah Kim, Won Woo Ro

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents an efficient descriptor filtering algorithm for the feature matching process of SURF. The matching algorithm used in OpenSURF compares each and every feature descriptors by calculating the root-mean-square error of the descriptor vectors. The proposed instant-termination and Bloom filtering algorithm pre-compares the feature descriptors and decides whether the compared descriptor pairs should be further inspected. The proposed pre-comparison process compares the most significant bits of the descriptor for early decision. Also, the descriptor bits are interleaved to adapt to the Bloom filter, increasing the reliability of the filtering process. Our proposed filtering algorithm effectively reduces the number of root-mean-square error calculations.

Original languageEnglish
Title of host publicationAdvanced in Computer Science and Its Applications, CSA 2013
PublisherSpringer Verlag
Pages125-130
Number of pages6
ISBN (Print)9783642416736
DOIs
Publication statusPublished - 2014
Event5th FTRA International Conference on Computer Science and its Applications, CSA 2013 - Danang, Viet Nam
Duration: 2013 Dec 182013 Dec 21

Publication series

NameLecture Notes in Electrical Engineering
Volume279 LNEE
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Other

Other5th FTRA International Conference on Computer Science and its Applications, CSA 2013
CountryViet Nam
CityDanang
Period13/12/1813/12/21

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Efficient descriptor-filtering Algorithm for speeded up robust features matching'. Together they form a unique fingerprint.

Cite this