Randomized Locality Sensitive Vocabularies for Bag-of-Features Model

被引:0
作者
Mu, Yadong [1 ]
Sun, Ju [1 ,2 ]
Han, Tony X. [3 ]
Cheong, Loong-Fah [1 ,2 ]
Yan, Shuicheng [1 ]
机构
[1] Natl Univ Singapore, Elect & Comp Engn, Singapore 117548, Singapore
[2] Natl Univ Singapore, Interact & Digital Media Inst, Singapore 117548, Singapore
[3] Univ Missouri, Elect & Comp Engn, Columbia, SC 65211 USA
来源
COMPUTER VISION-ECCV 2010, PT III | 2010年 / 6313卷
关键词
NEAREST-NEIGHBOR; IMAGE;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 (RE), 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.
引用
收藏
页码:748 / +
页数:2
相关论文
共 24 条
[1]   Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions [J].
Andoni, Alexandr ;
Indyk, Piotr .
COMMUNICATIONS OF THE ACM, 2008, 51 (01) :117-122
[2]  
BENTLEY JL, 1975, ACM COMMUN, V517, P509
[3]  
Beyer K, 1999, LECT NOTES COMPUT SC, V1540, P217
[4]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[5]  
Charikar Moses S, 2002, P 34 ANN ACM S THEOR, P380, DOI DOI 10.1145/509907.509965
[6]  
Cormen T., 2001, Introduction to Algorithms
[7]   Histograms of oriented gradients for human detection [J].
Dalal, N ;
Triggs, B .
2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2005, :886-893
[8]  
Dasgupta S., 2000, P 16 C UNCERTAINTY A, P143, DOI [10.5555/647234.719759, DOI 10.5555/647234.719759]
[9]   Extremely randomized trees [J].
Geurts, P ;
Ernst, D ;
Wehenkel, L .
MACHINE LEARNING, 2006, 63 (01) :3-42
[10]  
Indyk P., 1998, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, P604, DOI 10.1145/276698.276876