mlsanityData to 14 Oct 2026

BinGAN: Learning Compact Binary Descriptors with a Regularized GAN

arXiv 1806.06778 ↗First posted 18 Jun 2018cs.CVcited by 13

Not on the map. Why?

Abstract (arXiv)

In this paper, we propose a novel regularization method for Generative Adversarial Networks, which allows the model to learn discriminative yet compact binary representations of image patches (image descriptors). We employ the dimensionality reduction that takes place in the intermediate layers of the discriminator network and train binarized low-dimensional representation of the penultimate layer to mimic the distribution of the higher-dimensional preceding layers. To achieve this, we introduce two loss terms that aim at: (i) reducing the correlation between the dimensions of the binarized low-dimensional representation of the penultimate layer i. e. maximizing joint entropy) and (ii) propagating the relations between the dimensions in the high-dimensional space to the low-dimensional space. We evaluate the resulting binary image descriptors on two challenging applications, image matching and retrieval, and achieve state-of-the-art results.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Jun 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 3; 2022: 6; 2023: 2; 2024: 1; 2025: 0; 2026: 1.

13 papers.

Sort: