Title: Iterative quantization: A procrustean approach to learning binary codes
Abstract: This paper addresses the problem of learning similarity-preserving binary codes for efficient retrieval in large-scale image collections. We propose a simple and efficient alternating minimization scheme for 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. This method, dubbed iterative quantization (ITQ), has connections to multi-class 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). Our experiments show that the resulting binary coding schemes decisively outperform several other state-of-the-art methods.
Publication Year: 2011
Publication Date: 2011-06-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 1079
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot