Abstract

Hashing based approximate nearest neighbor search has become a research hotspot in computer vision. Most existing hashing methods concentrate on projection learning, and few efforts are dedicated to quantization coding. In this paper, we present a multi-bit quantization strategy to improve the quantization quality of projection values by adaptively learning quantization thresholds and quantizing each projection dimension with multiple bits. Our method exploits both the similarity and the local structure of samples in the original feature space and the pair-wise samples coding consistency. Extensive experiments on two canonical image datasets have shown that our method consistently outperforms the state-of-the-art quantization methods in terms of query performance.

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.