A decision-theoretic generalization of on-line learning and an application to boosting
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Multidimensional binary search trees used for associative searching
Communications of the ACM
Locality-sensitive hashing scheme based on p-stable distributions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Scalable Recognition with a Vocabulary Tree
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Random projection trees and low dimensional manifolds
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
80 Million Tiny Images: A Large Data Set for Nonparametric Object and Scene Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Similarity Search for Learned Metrics
IEEE Transactions on Pattern Analysis and Machine Intelligence
Which spatial partition trees are adaptive to intrinsic dimension?
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Scalable k-NN graph construction for visual descriptors
CVPR '12 Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Complementary hashing for approximate nearest neighbor search
ICCV '11 Proceedings of the 2011 International Conference on Computer Vision
Query-driven iterated neighborhood graph search for large scale indexing
Proceedings of the 20th ACM international conference on Multimedia
Scalable similar image search by joint indices
Proceedings of the 20th ACM international conference on Multimedia
Query-driven iterated neighborhood graph search for large scale indexing
Proceedings of the 20th ACM international conference on Multimedia
Scalable similar image search by joint indices
Proceedings of the 20th ACM international conference on Multimedia
| Hi-index | 0.00 |
Similar image search over a large image database has been attracting a lot of attention recently. The widely-used solution is to use a set of codes, which we call bag-of-delegates, to represent each image, and to build inverted indices to organize the image database. The search can be conducted through the inverted indices, which is the same to the way of using texts to index images for search and has been shown to be efficient and effective. In this paper, we propose a tiny bag-of-delegates representation that uses a small amount of delegates with a high search performance guaranteed. The main advantage is that less storageis required to save the inverted indices while having a high search accuracy. We propose an adaptive forward selection scheme to sequentially learn more and more inverted indices that are constructed based on subspace partition, e.g. using spatial partition trees. Experimental results demonstrate that our approach can require a smaller number of delegates while achieving the same accuracy and taking similar time.