Content-aware compressive sensing recovery using Laplacian scale mixture priors and side information
Summary: Nonlocal methods have shown great potential in many image restoration tasks including compressive sensing (CS) reconstruction through use of image self-similarity prior. However, they are still limited in recovering fine-scale details and sharp features, when rich repetitive patterns cannot be guaranteed; moreover the CS measurements are corrupted. In this paper, we propose a novel CS recovery algorithm that combines nonlocal sparsity with local and global prior, which soften and complement the self-similarity assumption for irregular structures. First, a Laplacian scale mixture (LSM) prior is utilized to model dependencies among similar patches. For achieving group sparsity, each singular value of similar packed patches is modeled as a Laplacian distribution with a variable scale parameter. Second, a global prior and a compensation-based sparsity prior of local patch are designed in order to maintain differences between packed patches. The former refers to a prediction which integrates the information at the independent processing stage and is used as side information, while the latter enforces a small (i.e., sparse) prediction error and is also modeled with the LSM model so as to obtain local sparsity. Afterward, we derive an efficient algorithm based on the expectation-maximization (EM) and approximate message passing (AMP) frame for the maximum a posteriori (MAP) estimation of the sparse coefficients. Numerical experiments show that the proposed method outperforms many CS recovery algorithms.
- A compressed sensing image reconstruction algorithm based on non-local regularization
- An image reconstruction algorithm of compressed sensing based on nonlocal similarity model
- Hyper-Laplacian regularized nonlocal low-rank matrix recovery for hyperspectral image compressive sensing reconstruction
- Image compressive sensing reconstruction based on low-rank and total variation regularization
- Hessian Schatten-norm and adaptive dictionary for image recovery
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Boosting of image denoising algorithms
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Compressed sensing
- Compressing sensing based source localization for controlled acoustic signals using distributed microphone arrays
- Compressive Imaging Using Approximate Message Passing and a Markov-Tree Prior
- Compressive Imaging via Approximate Message Passing With Image Denoising
- Compressive Sensing via Nonlocal Low-Rank Regularization
- DLM: Decentralized Linearized Alternating Direction Method of Multipliers
- Expectation-Maximization Gaussian-Mixture Approximate Message Passing
- From Denoising to Compressed Sensing
- High-Accuracy Total Variation With Application to Compressed Video Sensing
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- Multivariate Compressive Sensing for Image Reconstruction in the Wavelet Domain: Using Scale Mixture Models
- Nonlinear total variation based noise removal algorithms
- Nonlocal Image Restoration With Bilateral Variance Estimation: A Low-Rank Approach
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
This page was built for publication: Content-aware compressive sensing recovery using Laplacian scale mixture priors and side information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1721345)
