A novel visual codebook model based on fuzzy geometry for large-scale image classification. Issue 10 (October 2015)

• Record Type: Journal Article
• Authors: Li, Yanshan; Huang, Qinghua; Xie, Weixin; Li, Xuelong
• Is Part Of: Pattern recognition. Volume 48:Issue 10(2015:Oct.)
• Page Start: 3125
• Page End: 3134
• Publication Date: 2015-10
• Subjects: Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2015.02.010
• Languages: English
• ISSNs: 0031-3203

Abstract

<abstract abstract-type="author" id="ab0005"> <title id="sect0005">Abstract</title> <sec> <p id="sp0045">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 <italic>n-</italic>dimensional fuzzy geometry (<italic>n</italic>-D FG) theory, where all visual words and features are modeled as fuzzy points in the <italic>n</italic>-D FG space, and appropriate uncertainty is introduced to each fuzzy point to enhance the representation capacity. This <italic>n</italic>-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.</p> </sec> </abstract>