arXiv:2603. 04438v3 Announce Type: replace-cross Abstract: Fully unsupervised deep generative modeling (FU-DGM) offers significant potential for compressively sampled magnetic resonance imaging (CS-MRI) reconstruction.
By Qingyong Zhu, Yumin Tan, Xiang Gu, Dong Liang
arXiv:2508. 05321v4 Announce Type: replace-cross Abstract: Assume you encounter an inverse problem that shall be solved for a large number of data, but no ground-truth data is available.
By Laura Hellwege, Johann Christopher Engster, Moritz Schaar, Thorsten M. Buzug, Maik Stille
arXiv:2606. 16212v1 Announce Type: cross Abstract: Sparse-view CT reduces radiation dose and scanning time by acquiring fewer projection views, but angular undersampling makes reconstruction severely ill-posed, causing streak artifacts, structural blurring, and loss of fine details.
By Jigang Duan, Jiayi Wang, Heran Wang, Ping Yang, Genwei Ma, Xing Zhao
The paper introduces tunable latent priors for diffusion models, normalizing flows, and variational autoencoders using nested dropout. These priors allow the latent dimensionality to adapt to each inverse problem, reducing reconstruction errors compared to fixed-complexity models across tasks such as compressed sensing, inpainting, denoising, and phase retrieval. In linear denoising, the authors derive the optimal latent complexity in closed form, linking it to noise level and signal spectrum.
By Sean Gunn, Jorio Cocola, Oliver De Candido, Vaggos Chatziafratis, Paul Hand
FlowMoDL is an unrolled neural network designed for highly accelerated 4D flow MRI reconstruction, optimizing both anatomical magnitude and phase-derived velocity accuracy. It alternates a learned (3+1)D spatiotemporal denoiser with conjugate‑gradient data‑consistency updates, using a dual‑pathway conditioning scheme to handle acceleration factors from 10× to 50×. Trained with a deep‑supervision composite loss that penalizes velocity magnitude and angular errors, FlowMoDL outperforms classical and deep‑learning baselines on the multi‑center CMRx4DFlow dataset, achieving superior gradient‑step efficiency and robust convergence across all acceleration factors.
By Tristan Gottwald, Michelle Bruch, Mubashir-Ul Hassan, Fatma Alickovic, Milan Kloiber, Daniel Tenbrinck, Torsten Panholzer, Melanie Schaller, Jana Hutter
The paper investigates compressed sensing using a family of tunable linear generative priors linked through their singular value decompositions. It proves that in noiseless Gaussian compressed sensing, the full-dimensional linear prior yields the lowest expected reconstruction error across the entire family, meaning lower-complexity priors do not improve performance in this idealized setting. This contrasts with denoising, where lower complexity priors can reduce error due to bias‑variance tradeoffs, suggesting that the experimental gains seen with neural network priors stem from their nonlinearities.
By Zhaoming Li, Paul Hand