Basis pursuit

Basis pursuit is the mathematical optimization problem of the form: where x is a N × 1 solution vector (signal), y is a M × 1 vector of observations… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1993-2017
020406019932017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
We propose a distributed algorithm for solving the optimization problem Basis Pursuit (BP). BP finds the least ℓ1-norm solution… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We consider the problem of decomposing a signal into a linear combination of features, each a continuously translated version of… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise… (More)
  • figure 2.1
  • figure 4.1
  • table 6.1
  • table 6.2
  • table 6.3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
This paper demonstrates theoretically and empirically that a greedy algorithm called orthogonal matching pursuit (OMP) can… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This article demonstrates theoretically and empirically that a greedy algorithm called Orthogonal Matching Pursuit (OMP) can… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Sparse Bayesian learning (SBL) and specifically relevance vector machines have received much attention in the machine learning… (More)
  • figure 1
  • figure 2
  • table I
  • table II
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We describe Likelihood Basis Pursuit, a nonparametric method for variable selection and model building, based on merging ideas… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The time-frequency and time-scale communities have recently developed a large number of overcomplete waveform dictionaries… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
  • SCOTT SHAOBING CHENy
  • 1995
The Time-Frequency and TimeScale communities have recently developed a large number of overcompletewaveform dictionaries… (More)
  • figure 5.1
Is this relevant?