TY - JOUR
T1 - Applications of sparse representation and compressive sensing
AU - Baraniuk, Richard G.
AU - Candes, Emmanuel
AU - Elad, Michael
AU - Ma, Yi
PY - 2010/6
Y1 - 2010/6
N2 - Applications of sparse representation and compressive sensing are discussed. A sparse signal is a signal that can be represented as a linear combination of relatively few base elements in a basis or an over complete dictionary. The new theory of sparse representation and compressive sensing not only establishes a more rigorous mathematical framework for studying high-dimensional data, but also provides computationally feasible ways to uncover the structures of the data, giving rise to a large repertoire of efficient algorithms. The papers aim to provide good survey or review of past achievements in the field, or feature some new exciting developments by the authors, or discuss promising new directions and extensions. The new theory of sparse representation and compressive sensing not only establishes a more rigorous mathematical framework for studying high-dimensional data, but also provides computationally feasible ways to uncover the structures of the data, giving rise to a large repertoire of efficient algorithms.
AB - Applications of sparse representation and compressive sensing are discussed. A sparse signal is a signal that can be represented as a linear combination of relatively few base elements in a basis or an over complete dictionary. The new theory of sparse representation and compressive sensing not only establishes a more rigorous mathematical framework for studying high-dimensional data, but also provides computationally feasible ways to uncover the structures of the data, giving rise to a large repertoire of efficient algorithms. The papers aim to provide good survey or review of past achievements in the field, or feature some new exciting developments by the authors, or discuss promising new directions and extensions. The new theory of sparse representation and compressive sensing not only establishes a more rigorous mathematical framework for studying high-dimensional data, but also provides computationally feasible ways to uncover the structures of the data, giving rise to a large repertoire of efficient algorithms.
UR - http://www.scopus.com/inward/record.url?scp=77952678579&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77952678579&partnerID=8YFLogxK
U2 - 10.1109/JPROC.2010.2047424
DO - 10.1109/JPROC.2010.2047424
M3 - Article
AN - SCOPUS:77952678579
VL - 98
SP - 906
EP - 909
JO - Proceedings of the IEEE
JF - Proceedings of the IEEE
SN - 0018-9219
IS - 6
M1 - 5466604
ER -