Performance Bounds For Co-/Sparse Box Constrained Signal Recovery

The recovery of structured signals from a few linear measurements is a central point in both compressed sensing (CS) and discrete tomography. In CS the signal structure is described by means of a low complexity model e.g. co-/sparsity. The CS theory shows that any signal/image can be undersampled at a rate dependent on its intrinsic complexity. Moreover, in such undersampling regimes, the signal can be recovered by sparsity promoting convex regularization like $\ell_1$- or total variation (TV-) minimization. Precise relations between many low complexity measures and the sufficient number of random measurements are known for many sparsity promoting norms. However, a precise estimate of the undersampling rate for the TV seminorm is still lacking. We address this issue by: a) providing dual certificates testing uniqueness of a given cosparse signal with bounded signal values, b) approximating the undersampling rates via the statistical dimension of the TV descent cone and c) showing empirically that the provided rates also hold for tomographic measurements.

[1]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[2]  J. S. Jørgensena,et al.  Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT , 2015 .

[3]  Rina Foygel,et al.  Corrupted Sensing: Novel Guarantees for Separating Structured Signals , 2013, IEEE Transactions on Information Theory.

[4]  Attila Kuba,et al.  Advances in Discrete Tomography and Its Applications (Applied and Numerical Harmonic Analysis) , 2007 .

[5]  Michael Elad,et al.  The Cosparse Analysis Model and Algorithms , 2011, ArXiv.

[6]  Robert J. Vanderbei,et al.  Linear Programming: Foundations and Extensions , 1998, Kluwer international series in operations research and management service.

[7]  Andrea Montanari,et al.  Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising , 2011, IEEE Transactions on Information Theory.

[8]  Jean Charles Gilbert.  On the Solution Uniqueness Characterization in the L1 Norm and Polyhedral Gauge Recovery , 2017, J. Optim. Theory Appl..

[9]  Weiyu Xu,et al.  Precise phase transition of total variation minimization , 2015, 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[10]  Pablo A. Parrilo,et al.  The Convex Geometry of Linear Inverse Problems , 2010, Foundations of Computational Mathematics.

[11]  Christoph Schnörr,et al.  Average Case Recovery Analysis of Tomographic Compressive Sensing , 2012, ArXiv.

[12]  Holger Rauhut,et al.  A Mathematical Introduction to Compressive Sensing , 2013, Applied and Numerical Harmonic Analysis.

[13]  Joel A. Tropp,et al.  Living on the edge: phase transitions in convex programs with random data , 2013, 1303.6672.

[14]  Per Christian Hansen,et al.  AIR Tools - A MATLAB package of algebraic iterative reconstruction methods , 2012, J. Comput. Appl. Math..

[15]  Ming Yan,et al.  One condition for solution uniqueness and robustness of both l1-synthesis and l1-analysis minimizations , 2013, Adv. Comput. Math..

[16]  Babak Hassibi,et al.  Asymptotically Exact Denoising in Relation to Compressed Sensing , 2013, ArXiv.

[17]  Bastian Goldlücke,et al.  Variational Analysis , 2014, Computer Vision, A Reference Guide.

[18]  Stéphane Roux,et al.  Efficient Binary Tomographic Reconstruction , 2013, Journal of Mathematical Imaging and Vision.