Maximum variance hashing via column generation
Summary: 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.
- Unsupervised binary representation learning with deep variational networks
- Multiple feature kernel hashing for large-scale visual search
- Structured learning of binary codes with column generation for optimizing ranking measures
- Learning Binary Hash Codes for Large-Scale Image Search
- Latent structure preserving hashing
- Approximately nearest neighborhood image search using unsupervised hashing via homogeneous kernels
- Hadamard matrix guided online hashing
- Unsupervised binary representation learning with deep variational networks
- Structured learning of binary codes with column generation for optimizing ranking measures
- Semantic hashing with image subspace learning
- Consensus hashing
- Multiple feature kernel hashing for large-scale visual search
This page was built for publication: Maximum variance hashing via column generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q459836)
