R2SDH: Robust Rotated Supervised Discrete Hashing

Authors:
Jie Gui Rutgers University
Ping Li Baidu Research

Introduction:

This paper studies Learning-based hashing . In this paper, the authors propose a learning-based hashing algorithm called “Robust Rotated Supervised Discrete Hashing” (R 2 SDH), by extending the previous work on “Supervised Discrete Hashing” (SDH).

Abstract:

Learning-based hashing has recently received considerable attentions due to its capability of supporting efficient storage and retrieval of high-dimensional data such as images, videos, and documents. In this paper, we propose a learning-based hashing algorithm called “Robust Rotated Supervised Discrete Hashing” (R 2 SDH), by extending the previous work on “Supervised Discrete Hashing” (SDH). In R 2 SDH, correntropy is adopted to replace the least square regression (LSR) model in SDH for achieving better robustness. Furthermore, considering the commonly used distance metrics such as cosine and Euclidean distance are invariant to rotational transformation, rotation is integrated into the original zero-one label matrix used in SDH, as additional freedom to promote flexibility without sacrificing accuracy. The rotation matrix is learned through an optimization procedure. Experimental results on three image datasets (MNIST, CIFAR-10, and NUS-WIDE) confirm that R 2 SDH generally outperforms SDH.

You may want to know: