Papers › Total Variation Regularisation with Spatially Variable Lipschitz Constraints
Total Variation Regularisation with Spatially Variable Lipschitz Constraints
Martin Burger, Yury Korolev, Simone Parisotto, Carola-Bibiane Schönlieb
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.
We introduce a first order Total Variation type regulariser that decomposes a function into a part with a given Lipschitz constant (which is also allowed to vary spatially) and a jump part. The kernel of this regulariser contains all functions whose Lipschitz constant does not exceed a given value, hence by locally adjusting this value one can determine how much variation is the reconstruction allowed to have. We prove regularising properties of this functional, study its connections to other Total Variation type regularisers and propose a primal dual optimisation scheme. Our numerical experiments demonstrate that the proposed first order regulariser can achieve reconstruction quality similar to that of second order regularisers such as Total Generalised Variation, while requiring significantly less computational time.
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