Large-scale image retrieval using similarity preserving binary codesPublic Deposited
Add to collection
You do not have access to any existing collections. You may create a new collection.
Downloadable ContentDownload PDF
MLAGong, Yunchao. Large-scale Image Retrieval Using Similarity Preserving Binary Codes. University of North Carolina at Chapel Hill, 2014. https://doi.org/10.17615/470w-ax39
APAGong, Y. (2014). Large-scale image retrieval using similarity preserving binary codes. University of North Carolina at Chapel Hill. https://doi.org/10.17615/470w-ax39
ChicagoGong, Yunchao. 2014. Large-Scale Image Retrieval Using Similarity Preserving Binary Codes. University of North Carolina at Chapel Hill. https://doi.org/10.17615/470w-ax39
- Last Modified
- March 22, 2019
- Affiliation: College of Arts and Sciences, Department of Computer Science
- Image retrieval is a fundamental problem in computer vision, and has many applications. When the dataset size gets very large, retrieving images in Internet image collections becomes very challenging. The challenges come from storage, computation speed, and similarity representation. My thesis addresses learning compact similarity preserving binary codes, which represent each image by a short binary string, for fast retrieval in large image databases. I will first present an approach called Iterative Quantization to convert high-dimensional vectors to compact binary codes, which works by learning a rotation to minimize the quantization error of mapping data to the vertices of a binary Hamming cube. This approach achieves state-of-the-art accuracy for preserving neighbors in the original feature space, as well as state-of-the-art semantic precision. Second, I will extend this approach to two different scenarios in large-scale recognition and retrieval problems. The first extension is aimed at high-dimensional histogram data, such as bag-of-words features or text documents. Such vectors are typically sparse and nonnegative. I develop an algorithm that explores the special structure of such data by mapping feature vectors to binary vertices in the positive orthant, which gives improved performance. The second extension is for Fisher Vectors, which are dense descriptors having tens of thousands to millions of dimensions. I develop a novel method for converting such descriptors to compact similarity-preserving binary codes that exploits their natural matrix structure to reduce their dimensionality using compact bilinear projections instead of a single large projection matrix. This method achieves retrieval and classification accuracy comparable to that of the original descriptors and to the state-of-the-art Product Quantization approach while having orders of magnitude faster code generation time and smaller memory footprint. Finally, I present two applications of using Internet images and tags/labels to learn binary codes with label supervision, and show improved retrieval accuracy on several large Internet image datasets. First, I will present an application that performs cross-modal retrieval in the Hamming space. Then I will present an application on using supervised binary classeme representations for large-scale image retrieval.
- Date of publication
- May 2014
- Resource type
- Rights statement
- In Copyright
- Lazebnik, Svetlana
- Doctor of Philosophy
- Degree granting institution
- University of North Carolina at Chapel Hill
- Graduation year
This work has no parents.