The jump set under geometric regularisation. Part 1: Basic technique and first-order denoising
Tuomo Valkonen

TL;DR
This paper introduces a new technique for analyzing the jump set properties of solutions to geometric regularization problems, avoiding reliance on the co-area formula, and applies it to first-order regularizers like TV and Huber-regularized TV.
Contribution
It develops a novel Lipschitz transformation method to establish jump set containment for a broad class of regularizers, extending results beyond traditional total variation.
Findings
Proves jump set containment for TV and Huber-regularized TV.
Introduces a technique avoiding the co-area formula.
Lays groundwork for higher-order regularizer analysis in Part 2.
Abstract
Let solve the total variation denoising problem with -squared fidelity and data . Caselles et al. [Multiscale Model. Simul. 6 (2008), 879--894] have shown the containment of the jump set of in that of . Their proof unfortunately depends heavily on the co-area formula, as do many results in this area, and as such is not directly extensible to higher-order, curvature-based, and other advanced geometric regularisers, such as total generalised variation (TGV) and Euler's elastica. These have received increased attention in recent times due to their better practical regularisation properties compared to conventional total variation or wavelets. We prove analogous jump set containment properties for a general class of regularisers. We do this with novel Lipschitz transformation techniques, and do not…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
