Best Basis Compressed Sensing

This paper proposes an extension of compressed sensing that allows to express the sparsity prior in a dictionary of bases. This enables the use of the random sampling strategy of compressed sensing together with an adaptive recovery process that adapts the basis to the structure of the sensed signal. A fast greedy scheme is used during reconstruction to estimate the best basis using an iterative refinement. Numerical experiments on sounds and geometrical images show that adaptivity is indeed crucial to capture the structures of complex natural signals.

• Type: Conference
• Year: 2007
• Where: SCALESPACE
• Authors: Gabriel Peyré
• Keywords: Compressed Sensing, Fast Greedy Scheme, Random Sampling Strategy, SCALESPACE 2007