Online Hashing with Efficient Updating of Binary Codes

@article{Weng2020OnlineHW,
  title={Online Hashing with Efficient Updating of Binary Codes},
  author={Zhenyu Weng and Yue-sheng Zhu},
  journal={ArXiv},
  year={2020},
  volume={abs/1911.12125}
}
Online hashing methods are efficient in learning the hash functions from the streaming data. However, when the hash functions change, the binary codes for the database have to be recomputed to guarantee the retrieval accuracy. Recomputing the binary codes by accumulating the whole database brings a timeliness challenge to the online retrieval process. In this paper, we propose a novel online hashing framework to update the binary codes efficiently without accumulating the whole database. In our… Expand
4 Citations
Fast Class-wise Updating for Online Hashing
  • PDF
Similarity-Preserving Linkage Hashing for Online Image Retrieval
  • 5
  • PDF
Label Embedding Online Hashing for Cross-Modal Retrieval
Weakly-Supervised Online Hashing
  • PDF

References

SHOWING 1-10 OF 30 REFERENCES
MIHash: Online Hashing with Mutual Information
  • 53
  • PDF
Adaptive Hashing for Fast Similarity Search
  • 56
  • PDF
Supervised Online Hashing via Hadamard Codebook Learning
  • 19
  • PDF
Online Cross-Modal Hashing for Web Image Retrieval
  • 49
Online Hashing
  • 68
  • PDF
In Defense of Locality-Sensitive Hashing
  • 14
Dynamic Multi-View Hashing for Online Image Retrieval
  • 63
  • PDF
Semi-Supervised Hashing for Large-Scale Search
  • J. Wang, S. Kumar, S. Chang
  • Computer Science, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2012
  • 649
  • PDF
Deep Hashing for Scalable Image Search
  • 81
  • PDF
...
1
2
3
...