DocumentCode :
1495677
Title :
Applications of Sparse Representation and Compressive Sensing [Scanning the Issue]
Author :
Baraniuk, R.G. ; Candes, E. ; Elad, Michael ; Yi Ma
Volume :
98
Issue :
6
fYear :
2010
fDate :
6/1/2010 12:00:00 AM
Firstpage :
906
Lastpage :
909
Abstract :
Sparse representation and compressive sensing establishes a more rigorous mathematical framework for studying high-dimensional data and ways to uncover the structures of the data, giving rise to a large repertoire of efficient algorithms. A sparse signal is a signal that can be represented as a linear combination of relatively few base elements in a basis or an overcomplete dictionary. A sufficiently sparse linear representation can be correctly and efficiently computed by greedy methods and convex optimization (i.e., the l1-l0 equivalence), even though this problem is extremely difficult-NP-hard in the general case.
Keywords :
computational complexity; signal processing; sparse matrices; NP-hard; compressive sensing; convex optimization; greedy methods; high-dimensional data; linear combination; overcomplete dictionary; sparse representation; Computer vision; Electrical engineering; Image coding; Optimization methods; Signal processing; Signal processing algorithms; Signal sampling;
fLanguage :
English
Journal_Title :
Proceedings of the IEEE
Publisher :
ieee
ISSN :
0018-9219
Type :
jour
DOI :
10.1109/JPROC.2010.2047424
Filename :
5466604
Link To Document :
بازگشت