Learning-based Image Reconstruction via Parallel Proximal Algorithm

Abstract

In the past decade, sparsity-driven regularization has led to advancement of image reconstruction algorithms. Traditionally, such regularizers rely on analytical models of sparsity (e.g. total variation (TV)). However, more recent methods are increasingly centered around data-driven arguments inspired by deep learning. In this letter, we propose to generalize TV regularization by replacing the l1-penalty with an alternative prior that is trainable. Specifically, our method learns the prior via extending the recently proposed fast parallel proximal algorithm (FPPA) to incorporate data-adaptive proximal operators. The proposed framework does not require additional inner iterations for evaluating the proximal mappings of the corresponding learned prior. Moreover, our formalism ensures that the training and reconstruction processes share the same algorithmic structure, making the end-to-end implementation intuitive. As an example, we demonstrate our algorithm on the problem of deconvolution in a fluorescence microscope.

References in corpus (2)

• A Review of Convolutional Neural Networks for Inverse Problems in Imaging
• Deep Sparse Coding Using Optimized Linear Expansion of Thresholds

Cited by in corpus (6)

• RARE: Image Reconstruction using Deep Priors Learned without Ground Truth
• Dense Recurrent Neural Networks for Accelerated MRI: History-Cognizant Unrolling of Optimization Algorithms
• Unsupervised Deep Learning Methods for Biological Image Reconstruction and Enhancement
• SGD-Net: Efficient Model-Based Deep Learning with Theoretical Guarantees
• Learning Illumination Patterns for Coded Diffraction Phase Retrieval
• Physics-based Learned Design: Optimized Coded-Illumination for Quantitative Phase Imaging