Journal Article10.1109/TPAMI.2018.2858760
Learning Deep Binary Descriptor with Multi-Quantization
50
TL;DR: A K-Autoencoders (KAEs) network is designed to jointly learn the parameters of feature extractor and the binarization functions under a deep learning framework, so that discriminative binary descriptors can be obtained with a fine-grained multi-quantization.
read more
Abstract: In this paper, we propose an unsupervised feature learning method called deep binary descriptor with multi-quantization (DBD-MQ) for visual analysis. Existing learning-based binary descriptors such as compact binary face descriptor (CBFD) and DeepBit utilize the rigid sign function for binarization despite of data distributions, which usually suffer from severe quantization loss. In order to address the limitation, we propose a deep multi-quantization network to learn a data-dependent binarization in an unsupervised manner. More specifically, we design a K-Autoencoders (KAEs) network to jointly learn the parameters of feature extractor and the binarization functions under a deep learning framework, so that discriminative binary descriptors can be obtained with a fine-grained multi-quantization. As DBD-MQ simply allocates the same number of quantizers to each real-valued feature dimension ignoring the elementwise diversity of informativeness, we further propose a deep competitive binary descriptor with multi-quantization (DCBD-MQ) method to learn optimal allocation of bits with the fixed binary length in a competitive manner, where informative dimensions gain more bits for complete representation. Moreover, we present a similarity-aware binary encoding strategy based on the earth mover's distance of Autoencoders, so that elements that are quantized into similar Autoencoders will have smaller Hamming distances. Extensive experimental results on six widely-used datasets show that our DBD-MQ and DCBD-MQ outperform most state-of-the-art unsupervised binary descriptors.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Survey of Quantization Methods for Efficient Neural Network Inference
12 Jan 2022
TL;DR: In this paper , the authors provide approaches to quantizing the numerical values in deep neural network computations, covering the advantages/disadvantages of current methods, and provide a survey of the history of quantization up to 1998.
612
A Decade Survey of Content Based Image Retrieval Using Deep Learning
TL;DR: A comprehensive survey of deep learning based developments in the past decade for content-based image retrieval is presented in this paper , where a performance analysis is also performed using the state-of-the-art methods.
A Deep Learning Approach for Multi-Frame In-Loop Filter of HEVC
TL;DR: A multi-frame in-loop filter (MIF) for HEVC, which enhances the visual quality of each encoded frame by leveraging its adjacent frames and utilizing the spatial information of this frame and the temporal information of its neighboring higher-quality frames.
173
Learning Deep Binary Descriptor with Multi-quantization
Yueqi Duan,Jiwen Lu,Ziwei Wang,Jianjiang Feng,Jie Zhou +4 more
- 01 Jul 2017
TL;DR: An unsupervised feature learning method called deep binary descriptor with multi-quantization (DBD-MQ) for visual matching that applies a K-AutoEncoders (KAEs) network to jointly learn the parameters and the binarization functions under a deep learning framework so that discriminative binary descriptors can be obtained with a fine-grained multi- quantization.
Similarity-Preserving Linkage Hashing for Online Image Retrieval
TL;DR: A novel online hashing method, termed Similarity Preserving Linkage Hashing (SPLH), which not only utilizes pairwise similarity to learn the intra- class relationships, but also fully exploits a latent linkage space to capture the inter-class relationships and the common characteristics between label vectors and to-be-learned hash codes.
63
References
Distinctive Image Features from Scale-Invariant Keypoints
Matthijs Dorst
- 01 Jan 2011
TL;DR: The Scale-Invariant Feature Transform (or SIFT) algorithm is a highly robust method to extract and consequently match distinctive invariant features from images that can then be used to reliably match objects in diering images.
15.8K
•Proceedings Article
Faster R-CNN: towards real-time object detection with region proposal networks
Shaoqing Ren,Kaiming He,Ross Girshick,Jian Sun +3 more
- 07 Dec 2015
TL;DR: Ren et al. as discussed by the authors proposed a region proposal network (RPN) that shares full-image convolutional features with the detection network, thus enabling nearly cost-free region proposals.
•Posted Content
Rich feature hierarchies for accurate object detection and semantic segmentation
TL;DR: This paper proposes a simple and scalable detection algorithm that improves mean average precision (mAP) by more than 30% relative to the previous best result on VOC 2012 -- achieving a mAP of 53.3%.
13.1K
ORB: An efficient alternative to SIFT or SURF
Ethan Rublee,Vincent Rabaud,Kurt Konolige,Gary Bradski +3 more
- 06 Nov 2011
TL;DR: This paper proposes a very fast binary descriptor based on BRIEF, called ORB, which is rotation invariant and resistant to noise, and demonstrates through experiments how ORB is at two orders of magnitude faster than SIFT, while performing as well in many situations.
11.8K
•Posted Content
SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <0.5MB model size
TL;DR: This work proposes a small DNN architecture called SqueezeNet, which achieves AlexNet-level accuracy on ImageNet with 50x fewer parameters and is able to compress to less than 0.5MB (510x smaller than AlexNet).