4.7 Article

Learning to Hash With Dimension Analysis Based Quantizer for Image Retrieval

Journal

IEEE TRANSACTIONS ON MULTIMEDIA
Volume 23, Issue -, Pages 3907-3918

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TMM.2020.3033118

Keywords

Quantization (signal); Data acquisition; Image retrieval; Nearest neighbor methods; Hamming distance; Symmetric matrices; Binary codes; Approximate nearest neighbor search; hashing algorithms; image retrieval; quantization

Funding

  1. National Key R&D Program of China [2019YFB2102400]
  2. NSFC [61772112, 61572463]
  3. Science Innovation Foundation of Dalian [2019J12GX037]
  4. Fundamental Research Funds for the Central Universities [2242021R10097]

Ask authors/readers for more resources

The paper introduces a dimension analysis-based quantization method (DAQ) for two-step hashing methods used in image retrieval, which selects informative dimensions and divides them into regions for quantization, estimating similarity through Manhattan distance. Experimental results demonstrate significant accuracy improvements in image retrieval.
The last few years have witnessed the rise of the big data era, in which approximate nearest neighbor search is a fundamental problem in many applications, such as large-scale image retrieval. Recently, many research results demonstrate that hashing can achieve promising performance due to its appealing storage and search efficiency. Since the complex optimization problems for loss functions are difficult to solve, most hashing methods decompose the hash codes learning problem into two steps: projection and quantization. In the quantization step, binary codes are widely used because ranking them by Hamming distance is very efficient. However, the huge information loss produced by the quantization step should be reduced in applications, such as image retrieval where high search accuracy is required. Since many two-step hashing methods produce uneven projected dimensions in the projection step, in this paper, we propose a novel dimension analysis based quantization method (DAQ) on two-step hashing methods for image retrieval. We first perform an importance analysis of the projected dimensions and select a subset of them that are more informative than the others, then we divide the selected projected dimensions into several regions with our quantizer. Every region is quantized with its corresponding codebook. Finally, the similarity between two hash codes is estimated by Manhattan distance between their corresponding codebooks, which is also efficient. We conduct experiments on three public benchmarks containing up to one million descriptors and show that the proposed DAQ method consistently leads to significant accuracy improvements over state-of-the-art quantization methods.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available