Smoothed-TV Regularization for H\"older Continuous Functions

From MaRDI portal
Publication:6264394




Abstract: This work aims to explore the regularity properties of the smoothed-TV regularization for the functions is of the class H"older continuous. Over some compact and convex domain Omega, we study construction of multivariate function varphi(mathbfx):OmegasubsetmathbbR3ightarrowmathbbR+ as the optimized solution to the following convex minimization problem �egin{equation} min_{Omega} left{F_{alpha}(cdot, f^{delta}) := frac{1}{2} Vert mathcal{T}(cdot) - f^{delta} Vert_{mathcal{H}}^2 + alpha J(cdot) ight}, end{equation} where the penalizer J(cdot):mathcalC1(Omega,mathbbR3)ightarrowmathbbR+ is the smoothed total variation penalizer �egin{equation} J(cdot) = int_{Omega} sqrt{Vert abla(cdot)Vert_2^2 + �eta} d mathbf{x}, end{equation} for a fixed We assume our target function to be H"older continuous. With this assumption, we establish relation between total variation of our target function and its H"older coefficient. We prove that the smoothed-TV regularization is an admissible regularization strategy by evaluating the discrepancy VertmathcalTvarphialpha−fdeltaVertleqaudelta, for some fixed augeq1. To do so, we need to assume that the target function to be class of mathcalC1+(Omega). From here, under the fact that the penalty J(cdot) is strongly convex, we move on to showing the convergence of Vertvarphialpha−varphidaggerVert, for varphialpha is the optimum and varphidagger is the true solution for the given minimization problem above. We demonstrate that strong convexity and 2−convexity are actually different names for the same concept. In addition to these facts, we make us of Bregman divergence in order to be able to quantify the rate of convergence.














This page was built for publication: Smoothed-TV Regularization for H\"older Continuous Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6264394)