Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,273,821 papers from all fields of science
Search
Sign In
Create Free Account
Sparse approximation
Known as:
Sparse optimization
, Sparse representation
A sparse approximation is a sparse vector that approximately solves a system of equations. Techniques for finding sparse approximations have found…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
24 relations
Ali Akansu
Basis pursuit
Basis pursuit denoising
Combinatorial optimization
Expand
Broader (1)
Numerical linear algebra
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
A Survey of Sparse Representation: Algorithms and Applications
Zheng Zhang
,
Yong Xu
,
Jian Yang
,
Xuelong Li
,
D. Zhang
IEEE Access
2015
Corpus ID: 206485791
Sparse representation has attracted much attention from researchers in fields of signal processing, image processing, computer…
Expand
Review
2010
Review
2010
Computational Methods for Sparse Solution of Linear Inverse Problems
J. Tropp
,
Stephen J. Wright
Proceedings of the IEEE
2010
Corpus ID: 262956423
The goal of the sparse approximation problem is to approximate a target signal using a linear combination of a few elementary…
Expand
Highly Cited
2007
Highly Cited
2007
An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
D. Wipf
,
B. Rao
IEEE Transactions on Signal Processing
2007
Corpus ID: 18426213
Given a large overcomplete dictionary of basis vectors, the goal is to simultaneously represent L>1 signal vectors using…
Expand
Highly Cited
2006
Highly Cited
2006
Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit
J. Tropp
,
A. Gilbert
,
M. Strauss
Signal Processing
2006
Corpus ID: 244867
Highly Cited
2006
Highly Cited
2006
ALGORITHMS FOR SIMULTANEOUS SPARSE APPROXIMATION
J. Tropp
2006
Corpus ID: 123798119
Highly Cited
2006
Highly Cited
2006
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
M. Aharon
,
Michael Elad
,
A. Bruckstein
IEEE Transactions on Signal Processing
2006
Corpus ID: 7477309
In recent years there has been a growing interest in the study of sparse representation of signals. Using an overcomplete…
Expand
Highly Cited
2006
Highly Cited
2006
Algorithms for simultaneous sparse approximation. Part II: Convex relaxation
J. Tropp
Signal Processing
2006
Corpus ID: 2478002
Highly Cited
2005
Highly Cited
2005
Simultaneous sparse approximation via greedy pursuit
J. Tropp
,
A. Gilbert
,
M. Strauss
Proceedings. (ICASSP '05). IEEE International…
2005
Corpus ID: 18462387
A simple sparse approximation problem requests an approximation of a given input signal as a linear combination of T elementary…
Expand
Highly Cited
2004
Highly Cited
2004
Greed is good: algorithmic results for sparse approximation
J. Tropp
IEEE Transactions on Information Theory
2004
Corpus ID: 675692
This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse…
Expand
Highly Cited
2002
Highly Cited
2002
Weighted least squares support vector machines: robustness and sparse approximation
J. Suykens
,
J. Brabanter
,
Lukas Lukas
,
J. Vandewalle
Neurocomputing
2002
Corpus ID: 17054045
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE