Texture Classification from Random Features

被引:223
作者
Liu, Li [1 ]
Fieguth, Paul W. [2 ]
机构
[1] Natl Univ Def Technol, Sch Elect Sci & Engn, Remote Sensing Informat Proc Lab, Changsha 410073, Hunan, Peoples R China
[2] Univ Waterloo, Dept Syst Design Engn, Vis & Image Proc VIP Lab, Waterloo, ON N2L 3G1, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Texture classification; random projections; sparse representation; compressed sensing; textons; image patches; bag of words; FACE RECOGNITION; SIGNAL RECOVERY; PROOF;
D O I
10.1109/TPAMI.2011.145
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Inspired by theories of sparse representation and compressed sensing, this paper presents a simple, novel, yet very powerful approach for texture classification based on random projection, suitable for large texture database applications. At the feature extraction stage, a small set of random features is extracted from local image patches. The random features are embedded into a bag-of-words model to perform texture classification; thus, learning and classification are carried out in a compressed domain. The proposed unconventional random feature extraction is simple, yet by leveraging the sparse nature of texture images, our approach outperforms traditional feature extraction methods which involve careful design and complex steps. We have conducted extensive experiments on each of the CUReT, the Brodatz, and the MSRC databases, comparing the proposed approach to four state-of-the-art texture classification methods: Patch, Patch-MRF, MR8, and LBP. We show that our approach leads to significant improvements in classification accuracy and reductions in feature dimensionality.
引用
收藏
页码:574 / 586
页数:13
相关论文
共 61 条
[1]  
Achlioptas D, 2001, P 20 ACM SIGMOD SIGA, DOI [DOI 10.1145/375551.375608, 10.1145/375551.375608]
[2]   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
[3]  
[Anonymous], 2003, P 20 INT C NONM LEAR
[4]  
[Anonymous], 2000, LECT NOTES MATH
[5]  
[Anonymous], 1966, Textures: a photographic album for artists and designers
[6]  
[Anonymous], 2004, Ph.D. Thesis
[7]  
[Anonymous], P IEEE C COMP VIS PA
[8]   A Simple Proof of the Restricted Isometry Property for Random Matrices [J].
Baraniuk, Richard ;
Davenport, Mark ;
DeVore, Ronald ;
Wakin, Michael .
CONSTRUCTIVE APPROXIMATION, 2008, 28 (03) :253-263
[9]   On the performance of clustering in Hilbert spaces [J].
Biau, Gerard ;
Devroye, Luc ;
Lugosi, Gabor .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (02) :781-790
[10]  
Bingham E, 2001, P 7 ACM SIGKDD INT C, P245, DOI DOI 10.1145/502512.502546