D-MOD, a fast algorithm that instead provides a posterior mode for MRI reconstruction, uses a minorize-maximize algorithm on a lower bound of the smoothed log-posterior, which provably increases the objective.
Abstract
Diffusion models are powerful priors for accelerated MRI reconstruction, but most current methods are posterior samplers, which return a random draw from the posterior. A reproducible and high-quality reconstruction often requires averaging many samples, resulting in a high computational cost. We introduce D-MOD, a fast algorithm that instead provides a posterior mode. It uses a minorize-maximize algorithm on a lower bound of the smoothed log-posterior, which provably increases the objective. Each iteration draws S noisy samples of the current estimate at the current noise level, denoises them with a pretrained diffusion model, and combines their average with the measured k-space through a conjugate-gradient (CG) solve. We anneal the noise levels, as the distance between the bound and its target decays quadratically with noise. On fastMRI brain (T1, T2, FLAIR), a single D-MOD reconstruction exceeds, in PSNR, the 10-sample finite-MMSE estimates of DPS, DAPS and SNORE-P and stays within 0.31 dB of the strongest baselines (DiffPIR, DDS). This approach thus provides a fast deterministic reconstruction algorithm (11-73 times faster than MMSE estimates), which is useful in a clinical setting.
Diffusion models are powerful priors for inverse problems, including accelerated MRI. However, modeling the distribution of high-resolution images requires large networks with high computational cost. We propose a posterior sampling framework that uses cascaded diffusion models as multiscale priors. Conditioned on a co...
Jyothi Rikabh Chand, Sahil Murtaza, Patrick Nicholas Nowak et al.· 0 citations
This paper introduces a posterior sampling algorithm customized for the pyramidal/cascaded architecture, which relies on a coarse to fine hierarchical strategy to generate images in the pixel domain and presents CLIMB-Flow which alternates between three steps: an end-point estimation from the current coarse and noisy i...
Diffusion posterior samplers reconstruct signals by combining a pretrained diffusion prior with a measurement likelihood specified by a forward model and a noise model. Calibration and reference data can characterize uncertainty in the forward model's parameters, such as blur kernels or detector responses. Fixing these...
SNaP is introduced, a one-step MeanFlow posterior sampler for linear inverse problems with Gaussian noise, which produces diverse, high-quality samples with one network evaluation per draw, 30 to 2250 $\times$ faster than iterative samplers.
Shirin Shoushtari, Edward P. Chandler, Xiao Shi et al.· arXiv.org· 0 citations
Red-KLwSGS is proposed, which keeps the exact Gaussian update for the data variable and updates the auxiliary variable with underdamped (kinetic) Langevin diffusions driven by a one-shot denoising score, at the same per-iteration cost as Langevin-within-SGS.
Dai Hai Nguyen, Duc Dung Nguyen· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.