Papers › Error Estimates for Data-driven Weakly Convex Frame-based Image Regularization
Error Estimates for Data-driven Weakly Convex Frame-based Image Regularization
Andrea Ebner, Matthias Schwab, Markus Haltmeier
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Inverse problems are fundamental in fields like medical imaging, geophysics, and computerized tomography, aiming to recover unknown quantities from observed data. However, these problems often lack stability due to noise and ill-conditioning, leading to inaccurate reconstructions. To mitigate these issues, regularization methods are employed, introducing constraints to stabilize the inversion process and achieve a meaningful solution. Recent research has shown that the application of regularizing filters to diagonal frame decompositions (DFD) yields regularization methods. These filters dampen some frame coefficients to prevent noise amplification. This paper introduces a non-linear filtered DFD method combined with a learning strategy for determining optimal non-linear filters from training data pairs. In our experiments, we applied this approach to the inversion of the Radon transform using 500 image-sinogram pairs from real CT scans. Although the learned filters were found to be strictly increasing, they did not satisfy the non-expansiveness condition required to link them with convex regularizers and prove stability and convergence in the sense of regularization methods in previous works. Inspired by this, the paper relaxes the non-expansiveness condition, resulting in weakly convex regularization. Despite this relaxation, we managed to derive stability, convergence, and convergence rates with respect to the absolute symmetric Bregman distance for the learned non-linear regularizing filters. Extensive numerical results demonstrate the effectiveness of the proposed method in achieving stable and accurate reconstructions.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections