Home > Research > Publications & Outputs > Optimized Projection for Hashing

Electronic data

  • 1-s2.0-S0167865518301478-main

    Rights statement: This is the author’s version of a work that was accepted for publication in Pattern Recognition Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Pattern Recognition Letters, 117, 2019 https://www.sciencedirect.com/journal/pattern-recognition-letters

    Accepted author manuscript, 1.51 MB, PDF document

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Links

Text available via DOI:

View graph of relations

Optimized Projection for Hashing

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published
  • Chaoqun Chu
  • Dahan Gong
  • Kai Chen
  • Yuchen Guo
  • Jungong Han
  • Guiguang Ding
Close
<mark>Journal publication date</mark>01/2019
<mark>Journal</mark>Pattern Recognition Letters
Volume117
Number of pages10
Pages (from-to)169-178
Publication StatusPublished
Early online date19/04/18
<mark>Original language</mark>English

Abstract

Hashing, which seeks for binary codes to represent data, has drawn increasing research interest in recent years. Most existing Hashing methods follow a projection-quantization framework which first projects high-dimensional data into compact low-dimensional space and then quantifies the compact data into binary codes. The projection step plays a key role in Hashing and academia has paid considerable attention to it. Previous works have proven that a good projection should simultaneously 1) preserve important information in original data, and 2) lead to compact representation with low quantization error. However, they adopted a greedy two-step strategy to consider the above two properties separately. In this paper, we empirically show that such a two-step strategy will result in a sub-optimal solution because the optimal solution to 1) limits the feasible set for the solution to 2). We put forward a novel projection learning method for Hashing, dubbed Optimized Projection (OPH). Specifically, we propose to learn the projection in a unified formulation which can find a good trade-off such that the overall performance can be optimized. A general framework is given such that OPH can be incorporated with different Hashing methods for different situations. We also introduce an effective gradient-based optimization algorithm for OPH. We carried out extensive experiments for Hashing-based Approximate Nearest Neighbor search and Content-based Data Retrieval on six benchmark datasets. The results show that OPH significantly outperforms several state-of-the-art related Hashing methods.

Bibliographic note

This is the author’s version of a work that was accepted for publication in Pattern Recognition Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Pattern Recognition Letters, 117, 2019 https://www.sciencedirect.com/journal/pattern-recognition-letters