Top Rank Supervised Binary Coding for Visual Search
Authors:
- Dongjin SongDSDongjin Song
- Wei LiuWLWei Liu
- Rongrong JiRJRongrong Ji
- David A. MeyerDMDavid A. Meyer
- John R. SmithJSJohn R. Smith
- 1 December 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1922-1930
Abstract
In recent years, binary coding techniques are becoming increasingly popular because of their high efficiency in handling large-scale computer vision applications. It has been demonstrated that supervised binary coding techniques that leverage supervised information can significantly enhance the coding quality, and hence greatly benefit visual search tasks. Typically, a modern binary coding method seeks to learn a group of coding functions which compress data samples into binary codes. However, few methods pursued the coding functions such that the precision at the top of a ranking list according to Hamming distances of the generated binary codes is optimized. In this paper, we propose a novel supervised binary coding approach, namely Top Rank Supervised Binary Coding (Top-RSBC), which explicitly focuses on optimizing the precision of top positions in a Hamming-distance ranking list towards preserving the supervision information. The core idea is to train the disciplined coding functions, by which the mistakes at the top of a Hamming-distance ranking list are penalized more than those at the bottom. To solve such coding functions, we relax the original discrete optimization objective with a continuous surrogate, and derive a stochastic gradient descent to optimize the surrogate objective. To further reduce the training time cost, we also design an online learning algorithm to optimize the surrogate objective more efficiently. Empirical studies based upon three benchmark image datasets demonstrate that the proposed binary coding approach achieves superior image search accuracy over the state-of-the-arts.Keywords
This publication has 16 references indexed in Scilit:
- Sparse composite quantization2015
- Learning Hash Codes with Listwise Supervision2013
- Kernelized Locality-Sensitive HashingIEEE Transactions on Pattern Analysis and Machine Intelligence, 2011
- Face recognition in unconstrained videos with matched background similarity2011
- Large scale image annotation: learning to rank with joint word-image embeddingsMachine Learning, 2010
- SUN database: Large-scale scene recognition from abbey to zoo2010
- Fast Similarity Search for Learned MetricsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2009
- Feature hashing for large scale multitask learning2009
- Near-optimal hashing algorithms for approximate nearest neighbor in high dimensionsCommunications of the ACM, 2008
- Face Description with Local Binary Patterns: Application to Face RecognitionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2006