A novel visual codebook model based on fuzzy geometry for large-scale image classification

被引:22
作者
Li, Yanshan [1 ]
Huang, Qinghua [2 ,3 ]
Xie, Weixin [1 ]
Li, Xuelong [4 ]
机构
[1] Shenzhen Univ, ATR Natl Key Lab Def Technol, Shenzhen 518060, Peoples R China
[2] S China Univ Technol, Sch Elect & Informat Engn, Guangzhou 510640, Guangdong, Peoples R China
[3] Natl Engn Res Ctr Tissue Restorat & Reconstruct, Guangzhou, Guangdong, Peoples R China
[4] Chinese Acad Sci, Ctr OPT IMagery Anal & Learning OPTIMAL, State Key Lab Transient Opt & Photon, Xian Inst Opt & Precis Mech, Xian 710119, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Codebook; Fuzzy geometry; Fuzzy set theory; Image classification; SPARSE REPRESENTATION; PLANE GEOMETRY; RECOGNITION; SEGMENTATION; SET;
D O I
10.1016/j.patcog.2015.02.010
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The codebook model has been developed as an effective means for image classification. However, the inherent operation of assigning visual words to image feature vectors in traditional codebook approaches causes serious ambiguities in image classification. In particular, the nearest word may not be the best fit to a feature, and multiple words may be equally appropriate for one specific feature. To resolve these ambiguities, we propose a novel visual codebook model based on the n-dimensional fuzzy geometry (n-D FG) theory, where all visual words and features are modeled as fuzzy points in the n-D FG space, and appropriate uncertainty is introduced to each fuzzy point to enhance the representation capacity. This n-D FG-codebook model not only inherits advantages from the fuzzy set theory, but also facilitates the analysis and determination of the relationship between visual words and features in geometric form. By explicitly taking into account the ambiguities, we propose a novel measure of similarity between the visual words and fuzzy features. Following the proposed codebook model and the novel similarity measure, we develop two useful image classification algorithms by modifying popular image coding algorithms (i.e. SPM and LLC). Finally, experimental results demonstrate that the classification accuracy of the proposed algorithms is dramatically improved for a standard large-scale image database. For example, with a codebook size of 256, the proposed algorithms achieve similar performance as traditional algorithms with a codebook size of 1024, indicating that the proposed algorithms reduce the computational cost by 75% while achieving almost identical classification accuracy to traditional algorithms. Thus, the proposed algorithms represent a more efficient and appropriate scheme for big image data. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:3125 / 3134
页数:10
相关论文
共 47 条
[1]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[2]  
[Anonymous], IEEE T PATTERN ANAL, DOI DOI 10.1109/TPAMI.2009.132
[3]  
[Anonymous], CVPR
[4]  
[Anonymous], 2006, 2006 IEEE COMP SOC C
[5]  
[Anonymous], 2009, THESIS
[6]  
[Anonymous], 2010, COMPUTER VISION PATT
[7]  
[Anonymous], CVPR
[8]  
[Anonymous], 1999, ICCV
[9]  
[Anonymous], CVPR
[10]   Fuzzy plane geometry .1. Points and lines [J].
Buckley, JJ ;
Eslami, E .
FUZZY SETS AND SYSTEMS, 1997, 86 (02) :179-187