Auto-encoding Twin-bottleneck Hashing
2020 · Yuming Shen, Jie Qin, Jiaxin Chen, et al.
Abstract
Conventional unsupervised hashing methods usually take advantage of similarity graphs, which are either pre-computed in the high-dimensional space or obtained from random anchor points. On the one hand, existing methods uncouple the procedures of hash function learning and graph construction. On the other hand, graphs empirically built upon original data could introduce biased prior knowledge of data relevance, leading to sub-optimal retrieval performance. In this paper, we tackle the above problems by proposing an efficient and adaptive code-driven graph, which is updated by decoding in the context of an auto-encoder. Specifically, we introduce into our framework twin bottlenecks (i.e., latent variables) that exchange crucial information collaboratively. One bottleneck (i.e., binary codes) conveys the high-level intrinsic data structure captured by the code-driven graph to the other (i.e., continuous variables for low-level detail information), which in turn propagates the updated net
Authors
(none)
Tags
Stats
Related papers
- Self-supervised Bernoulli Autoencoders For Semi-supervised Hashing (2020)3.66
- Self-supervised Video Hashing With Hierarchical Binary Auto-encoder (2018)17.81
- Graph-collaborated Auto-encoder Hashing For Multi-view Binary Clustering (2023)14.31
- Unsupervised Hashing With Contrastive Information Bottleneck (2021)13.50
- Learning A Deep \(\ell_\infty\) Encoder For Hashing (2016)0.00
- Learning To Hash With Binary Deep Neural Network (2016)14.93
- Unsupervised Deep Hashing For Large-scale Visual Search (2016)9.59
- Compact Hash Code Learning With Binary Deep Neural Network (2017)9.03