The jump set under geometric regularisation. Part 2: Higher-order approaches
Tuomo Valkonen

TL;DR
This paper extends a technique for analyzing the jump set containment property in higher-order regularization models, including TGV, and explores conditions under which the property holds, with applications to infimal convolution TV and TGV approximation.
Contribution
It generalizes the jump set containment analysis to higher-order regularizers like TGV, identifying key conditions and modifications needed for the property to hold.
Findings
Jump set containment holds under specific conditions for higher-order regularizers.
Replacing the symmetrised gradient norm with an $L^p$ norm ($p>1$) enables the property.
The technique applies to infimal convolution TV and TGV strict approximation.
Abstract
In Part 1, we developed a new technique based on Lipschitz pushforwards for proving the jump set containment property of solutions to total variation denoising. We demonstrated that the technique also applies to Huber-regularised TV. Now, in this Part 2, we extend the technique to higher-order regularisers. We are not quite able to prove the property for total generalised variation (TGV) based on the symmetrised gradient for the second-order term. We show that the property holds under three conditions: First, the solution is locally bounded. Second, the second-order variable is of locally bounded variation, , instead of just bounded deformation, . Third, does not jump on parallel to it. The second condition can be achieved for non-symmetric TGV. Both the…
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.
Taxonomy
MethodsConvolution
