Compressive Imaging Using Approximate Message Passing and a Markov-Tree Prior

DOI10.1109/TSP.2012.2191780zbMath1393.94714arXiv1108.2632OpenAlexW1500149156MaRDI QIDQ4573827

Subhojit Som, Philip Schniter

Publication date: 18 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Random fields; image analysis (62M40) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Sampling theory in information and communication theory (94A20)

Related Items (8)

The Quest for Optimal Sampling: Computationally Efficient, Structure-Exploiting Measurements for Compressed Sensing ⋮ Backtracking-based iterative regularization method for image compressive sensing recovery ⋮ Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class ⋮ From compression to compressed sensing ⋮ Content-aware compressive sensing recovery using Laplacian scale mixture priors and side information ⋮ On Reconstructing Functions from Binary Measurements ⋮ Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation ⋮ Weak-Type Estimates for the Metaplectic Representation Restricted to the Shearing and Dilation Subgroup of $$SL(2,\mathbb {R})$$

This page was built for publication: Compressive Imaging Using Approximate Message Passing and a Markov-Tree Prior