A General Two-Step Approach to Learning-Based Hashing

Guosheng Lin, Chunhua Shen, David Suter, Anton van den Hengel; Proceedings of the IEEE International Conference on Computer Vision (ICCV), 2013, pp. 2552-2559


Most existing approaches to hashing apply a single form of hash function, and an optimization process which is typically deeply coupled to this specific form. This tight coupling restricts the flexibility of the method to respond to the data, and can result in complex optimization problems that are difficult to solve. Here we propose a flexible yet simple framework that is able to accommodate different types of loss functions and hash functions. This framework allows a number of existing approaches to hashing to be placed in context, and simplifies the development of new problemspecific hashing methods. Our framework decomposes the hashing learning problem into two steps: hash bit learning and hash function learning based on the learned bits. The first step can typically be formulated as binary quadratic problems, and the second step can be accomplished by training standard binary classifiers. Both problems have been extensively studied in the literature. Our extensive experiments demonstrate that the proposed framework is effective, flexible and outperforms the state-of-the-art.

Related Material

author = {Lin, Guosheng and Shen, Chunhua and Suter, David and van den Hengel, Anton},
title = {A General Two-Step Approach to Learning-Based Hashing},
booktitle = {Proceedings of the IEEE International Conference on Computer Vision (ICCV)},
month = {December},
year = {2013}