Locally Linear Hashing for Extracting Non-Linear Manifolds

Go Irie, Zhenguo Li, Xiao-Ming Wu, Shih-Fu Chang; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2014, pp. 2115-2122

Abstract


Previous efforts in hashing intend to preserve data variance or pairwise affinity, but neither is adequate in capturing the manifold structures hidden in most visual data. In this paper, we tackle this problem by reconstructing the locally linear structures of manifolds in the binary Hamming space, which can be learned by locality-sensitive sparse coding. We cast the problem as a joint minimization of reconstruction error and quantization loss, and show that, despite its NP-hardness, a local optimum can be obtained efficiently via alternative optimization. Our method distinguishes itself from existing methods in its remarkable ability to extract the nearest neighbors of the query from the same manifold, instead of from the ambient space. On extensive experiments on various image benchmarks, our results improve previous state-of-the-art by 28-74% typically, and 627% on the Yale face data.

Related Material


[pdf]
[bibtex]
@InProceedings{Irie_2014_CVPR,
author = {Irie, Go and Li, Zhenguo and Wu, Xiao-Ming and Chang, Shih-Fu},
title = {Locally Linear Hashing for Extracting Non-Linear Manifolds},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2014}
}