Title :
Sparse reconstruction for compressed sensing using Stagewise Polytope Faces Pursuit
Author :
Plumbley, Mark D. ; Bevilacqua, Marco
Author_Institution :
Sch. of Elec. Eng. & Comp. Sci., Queen Mary Univ. of London, London, UK
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.
Keywords :
iterative methods; linear programming; signal reconstruction; signal representation; signal sampling; compressed sensing sparse reconstruction; compressive sampling; linear programming; signal measurement; signal reconstruction; stagewise orthogonal matching pursuit algorithm; stagewise polytope faces pursuit; Compressed sensing; Geometry; Greedy algorithms; Linear programming; Matching pursuit algorithms; Pursuit algorithms; Sampling methods; Signal reconstruction; Telecommunications; Vectors; Basis Pursuit (BP); Compressed Sensing; Sparse reconstruction; greedy algorithms; polytopes;
Conference_Titel :
Digital Signal Processing, 2009 16th International Conference on
Conference_Location :
Santorini-Hellas
Print_ISBN :
978-1-4244-3297-4
Electronic_ISBN :
978-1-4244-3298-1
DOI :
10.1109/ICDSP.2009.5201170