Abstract

Interest points have traditionally been favoured over dense features for image retrieval tasks, where the goal is to retrieve images similar to a query image from an image corpus. While interest points are invariant to scale and rotation, their coverage of the image is not adequate for sub-image retrieval problems, where the query image occupies a small part of the corpus image. On the other hand, dense features provide excellent coverage but lack invariance, as they are computed at a fixed scale and orientation. Recently, we proposed a novel technique of combining dense features with interest points (Bhattacharya and Gavrilova, Vis Comput 29(6---8):491---499, 2013) to leverage the benefits of both worlds. This allows dense features to be scale invariant but not rotation invariant. In this paper, we build on this framework by incorporating rotation invariance for dense features and introducing several improvements in the voting and match score computation stages. Our method can produce high-quality recognition results that outperform bag of words even with geometric verification and several state-of-art methods that have considered spatial information. We achieve significant improvements in terms of both search speed and accuracy over (Bhattacharya and Gavrilova, Vis Comput 29(6---8):491---499, 2013). Experiments on Oxford Buildings, Holidays and UKbench datasets reveal that our method is not only robust to viewpoint and scale changes that occur in real-world photographs but also to geometric transformations.

Full Text
Paper version not known

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.