A Compound Gaussian Least Squares Algorithm and Unrolled Network for Linear Inverse Problems
arXiv:2305.11120 · doi:10.1109/TSP.2023.3330267
Abstract
For solving linear inverse problems, particularly of the type that appears in tomographic imaging and compressive sensing, this paper develops two new approaches. The first approach is an iterative algorithm that minimizes a regularized least squares objective function where the regularization is based on a compound Gaussian prior distribution. The compound Gaussian prior subsumes many of the commonly used priors in image reconstruction, including those of sparsity-based approaches. The developed iterative algorithm gives rise to the paper's second new approach, which is a deep neural network that corresponds to an "unrolling" or "unfolding" of the iterative algorithm. Unrolled deep neural networks have interpretable layers and outperform standard deep learning methods. This paper includes a detailed computational theory that provides insight into the construction and performance of both algorithms. The conclusion is that both algorithms outperform other state-of-the-art approaches to tomographic image formation and compressive sensing, especially in the difficult regime of low training.
Paper and supplementary material published in IEEE TSP. 16 pages, 9 figures, 6 tables; references updated
References in corpus (7)
- Deep Convolutional Neural Network for Inverse Problems in Imaging
- Learned Primal-dual Reconstruction
- FISTA-Net: Learning A Fast Iterative Shrinkage Thresholding Network for Inverse Problems in Imaging
- Learning Proximal Operators: Using Denoising Networks for Regularizing Inverse Imaging Problems
- Unrolled Optimization with Deep Priors
- Memory-Augmented Deep Unfolding Network for Compressive Sensing
- Stochastic asymptotical regularization for linear inverse problems