Online Hashing With Efficient Updating Of Binary Codes
2019 · Zhenyu Weng, Yuesheng Zhu
Abstract
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 framework, the hash functions are fixed and the projection functions are introduced to learn online from the streaming data. Therefore, inefficient updating of the binary codes by accumulating the whole database can be transformed to efficient updating of the binary codes by projecting the binary codes into another binary space. The queries and the binary code database are projected asymmetrically to further improve the retrieval accuracy. The experiments on two multi-label image databases demon
Authors
(none)
Tags
Stats
Related papers
- Towards Optimal Discrete Online Hashing With Balanced Similarity (2019)12.17
- Hadamard Matrix Guided Online Hashing (2019)14.89
- Simultaneous Feature Aggregating And Hashing For Compact Binary Code Learning (2019)9.92
- Bilinear Supervised Hashing Based On 2D Image Features (2019)8.60
- Deep Supervised Discrete Hashing (2017)0.00
- Compact Hash Code Learning With Binary Deep Neural Network (2017)9.03
- A Non-alternating Graph Hashing Algorithm For Large Scale Image Search (2020)4.52
- Multiple Code Hashing For Efficient Image Retrieval (2020)0.00