Learning Effective Binary Visual Representations with Deep Networks
Although traditionally binary visual representations are mainly designed to reduce computational and storage costs in the image retrieval research, this paper argues that binary visual representations can be applied to large scale recognition and detection problems in addition to hashing in retrieval. Furthermore, the binary nature may make it generalize better than its real-valued counterparts. Existing binary hashing methods are either two-stage or hinging on loss term regularization or saturated functions, hence converge slowly and only emit soft binary values. This paper proposes Approximately Binary Clamping (ABC), which is non-saturating, end-to-end trainable, with fast convergence and can output true binary visual representations. ABC achieves comparable accuracy in ImageNet classification as its real-valued counterpart, and even generalizes better in object detection. On benchmark image retrieval datasets, ABC also outperforms existing hashing methods.
Code (0)
등록된 구현이 없습니다.
Tasks
General ClassificationImage Retrievalobject-detectionObject DetectionRetrievalSimilar Papers 제목 키워드 기반
Self-Supervised Learning as Discrete Communication
Most self-supervised learning (SSL) methods learn continuous visual representations by aligning different views of the same input, offering limited control over how information is structured across representation dimensi…
Self-Supervised LearningImage ClassificationMalGrid: Visualization Of Binary Features In Large Malware Corpora
The number of malware is constantly on the rise. Though most new malware are modifications of existing ones, their sheer number is quite overwhelming. In this paper, we present a novel system to visualize and map million…
Projection Bank: From High-dimensional Data to Medium-length Binary Codes
Recently, very high-dimensional feature representations, e.g., Fisher Vector, have achieved excellent performance for visual recognition and retrieval. However, these lengthy representations always cause extremely heavy …
Computational EfficiencyRetrievalVocal Bursts Intensity PredictionDeep Binaries: Encoding Semantic-Rich Cues for Efficient Textual-Visual Cross Retrieval
Cross-modal hashing is usually regarded as an effective technique for large-scale textual-visual cross retrieval, where data from different modalities are mapped into a shared Hamming space for matching. Most of the trad…
Cross-Modal RetrievalDescriptiveRetrievalSUBIC: A supervised, structured binary code for image search
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 co…
Deep HashingImage RetrievalQuantizationRetrieval