Sciweavers

Share
ICASSP
2008
IEEE

Compressed sensing - a look beyond linear programming

10 years 2 months ago
Compressed sensing - a look beyond linear programming
Recently, significant attention in compressed sensing has been focused on Basis Pursuit, exchanging the cardinality operator with the l1-norm, which leads to a linear formulation. Here, we want to look beyond using the l1-norm in two ways: investigating non-linear solutions of higher complexity, but closer to the original problem for one, and improving known low complexity solutions based on Matching Pursuit using rollout concepts. Our simulation results concur with previous findings that once x is “sparse enough”, many algorithms find the correct solution, but for averagely sparse problems we find that the l1-norm often does not converge to the correct solution – in fact being outperformed by Matching Pursuit based algorithms at lower complexity. The non-linear algorithm we suggest has increased complexity, but shows superior performance in this setting.
Christian R. Berger, Javier Areta, Krishna R. Patt
Added 30 May 2010
Updated 30 May 2010
Type Conference
Year 2008
Where ICASSP
Authors Christian R. Berger, Javier Areta, Krishna R. Pattipati, Peter Willett
Comments (0)
books