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 multi-resolution 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 L 1 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
