Abstract

Approximate nearest neighbor search is a kind of significant algorithm to ensure the accuracy and speed for visual search system. In this paper, we ameliorate the search algorithm following the framework of product quantization. Product quantization can generate an exponentially large codebook by a product quantizer and then achieve rapid search with the asymmetric distance computation or symmetric distance computation, while it will still produce a larger distortion in some cases when calculating the approximate distance. Therefore, we design the hierarchical residual product quantization which simultaneously quantifies the input and residual space and meanwhile we extend the asymmetric distance computation to handle this quantization method which is still very efficient to estimate the approximate distance. We have tested our method on several datasets, and the experiment shows that our method consistently improves the accuracy against the-state-of-the-art methods.

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.