Best Basis Compressed Sensing

Abstract : This paper proposes a best basis extension of compressed sensing recovery. Instead of regularizing the compressed sensing inverse problem with a sparsity prior in a fixed basis, our framework makes use of sparsity in a tree-structured dictionary of orthogonal bases. A new iterative thresholding algorithm performs both the recovery of the signal and the estimation of the best basis. The resulting reconstruction from compressive measurements optimizes the basis to the structure of the sensed signal. Adaptivity is crucial to capture the regularity of complex natural signals. Numerical experiments on sounds and geometrical images indeed show that this best basis search improves the recovery with respect to fixed sparsity priors.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00365017
Contributor : Gabriel Peyré <>
Submitted on : Sunday, January 10, 2010 - 12:18:03 AM
Last modification on : Thursday, January 11, 2018 - 6:12:20 AM
Document(s) archivé(s) le : Wednesday, November 30, 2016 - 10:30:50 AM

File

PeyreBestBasisCS.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Gabriel Peyré. Best Basis Compressed Sensing. IEEE Transactions on Signal Processing, Institute of Electrical and Electronics Engineers, 2010, 58 (5), pp.2613-2622. ⟨10.1109/TSP.2010.2042490⟩. ⟨hal-00365017v3⟩

Share

Metrics

Record views

2688

Files downloads

3250