Towards Optimal Discrete Online Hashing With Balanced Similarity
2019 · Mingbao Lin, Rongrong Ji, Hong Liu, et al.
Abstract
When facing large-scale image datasets, online hashing serves as a promising solution for online retrieval and prediction tasks. It encodes the online streaming data into compact binary codes, and simultaneously updates the hash functions to renew codes of the existing dataset. To this end, the existing methods update hash functions solely based on the new data batch, without investigating the correlation between such new data and the existing dataset. In addition, existing works update the hash functions using a relaxation process in its corresponding approximated continuous space. And it remains as an open problem to directly apply discrete optimizations in online hashing. In this paper, we propose a novel supervised online hashing method, termed Balanced Similarity for Online Discrete Hashing (BSODH), to solve the above problems in a unified framework. BSODH employs a well-designed hashing algorithm to preserve the similarity between the streaming data and the existing dataset via a
Authors
(none)
Tags
Stats
Related papers
- Supervised Online Hashing Via Similarity Distribution Learning (2019)0.00
- Hadamard Matrix Guided Online Hashing (2019)14.89
- Online Hashing With Efficient Updating Of Binary Codes (2019)8.09
- Deep Supervised Discrete Hashing (2017)0.00
- Online Enhanced Semantic Hashing: Towards Effective And Efficient Retrieval For Streaming Multi-modal Data (2021)8.35
- Weakly-supervised Online Hashing (2020)7.50
- SSDH: Semi-supervised Deep Hashing For Large Scale Image Retrieval (2016)15.40
- Discriminative Supervised Hashing For Cross-modal Similarity Search (2018)7.81