Supervised Online Hashing Via Similarity Distribution Learning
2019 · Mingbao Lin, Rongrong Ji, Shen Chen, et al.
Abstract
Online hashing has attracted extensive research attention when facing streaming data. Most online hashing methods, learning binary codes based on pairwise similarities of training instances, fail to capture the semantic relationship, and suffer from a poor generalization in large-scale applications due to large variations. In this paper, we propose to model the similarity distributions between the input data and the hashing codes, upon which a novel supervised online hashing method, dubbed as Similarity Distribution based Online Hashing (SDOH), is proposed, to keep the intrinsic semantic relationship in the produced Hamming space. Specifically, we first transform the discrete similarity matrix into a probability matrix via a Gaussian-based normalization to address the extremely imbalanced distribution issue. And then, we introduce a scaling Student t-distribution to solve the challenging initialization problem, and efficiently bridge the gap between the known and unknown distributions.
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
- Discriminative Supervised Hashing For Cross-modal Similarity Search (2018)7.81
- Online Enhanced Semantic Hashing: Towards Effective And Efficient Retrieval For Streaming Multi-modal Data (2021)8.35
- Deep Supervised Discrete Hashing (2017)0.00
- Learning To Hash With Semantic Similarity Metrics And Empirical KL Divergence (2020)0.00
- Pairwise Teacher-student Network For Semi-supervised Hashing (2019)6.77
- Scalable Discrete Supervised Hash Learning With Asymmetric Matrix Factorization (2016)4.52