Iterative Quantization: A Procrustean Approach to Learning Binary Codes for Large-Scale Image Retrieval

Citations Over TimeTop 1% of 2012 papers

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.

Related Papers

• → Analysis and Enumeration of Absorbing Sets for Non-Binary Graph-Based Codes(2014)43 cited
• → On the capacity of non-binary write-once memory(2016)4 cited
• → Optimal Binary Linear Complementary Pairs of Codes(2022)5 cited
• → Two-dimensional perfect binary arrays with 64 elements(1990)29 cited
• → A novel coding method for genetic algorithms based on redundant binary numbers(2010)3 cited