Graph Regularised Hashing | Awesome Learning to Hash Add your paper to Learning2Hash

Graph Regularised Hashing

S. Moran, V. Lavrenko. ECIR 2015

[PDF] [Code] [Talk] [Poster]    
Image Retrieval ECIR Has Code Supervised

In this paper we propose a two-step iterative scheme, Graph Regularised Hashing (GRH), for incrementally adjusting the positioning of the hashing hypersurfaces to better conform to the supervisory signal: in the first step the binary bits are regularised using a data similarity graph so that similar data points receive similar bits. In the second step the regularised hashcodes form targets for a set of binary classifiers which shift the position of each hypersurface so as to separate opposite bits with maximum margin. GRH exhibits superior retrieval accuracy to competing hashing methods.

Similar Work