Deep unfolding as iterative regularization for imaging inverse problems
원문 초록
Recently, deep unfolding methods that guide the design of deep neural networks (DNNs) through iterative algorithms have received increasing attention in the field of inverse problems. Unlike general end-to-end DNNs, unfolding methods have better interpretability and performance. However, to our knowledge, their accuracy and stability in solving inverse problems cannot be fully guaranteed. To bridge this gap, we modified the training procedure and proved that the unfolding method is an iterative regularization method. More precisely, we jointly learn a convex penalty function adversarially by an input-convex neural network (ICNN) to characterize the distance to a real data manifold and train a DNN unfolded from the proximal gradient descent algorithm with this learned penalty. Suppose the real data manifold intersects the inverse problem solutions with only the unique real solution. We prove that the unfolded DNN will converge to it stably. Furthermore, we demonstrate with an example of MRI reconstruction that the proposed method outperforms conventional unfolding methods and traditional regularization methods in terms of reconstruction quality, stability and convergence speed.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
MDPG: Multi-domain Diffusion Prior Guidance for MRI Reconstruction
Self-supervised feature learning for cardiac Cine MR image reconstruction
Highly Undersampled MRI Reconstruction via a Single Posterior Sampling of Diffusion Models
Convergent Complex Quasi-Newton Proximal Methods for Gradient-Driven Denoisers in Compressed Sensing MRI Reconstruction
PhaseGen: A Diffusion-Based Approach for Complex-Valued MRI Data Generation
MRI super-resolution reconstruction using efficient diffusion probabilistic model with residual shifting
토론
이 논문과 연결된 포럼 글이 아직 없습니다.