Abstract

In this paper, we propose a novel approach to address the problem of the huge amount of local features for a large-scale database. First, in each image the local features are organized into dozens of groups by performing the standard $k$ -means clustering algorithm on their spatial positions. Second, a compact descriptor is generated to describe the visual information of each group of local features. Since, in each image, thousands of local features are reorganized into only dozens of groups and each group is described by a single descriptor, the total amount of descriptors in a large-scale database will be greatly reduced. Therefore, we can reduce the complexity of the searching procedure significantly. Further, the generated group descriptors are encoded into binary format to achieve the storage and computation efficiency. The experiments on two benchmark datasets, i.e., UKBench and Holidays, with the Flickr1M distractor database demonstrate the effectiveness of the proposed approach.

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 call

Disclaimer: 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.