Compressed Sensing with Prior Information: Optimal Strategies, Geometry, and Bounds

Author name not available (Why is that?)

Publication date: 22 August 2014

Abstract: We address the problem of compressed sensing (CS) with prior information: reconstruct a target CS signal with the aid of a similar signal that is known beforehand, our prior information. We integrate the additional knowledge of the similar signal into CS via L1-L1 and L1-L2 minimization. We then establish bounds on the number of measurements required by these problems to successfully reconstruct the original signal. Our bounds and geometrical interpretations reveal that if the prior information has good enough quality, L1-L1 minimization improves the performance of CS dramatically. In contrast, L1-L2 minimization has a performance very similar to classical CS and brings no significant benefits. All our findings are illustrated with experimental results.

Has companion code repository: https://github.com/joaofcmota/cs-with-prior-information

This page was built for publication: Compressed Sensing with Prior Information: Optimal Strategies, Geometry, and Bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6254109)