Sparse Representation for Computer Vision and Pattern Recognition

被引:1427
作者
Wright, John [1 ,5 ]
Ma, Yi [1 ,5 ]
Mairal, Julien [2 ]
Sapiro, Guillermo [3 ]
Huang, Thomas S. [1 ]
Yan, Shuicheng [4 ]
机构
[1] Univ Illinois, Dept Elect & Comp Engn, Urbana, IL 61801 USA
[2] Ecole Normale Super, INRIA Willow Project, Lab Informat, INRIA,ENS,CNRS,UMR 8548, F-75005 Paris, France
[3] Univ Minnesota, Dept Elect & Comp Engn, Minneapolis, MN 55455 USA
[4] Natl Univ Singapore, Dept Elect & Comp Engn, Singapore 117576, Singapore
[5] Microsoft Res Asia, Visual Comp Grp, Beijing 100190, Peoples R China
基金
美国国家科学基金会;
关键词
Compressed sensing; computer vision; pattern recognition; signal representations; FACE RECOGNITION; DIMENSIONALITY REDUCTION; K-SVD; DICTIONARIES; ILLUMINATION; ALGORITHMS; REGRESSION; EQUATIONS; SYSTEMS; ROBUST;
D O I
10.1109/JPROC.2010.2044470
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Techniques from sparse signal representation are beginning to see significant impact in computer vision, often on nontraditional applications where the goal is not just to obtain a compact high-fidelity representation of the observed signal, but also to extract semantic information. The choice of dictionary plays a key role in bridging this gap: unconventional dictionaries consisting of, or learned from, the training samples themselves provide the key to obtaining state-of-the-art results and to attaching semantic meaning to sparse signal representations. Understanding the good performance of such unconventional dictionaries in turn demands new algorithmic and analytical techniques. This review paper highlights a few representative examples of how the interaction between sparse signal representation and computer vision can enrich both fields, and raises a number of open questions for further study.
引用
收藏
页码:1031 / 1044
页数:14
相关论文
共 96 条
[31]  
DONG Y, 2009, IEEE T PATTERN ANAL
[32]  
Donoho D.L., 2006, Fast solution of l1-norm minimization problems when the solution may be sparse
[33]  
Donoho DavidL., 2005, NEIGHBORLY POLYTOPES
[34]   For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution [J].
Donoho, DL .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (06) :797-829
[35]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306
[36]   Optimally sparse representation in general (nonorthogonal) dictionaries via l1 minimization [J].
Donoho, DL ;
Elad, M .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2003, 100 (05) :2197-2202
[37]   Learning to Sense Sparse Signals: Simultaneous Sensing Matrix and Sparsifying Dictionary Optimization [J].
Duarte-Carvajalino, Julio Martin ;
Sapiro, Guillermo .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2009, 18 (07) :1395-1408
[38]   Least angle regression - Rejoinder [J].
Efron, B ;
Hastie, T ;
Johnstone, I ;
Tibshirani, R .
ANNALS OF STATISTICS, 2004, 32 (02) :494-499
[39]   Optimized projections for compressed sensing [J].
Elad, Michael .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2007, 55 (12) :5695-5702
[40]   Image denoising via sparse and redundant representations over learned dictionaries [J].
Elad, Michael ;
Aharon, Michal .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2006, 15 (12) :3736-3745