Ordinal Constrained Binary Code Learning for Nearest Neighbor Search

@inproceedings{Liu2017OrdinalCB,
  title={Ordinal Constrained Binary Code Learning for Nearest Neighbor Search},
  author={Hong W. Liu and Rongrong Ji and Yongjian Wu and Feiyue Huang},
  booktitle={AAAI},
  year={2017}
}
Recent years have witnessed extensive attention in binary code learning, a.k.a. hashing, for nearest neighbor search problems. It has been seen that high-dimensional data points can be quantized into binary codes to give an efficient similarity approximation via Hamming distance. Among existing schemes, ranking-based hashing is recent promising that targets at preserving ordinal relations of ranking in the Hamming space to minimize retrieval loss. However, the size of the ranking tuples, which… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 8 times. VIEW TWEETS

Citations

Publications citing this paper.
Showing 1-7 of 7 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 36 references

Spherical Hashing: Binary Code Embedding with Hyperspheres

IEEE Transactions on Pattern Analysis and Machine Intelligence • 2015
View 4 Excerpts
Highly Influenced

Iterative Quantization: A Procrustean Approach to Learning Binary Codes for Large-Scale Image Retrieval

IEEE Transactions on Pattern Analysis and Machine Intelligence • 2013
View 6 Excerpts
Highly Influenced

Hashing with Graphs

View 6 Excerpts
Highly Influenced

Locality-sensitive hashing scheme based on p-stable distributions

Symposium on Computational Geometry • 2004
View 5 Excerpts
Highly Influenced

Linear dimensionality reduction: survey, insights, and generalizations

Journal of Machine Learning Research • 2015
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…