On the ROF Model in Rectilinear Anisotropy: Piecewise Constant Approximation and Universal Minimality
Abstract
We prove that the L2 distance between the minimizer of the 1-anisotropic Rudin-Osher-Fatemi (ROF) functional and its minimizer over the space of piecewise constant functions on a rectilinear grid is O(h12 - q'2q), where h is the grid's mesh size and the datum belongs to Lq, q 2. These convergence rates are valid in any dimension d 1. However, in dimension d = 1 they can be further improved to O(h12 - 12q). To establish the error bounds, Lq estimates of the ROF minimizer in terms of the datum are critical. Such estimates are particular cases of a universal minimality property of the ROF minimizer derived in the second part of the paper. There it is shown, in both the finite-dimensional and infinite-dimensional settings, that the minimizer simultaneously minimizes a broad class of convex functionals over a neighbourhood of the datum arising in the convex dual of the ROF problem. This extends previous results of similar type about taut strings and the ROF problem.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.