2024/07/09 by Mehrsa Pourya, Pourya, Mehrsa, Sebastian Neumayer +3 · 2 citations
Computer Science · Engineering · #Computer Vision and Pattern Recognition (cs.CV) #FOS: Computer and information sciences #FOS: Electrical engineering #Image Processing Techniques and Applications #Image and Signal Denoising Methods #Image and Video Processing (eess.IV) #Machine Learning (cs.LG) #Medical Image Segmentation Techniques #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2407.06608
openalex publication_date 2024/07/09 · openalex created_date 2024/07/12 · openalex updated_date 2026/07/30
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.