Plumbley, Mark D. and Bevilacqua, Marco Sparse reconstruction for compressed sensing using Stagewise Polytope Faces Pursuit. In: Proceedings of the 16th International Conference on Digital Signal Processing (DSP). IEEE, pp. 1-8. ISBN 978-1-4244-3298-1 (2009)
Full text not available from this repository.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.
| Item Type: | Book Section |
|---|---|
| Identification Number: | https://doi.org/10.1109/ICDSP.2009.5201170 |
| Additional Information: | 16th International Conference on Digital Signal Processing, Santorini, Greece, 5-7 July 2009 |
| Projects: | EPSRC Leadership Fellowship EP/G007144/1 , EU FET-Open project FP7-ICT-225913 “SMALL" |
| Uncontrolled Keywords: | Basis Pursuit (BP); Compressed Sensing; Sparse reconstruction; greedy algorithms; polytopes |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Research Area: | Computer Science and Applications |
| Depositing User: | Ms T. Iannizzi |
| Date Deposited: | 11 Dec 2014 09:38 |
| Last Modified: | 16 Dec 2014 14:35 |
| URI: | http://eprints.imtlucca.it/id/eprint/2410 |
Actions (login required)
 |
Edit Item |
