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
Figures, Tables, and Topics from this paper
4 Citations
Fast Class-wise Updating for Online Hashing
- Computer Science, Medicine
- IEEE transactions on pattern analysis and machine intelligence
- 2020
- PDF
Similarity-Preserving Linkage Hashing for Online Image Retrieval
- Computer Science, Medicine
- IEEE Transactions on Image Processing
- 2020
- 5
- PDF
References
SHOWING 1-10 OF 30 REFERENCES
MIHash: Online Hashing with Mutual Information
- Computer Science
- 2017 IEEE International Conference on Computer Vision (ICCV)
- 2017
- 53
- PDF
Adaptive Hashing for Fast Similarity Search
- Computer Science
- 2015 IEEE International Conference on Computer Vision (ICCV)
- 2015
- 56
- PDF
Online Hashing
- Computer Science, Medicine
- IEEE Transactions on Neural Networks and Learning Systems
- 2018
- 68
- PDF
In Defense of Locality-Sensitive Hashing
- Computer Science, Medicine
- IEEE Transactions on Neural Networks and Learning Systems
- 2018
- 14
Semi-Supervised Hashing for Large-Scale Search
- Computer Science, Medicine
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- 2012
- 649
- PDF
Deep Hashing for Scalable Image Search
- Computer Science, Medicine
- IEEE Transactions on Image Processing
- 2017
- 81
- PDF