Maximum variance hashing via column generation
Files
(Published version)
Date
2013
Authors
Luo, L.
Zhang, C.
Qin, Y.
Zhang, C.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
Mathematical Problems in Engineering, 2013; 2013:1-10
Statement of Responsibility
Lei Luo, Chao Zhang, Yongrui Qin, and Chunyuan Zhang
Conference Name
Abstract
With the explosive growth of the data volume in modern applications such as web search and multimedia retrieval, hashing is becoming increasingly important for efficient nearest neighbor (similar item) search. Recently, a number of data-dependent methods have been developed, reflecting the great potential of learning for hashing. Inspired by the classic nonlinear dimensionality reduction algorithm—maximum variance unfolding, we propose a novel unsupervised hashing method, named maximum variance hashing, in this work. The idea is to maximize the total variance of the hash codes while preserving the local structure of the training data. To solve the derived optimization problem, we propose a column generation algorithm, which directly learns the binary-valued hash functions. We then extend it using anchor graphs to reduce the computational cost. Experiments on large-scale image datasets demonstrate that the proposed method outperforms state-of-the-art hashing methods in many cases.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright © 2013 Lei Luo et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.