Locality preserving hashing

@article{Tsai2014LocalityPH,
  title={Locality preserving hashing},
  author={Yi-Hsuan Tsai and Ming-Hsuan Yang},
  journal={2014 IEEE International Conference on Image Processing (ICIP)},
  year={2014},
  pages={2988-2992}
}
The spectral hashing algorithm relaxes and solves an objective function for generating hash codes such that data similarity is preserved in the Hamming space. However, the assumption of uniform global data distribution limits its applicability. In the paper, we introduce locality preserving projection to determine the data distribution adaptively, and a spectral method is adopted to estimate the eigenfunctions of the underlying graph Laplacian. Furthermore, pairwise label similarity can be… Expand
14 Citations
Partial Hash Update via Hamming Subspace Learning
  • 5
A Survey on Learning to Hash
  • 509
  • PDF
Neighborhood-Preserving Hashing for Large-Scale Cross-Modal Search
  • 3
A Revisit of Hashing Algorithms for Approximate Nearest Neighbor Search
  • 24
  • Highly Influenced
  • PDF
Kernelized Hashcode Representations for Relation Extraction
  • 6
  • PDF
Multi-feature Hashing Tracking
  • 15
Graph-based Methods for Visualization and Clustering
  • PDF
...
1
2
...

References

SHOWING 1-10 OF 37 REFERENCES
Local Linear Spectral Hashing
  • 4
Learning to Hash with Binary Reconstructive Embeddings
  • 758
  • Highly Influential
  • PDF
Spectral Hashing
  • 2,249
  • Highly Influential
  • PDF
Sequential Projection Learning for Hashing with Compact Codes
  • 322
  • PDF
Harmonious Hashing
  • 56
  • PDF
Hashing with Graphs
  • 893
  • PDF
SPEC hashing: Similarity preserving algorithm for entropy-based coding
  • 76
  • PDF
Locality-sensitive hashing scheme based on p-stable distributions
  • 2,563
  • PDF
Kernelized Locality-Sensitive Hashing
  • B. Kulis, K. Grauman
  • Mathematics, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2012
  • 314
  • Highly Influential
  • PDF
Compressed Hashing
  • 63
  • PDF
...
1
2
3
4
...