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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1984-2018
020040060019842018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Restoring a clear image from a single motion-blurred image due to camera shake has long been a challenging problem in digital… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In order to find sparse approximations of signals, an appropriate generative model for the signal class has to be known. If the… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
2008
Highly Cited
2008
This paper addresses the problem of generating a super-resolution (SR) image from a single low-resolution input image. We… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A simultaneous sparse approximation problem requests a good approximation of several input signals at once using different linear… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A simultaneous sparse approximation problem requests a good approximation of several input signals at once using different linear… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Overcomplete representations are attracting interest in signal processing theory, particularly due to their potential to generate… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A simple sparse approximation problem requests an approximation of a given input signal as a linear combination of T elementary… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse… (More)
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Subset selection and sparse approximation problems request a good approximation of an input signal using a linear combination of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
This article shows a relationship between two different approximation techniques: the support vector machines (SVM), proposed by… (More)
  • figure 1
Is this relevant?