• DOI:10.1109/TPAMI.2015.2404776
Corpus ID: 14355364

Supervised Hashing Using Graph Cuts and Boosted Decision Trees

@article{Lin2015SupervisedHU,
  title={Supervised Hashing Using Graph Cuts and Boosted Decision Trees},
  author={Guosheng Lin and Chunhua Shen and A. V. D. Hengel},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year={2015},
  volume={37},
  pages={2317-2331}
}

Guosheng Lin, Chunhua Shen, A. V. D. Hengel

Published 2015

Computer Science, Medicine

IEEE Transactions on Pattern Analysis and Machine Intelligence

To build large-scale query-by-example image retrieval systems, embedding image features into a binary Hamming space provides great benefits. Supervised hashing aims to map the original features to compact binary codes that are able to preserve label based similarity in the binary Hamming space. Most existing approaches apply a single form of hash function, and an optimization process which is typically deeply coupled to this specific form. This tight coupling restricts the flexibility of those… CONTINUE READING

View on IEEE

arxiv.org

Save to Library

Create Alert

Cite

Launch Research Feed