Applications of Sparse Representation and Compressive Sensing
Lists
Only you see this
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 l <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> -l <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sup> equivalence), even though this problem is extremely difficult-NP-hard in the general case.
BibTeX
@inproceedings{baraniuk2010applications,
author = {Richard G. Baraniuk and Emmanuel J. Candès and Michael Elad and Yi Ma},
title = {{Applications of Sparse Representation and Compressive Sensing}},
booktitle = {Proc. IEEE},
year = {2010},
url = {https://openreview.net/forum?id=wF2qmZgPSPk},
}Loading related content...