Randomized locality sensitive vocabularies for bag-of-features model

Authors:
Yadong Mu;Ju Sun;Tony X. Han;Loong-Fah Cheong;Shuicheng Yan
Affiliations:
Electrical and Computer Engineering, National University of Singapore, Singapore;Electrical and Computer Engineering, National University of Singapore, Singapore and Interactive & Digital Media Institute, National University of Singapore, Singapore;Electrical and Computer Engineering, University of Missouri-Columbia;Electrical and Computer Engineering, National University of Singapore, Singapore and Interactive & Digital Media Institute, National University of Singapore, Singapore;Electrical and Computer Engineering, National University of Singapore, Singapore
Venue:
ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
Year:
2010

Citing 20
Cited 5

Approximate nearest neighbors: towards removing the curse of dimensionality

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Multidimensional binary search trees used for associative searching

Communications of the ACM
Similarity estimation techniques from rounding algorithms

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond

Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Random Forests

Machine Learning
Introduction to Algorithms

Introduction to Algorithms
When Is ''Nearest Neighbor'' Meaningful?

ICDT '99 Proceedings of the 7th International Conference on Database Theory
Experiments with Random Projection

UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Distinctive Image Features from Scale-Invariant Keypoints

International Journal of Computer Vision
Locality-sensitive hashing scheme based on p-stable distributions

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Recognizing Human Actions: A Local SVM Approach

ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
Random Subwindows for Robust Image Classification

CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Creating Efficient Codebooks for Visual Recognition

ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Extremely randomized trees

Machine Learning
Scalable Recognition with a Vocabulary Tree

CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Practical elimination of near-duplicates from web video search

Proceedings of the 15th international conference on Multimedia
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions

Communications of the ACM - 50th anniversary issue: 1958 - 2008
Randomized Clustering Forests for Image Classification

IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust Face Recognition via Sparse Representation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Sampling strategies for bag-of-features image classification

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part IV

Learning reconfigurable hashing for diverse semantics

Proceedings of the 1st ACM International Conference on Multimedia Retrieval
Refining local descriptors by embedding semantic information for visual categorization

MM '11 Proceedings of the 19th ACM international conference on Multimedia
Accelerated large scale optimization by concomitant hashing

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
Latent semantic learning with structured sparse representation for human action recognition

Pattern Recognition
Efficient binary code indexing with pivot based locality sensitive clustering

Multimedia Tools and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Visual vocabulary construction is an integral part of the popular Bag-of-Features (BOF) model. When visual data scale up (in terms of the dimensionality of features or/and the number of samples), most existing algorithms (e.g. k-means) become unfavorable due to the prohibitive time and space requirements. In this paper we propose the random locality sensitive vocabulary (RLSV) scheme towards efficient visual vocabulary construction in such scenarios. Integrating ideas from the Locality Sensitive Hashing (LSH) and the Random Forest (RF), RLSV generates and aggregates multiple visual vocabularies based on random projections, without taking clustering or training efforts. This simple scheme demonstrates superior time and space efficiency over prior methods, in both theory and practice, while often achieving comparable or even better performances. Besides, extensions to supervised and kernelized vocabulary constructions are also discussed and experimented with.