Pourya Mehrsa, Neumayer Sebastian, Unser Michael
Biomedical Imaging Group, EPFL, Lausanne, Switzerland.
Professorship of Inverse Problems, TU Chemnitz, Chemnitz, Germany.
Numer Funct Anal Optim. 2024 Aug 11;45(7-9):411-440. doi: 10.1080/01630563.2024.2384849. eCollection 2024.
We propose a regularization scheme for image reconstruction that leverages the power of deep learning while hinging on classic sparsity-promoting models. Many deep-learning-based models are hard to interpret and cumbersome to analyze theoretically. In contrast, our scheme is interpretable because it corresponds to the minimization of a series of convex problems. For each problem in the series, a mask is generated based on the previous solution to refine the regularization strength spatially. In this way, the model becomes progressively attentive to the image structure. For the underlying update operator, we prove the existence of a fixed point. As a special case, we investigate a mask generator for which the fixed-point iterations converge to a critical point of an explicit energy functional. In our experiments, we match the performance of state-of-the-art learned variational models for the solution of inverse problems. Additionally, we offer a promising balance between interpretability, theoretical guarantees, reliability, and performance.
我们提出了一种用于图像重建的正则化方案,该方案利用深度学习的力量,同时依赖于经典的稀疏性促进模型。许多基于深度学习的模型难以解释,并且在理论分析上很繁琐。相比之下,我们的方案是可解释的,因为它对应于一系列凸问题的最小化。对于该系列中的每个问题,基于先前的解生成一个掩码,以便在空间上细化正则化强度。通过这种方式,模型逐渐关注图像结构。对于底层的更新算子,我们证明了不动点的存在性。作为一个特殊情况,我们研究了一种掩码生成器,其不动点迭代收敛到一个显式能量泛函的临界点。在我们的实验中,我们在求解逆问题时达到了与最先进的学习变分模型相当的性能。此外,我们在可解释性、理论保证、可靠性和性能之间提供了一种有前景的平衡。