A Method for Compact Image Representation Using Sparse Matrix and Tensor Projections Onto Exemplar Orthonormal Bases

被引:22
作者
Gurumoorthy, Karthik S. [1 ]
Rajwade, Ajit [1 ]
Banerjee, Arunava [1 ]
Rangarajan, Anand [1 ]
机构
[1] Univ Florida, Dept Comp & Informat Sci & Engn, Gainesville, FL 32611 USA
关键词
Compact representation; compression; greedy algorithm; higher-order singular value decomposition (HOSVD); singular value decomposition (SVD); sparse projections; tensor decompositions; SVD; STATISTICS; ALGORITHM;
D O I
10.1109/TIP.2009.2034991
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a new method for compact representation of large image datasets. Our method is based on treating small patches from a 2-D image as matrices as opposed to the conventional vectorial representation, and encoding these patches as sparse projections onto a set of exemplar orthonormal bases, which are learned a priori from a training set. The end result is a low-error, highly compact image/patch representation that has significant theoretical merits and compares favorably with existing techniques (including JPEG) on experiments involving the compression of ORL and Yale face databases, as well as a database of miscellaneous natural images. In the context of learning multiple orthonormal bases, we show the easy tunability of our method to efficiently represent patches of different complexities. Furthermore, we show that our method is extensible in a theoretically sound manner to higher-order matrices ("tensors"). We demonstrate applications of this theory to compression of well-known color image datasets such as the GaTech and CMU-PIE face databases and show performance competitive with JPEG. Lastly, we also analyze the effect of image noise on the performance of our compression schemes.
引用
收藏
页码:322 / 334
页数:13
相关论文
共 38 条
[1]  
Adams MD, 2004, 2004 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL V, PROCEEDINGS, P241
[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]   SINGULAR VALUE DECOMPOSITION (SVD) IMAGE-CODING [J].
ANDREWS, HC ;
PATTERSON, CL .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1976, 24 (04) :425-432
[4]  
[Anonymous], ORL DATABASE FACES
[5]  
[Anonymous], Uncompressed color image database
[6]  
[Anonymous], Yale Face database
[7]  
[Anonymous], The CMU Pose, Illumination, and Expression (PIE) database
[8]  
[Anonymous], GEORGIA TECH FACE DA
[9]   Higher order SVD analysis for dynamic texture synthesis [J].
Costantini, Roberto ;
Sbaiz, Luciano ;
Suesstrunk, Sabine .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2008, 17 (01) :42-52
[10]   Adaptive greedy approximations [J].
Davis G. ;
Mallat S. ;
Avellaneda M. .
Constructive Approximation, 1997, 13 (1) :57-98