Graph explorer

Nonlinear Basis Pursuit

In compressive sensing, the basis pursuit algorithm aims to find the sparsest solution to an underdetermined linear equation system. In this paper, we generalize basis pursuit to finding the sparsest solution to higher order nonlinear systems of equations, called nonlinear basis pursuit. In contrast to the existing nonlinear compressive sensing methods, the new algorithm that solves the nonlinear basis pursuit problem is convex and not greedy. The novel algorithm enables the compressive sensing approach to be used for a broader range of applications where there are nonlinear relationships between the measurements and the unknowns.

9 nodes9 linksoverview mapNonlinear Basis Pursuit
9 nodes9 links
Nonlinear Basis Pursuit9 visible / 9 total nodes / 15 links
Related contextCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipAuthorshipTopic signalTopic signalTopic signalTopic signalWNonlinear Basis Pursuitpreprint / 2013AHenrik OhlssonResearcherAAllen Y. YangResearcherARoy DongResearcherAS. Shankar SastryResearcherTInformation Theory6710 worksTmath.IT6610 worksTmath.ST3384 worksTStatistics Theory3281 works
PaperSignal 108 links

Nonlinear Basis Pursuit

preprint / 2013

Open