mlsanityData to 14 Oct 2026

SUBIC: A supervised, structured binary code for image search

arXiv 1708.02932 ↗First posted 9 Aug 2017cs.CVcited by 12

Not on the map. Why?

Abstract (arXiv)

For large-scale visual search, highly compressed yet meaningful representations of images are essential. Structured vector quantizers based on product quantization and its variants are usually employed to achieve such compression while minimizing the loss of accuracy. Yet, unlike binary hashing schemes, these unsupervised methods have not yet benefited from the supervision, end-to-end learning and novel architectures ushered in by the deep learning revolution. We hence propose herein a novel method to make deep convolutional neural networks produce supervised, compact, structured binary codes for visual search. Our method makes use of a novel block-softmax non-linearity and of batch-based entropy losses that together induce structure in the learned encodings. We show that our method outperforms state-of-the-art compact representations based on deep hashing or structured quantization in single and cross-domain category retrieval, instance retrieval and classification. We make our code and models publicly available online.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Aug 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 2; 2023: 3; 2024: 1; 2025: 2.

12 papers.