Abstract
Markov Chain Monte Carlo (MCMC) algorithms are standard approaches to solve imaging inverse problems and quantify estimation uncertainties, a key requirement in absence of ground-truth data. To improve estimation quality, Plug-and- Play MCMC algorithms, such as PnP-ULA, have been recently developed to accommodate priors encoded by a denoising neural network. Designing scalable samplers for high-dimensional imaging inverse problems remains a challenge: drawing and storing high-dimensional samples can be prohibitive, especially for highresolution images. To address this issue, this work proposes a distributed sampler based on approximate data augmentation and PnP-ULA to solve very large problems. The proposed sampler uses lightweight denoising convolutional neural network, to efficiently exploit multiple GPUs on a Single Program Multiple Data architecture. Reconstruction performance and scalability are evaluated on several imaging problems. Communication and computation overheads due to the denoiser are carefully discussed. The proposed distributed approach noticeably combines three very precious qualities: it is scalable, enables uncertainty quantification, for a reconstruction performance comparable to other PnP methods.
| Original language | English |
|---|---|
| Pages (from-to) | 839-849 |
| Number of pages | 11 |
| Journal | IEEE Transactions on Computational Imaging |
| Volume | 12 |
| Early online date | 17 Apr 2026 |
| DOIs | |
| Publication status | Published - 2026 |
Keywords
- Langevin algorithm
- Markov chain Monte Carlo algorithms
- distributed computing CI-TEC Computational imaging methods and models
- plug-and-play prior
ASJC Scopus subject areas
- Signal Processing
- Computer Science Applications
- Computational Mathematics
Fingerprint
Dive into the research topics of 'A Distributed Plug-and-Play MCMC Algorithm for High-Dimensional Inverse Problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver