Hadamard Matrix Guided Online Hashing
2019 · Mingbao Lin, Rongrong Ji, Hong Liu, et al.
Abstract
Online image hashing has attracted increasing research attention recently, which receives large-scale data in a streaming manner to update the hash functions on-the-fly. Its key challenge lies in the difficulty of balancing the learning timeliness and model accuracy. To this end, most works follow a supervised setting, i.e., using class labels to boost the hashing performance, which defects in two aspects: First, strong constraints, e.g., orthogonal or similarity preserving, are used, which however are typically relaxed and lead to large accuracy drop. Second, large amounts of training batches are required to learn the up-to-date hash functions, which largely increase the learning complexity. To handle the above challenges, a novel supervised online hashing scheme termed Hadamard Matrix Guided Online Hashing (HMOH) is proposed in this paper. Our key innovation lies in introducing Hadamard matrix, which is an orthogonal binary matrix built via Sylvester method. In particular, to release
Authors
(none)
Tags
Stats
Related papers
- Towards Optimal Discrete Online Hashing With Balanced Similarity (2019)12.17
- Supervised Online Hashing Via Similarity Distribution Learning (2019)0.00
- Weakly-supervised Online Hashing (2020)7.50
- Online Hashing With Efficient Updating Of Binary Codes (2019)8.09
- Scalable Discrete Supervised Hash Learning With Asymmetric Matrix Factorization (2016)4.52
- Making Online Sketching Hashing Even Faster (2020)9.23
- Online Enhanced Semantic Hashing: Towards Effective And Efficient Retrieval For Streaming Multi-modal Data (2021)8.35
- Deep Self-adaptive Hashing For Image Retrieval (2021)8.35