Analysis of Regularized LS Reconstruction and Random Matrix Ensembles in Compressed Sensing

DOI10.1109/TIT.2016.2525824MaRDI QIDQ2976934zbMATH OpenOpenAlexFDO

Authors Mikko Vehkaperä, Yoshiyuki Kabashima, Saikat Chatterjee

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1312.0256

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Performance of regularized least-squares estimation in noisy compressed sensing is analyzed in the limit when the dimensions of the measurement matrix grow large. The sensing matrix is considered to be from a class of random ensembles that encloses as special cases standard Gaussian, row-orthogonal, geometric and so-called T-orthogonal constructions. Source vectors that have non-uniform sparsity are included in the system model. Regularization based on l1-norm and leading to LASSO estimation, or basis pursuit denoising, is given the main emphasis in the analysis. Extensions to l2-norm and "zero-norm" regularization are also briefly discussed. The analysis is carried out using the replica method in conjunction with some novel matrix integration results. Numerical experiments for LASSO are provided to verify the accuracy of the analytical results. The numerical experiments show that for noisy compressed sensing, the standard Gaussian ensemble is a suboptimal choice for the measurement matrix. Orthogonal constructions provide a superior performance in all considered scenarios and are easier to implement in practical applications. It is also discovered that for non-uniform sparsity patterns the T-orthogonal matrices can further improve the mean square error behavior of the reconstruction when the noise level is not too high. However, as the additive noise becomes more prominent in the system, the simple row-orthogonal measurement matrix appears to be the best choice out of the considered ensembles.

Recommendations

• Compressive sensing and structured random matrices
• Compressed sensing of low-rank plus sparse matrices
• An l₁-l_p DC regularization method for compressed sensing
• Analysis and algorithms for some compressed sensing models based on L1/L2 minimization
• Compressed Sensing and Affine Rank Minimization Under Restricted Isometry
• scientific article; zbMATH DE number 6765489
• Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing

Cited in

(6)

• Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing
• Analysis of sparse recovery algorithms via the replica method
• A novel sub-Nyquist FRI sampling and reconstruction method in linear canonical transform domain
• A statistical mechanics approach to de-biasing and uncertainty estimation in Lasso for random measurements
• scientific article; zbMATH DE number 6999917 (Why is no real title available?)
• Replica analysis of overfitting in generalized linear regression models

This page was built for publication: Analysis of Regularized LS Reconstruction and Random Matrix Ensembles in Compressed Sensing

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