Journal ArticleDOI
Iterative Quantization: A Procrustean Approach to Learning Binary Codes for Large-Scale Image Retrieval
Reads0
Chats0
TLDR
This paper addresses the problem of learning similarity-preserving binary codes for efficient similarity search in large-scale image collections by proposing a simple and efficient alternating minimization algorithm, dubbed iterative quantization (ITQ), and demonstrating an application of ITQ to learning binary attributes or "classemes" on the ImageNet data set.Abstract:
This paper addresses the problem of learning similarity-preserving binary codes for efficient similarity search in large-scale image collections. We formulate this problem in terms of finding a rotation of zero-centered data so as to minimize the quantization error of mapping this data to the vertices of a zero-centered binary hypercube, and propose a simple and efficient alternating minimization algorithm to accomplish this task. This algorithm, dubbed iterative quantization (ITQ), has connections to multiclass spectral clustering and to the orthogonal Procrustes problem, and it can be used both with unsupervised data embeddings such as PCA and supervised embeddings such as canonical correlation analysis (CCA). The resulting binary codes significantly outperform several other state-of-the-art methods. We also show that further performance improvements can result from transforming the data with a nonlinear kernel mapping prior to PCA or CCA. Finally, we demonstrate an application of ITQ to learning binary attributes or "classemes" on the ImageNet data set.read more
Citations
More filters
Proceedings Article
Hashing for Distributed Data
TL;DR: A novel hashing model to learn hash functions in a distributed setting is developed as a set of subproblems with consensus constraints that can be analytically solved in parallel on the distributed compute nodes.
Proceedings ArticleDOI
GraphBit: Bitwise Interaction Mining via Deep Reinforcement Learning
TL;DR: A deep reinforcement learning model is designed to learn the structure of the graph for bitwise interaction mining, reducing the uncertainty of binary codes by maximizing the mutual information with inputs and related bits, so that the ambiguous bits receive additional instruction from thegraph for confident binarization.
Posted Content
The Power of Asymmetry in Binary Hashing
TL;DR: It is shown that even if the similarity is symmetric, the authors can have shorter and more accurate hashes by using two distinct code maps by approximating the similarity between x and x′ as the hamming distance between f (x) and g (x′), for two distinct binary codes f, g.
Journal ArticleDOI
Multisource Data Reconstruction-Based Deep Unsupervised Hashing for Unisource Remote Sensing Image Retrieval
Yuxi Sun,Yunming Ye,Jian Kang,Ruben Fernandez-Beltran,Yifang Ban,Xutao Li,Bowen Zhang,Antonio Plaza +7 more
TL;DR: Sun et al. as mentioned in this paper proposed a new multisource data reconstruction-based deep unsupervised hashing method, called MrHash, which explores the characteristics of remote sensing images to construct reliable pseudolabels.
Proceedings Article
Norm-Ranging LSH for Maximum Inner Product Search
TL;DR: NORM-RANGING LSH as discussed by the authors addresses the excessive normalization problem caused by long tails by partitioning a dataset into subdatasets and building a hash index for each sub-dataset independently.
References
More filters
Proceedings ArticleDOI
ImageNet: A large-scale hierarchical image database
TL;DR: A new database called “ImageNet” is introduced, a large-scale ontology of images built upon the backbone of the WordNet structure, much larger in scale and diversity and much more accurate than the current image datasets.
Journal ArticleDOI
Distinctive Image Features from Scale-Invariant Keypoints
TL;DR: This paper presents a method for extracting distinctive invariant features from images that can be used to perform reliable matching between different views of an object or scene and can robustly identify objects among clutter and occlusion while achieving near real-time performance.
Dissertation
Learning Multiple Layers of Features from Tiny Images
TL;DR: In this paper, the authors describe how to train a multi-layer generative model of natural images, using a dataset of millions of tiny colour images, described in the next section.
Journal Article
LIBLINEAR: A Library for Large Linear Classification
TL;DR: LIBLINEAR is an open source library for large-scale linear classification that supports logistic regression and linear support vector machines and provides easy-to-use command-line tools and library calls for users and developers.
Journal ArticleDOI
Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope
Aude Oliva,Antonio Torralba +1 more
TL;DR: The performance of the spatial envelope model shows that specific information about object shape or identity is not a requirement for scene categorization and that modeling a holistic representation of the scene informs about its probable semantic category.