Sparse reconstruction for compressed sensing using stagewise polytope faces pursuit

Authors:
Mark D. Plumbley;Marco Bevilacqua
Affiliations:
Queen Mary University of London, School of Elec. Eng. and Comp. Sci., London, UK;Dip. di Elettronica e Telecomunicazioni, Università degli Studi di Firenze, Firenze, Italy
Venue:
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
Year:
2009

Citing 6
Cited 0

Atomic Decomposition by Basis Pursuit

SIAM Journal on Scientific Computing
Convex Optimization

Convex Optimization
Recovery of sparse representations by polytope faces pursuit

ICA'06 Proceedings of the 6th international conference on Independent Component Analysis and Blind Signal Separation
Greed is good: algorithmic results for sparse approximation

IEEE Transactions on Information Theory
Compressed sensing

IEEE Transactions on Information Theory
On Polar Polytopes and the Recovery of Sparse Representations

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Compressed sensing, also known as compressive sampling, is an approach to the measurement of signals which have a sparse representation, that can reduce the number of measurements that are needed to reconstruct the signal. The signal reconstruction part requires efficient methods to perform sparse reconstruction, such as those based on linear programming. In this paper we present a method for sparse reconstruction which is an extension of our earlier Polytope Faces Pursuit algorithm, based on the polytope geometry of the dual linear program. The new algorithm adds several basis vectors at each stage, in a similar way to the recent Stagewise Orthogonal Matching Pursuit (StOMP) algorithm. We demonstrate the application of the algorithm to some standard compressed sensing problems.