scholarly journals Total variation multiscale estimators for linear inverse problems

2020 ◽  
Vol 9 (4) ◽  
pp. 961-986 ◽  
Author(s):  
Miguel del Álamo ◽  
Axel Munk

Abstract Even though the statistical theory of linear inverse problems is a well-studied topic, certain relevant cases remain open. Among these is the estimation of functions of bounded variation ($BV$), meaning $L^1$ functions on a $d$-dimensional domain whose weak first derivatives are finite Radon measures. The estimation of $BV$ functions is relevant in many applications, since it involves minimal smoothness assumptions and gives simplified, interpretable cartoonized reconstructions. In this paper, we propose a novel technique for estimating $BV$ functions in an inverse problem setting and provide theoretical guaranties by showing that the proposed estimator is minimax optimal up to logarithms with respect to the $L^q$-risk, for any $q\in [1,\infty )$. This is to the best of our knowledge the first convergence result for $BV$ functions in inverse problems in dimension $d\geq 2$, and it extends the results of Donoho (1995, Appl. Comput. Harmon. Anal., 2, 101–126) in $d=1$. Furthermore, our analysis unravels a novel regime for large $q$ in which the minimax rate is slower than $n^{-1/(d+2\beta +2)}$, where $\beta$ is the degree of ill-posedness: our analysis shows that this slower rate arises from the low smoothness of $BV$ functions. The proposed estimator combines variational regularization techniques with the wavelet-vaguelette decomposition of operators.

Author(s):  
Kristian Bredies ◽  
Martin Holler

AbstractThe regularization properties of the total generalized variation (TGV) functional for the solution of linear inverse problems by means of Tikhonov regularization are studied. Considering the associated minimization problem for general symmetric tensor fields, the well-posedness is established in the space of symmetric tensor fields of bounded deformation, a generalization of the space of functions of bounded variation. Convergence for vanishing noise level is shown in a multiple regularization parameter framework in terms of the naturally arising notion of TGV-strict convergence. Finally, some basic properties, in particular non-equivalence for different parameters, are discussed for this notion.


2015 ◽  
Vol 08 (02) ◽  
pp. 1550036
Author(s):  
H. Zegeye ◽  
O. A. Daman

We introduce an iterative process which converges strongly to the minimum-norm fixed point of Lipschitzian pseudocontractive mapping. As a consequence, convergence result to the minimum-norm zero of monotone mappings is proved. In addition, applications to convexly constrained linear inverse problems and convex minimization problems are included. Our theorems improve and unify most of the results that have been proved for this important class of nonlinear operators.


2017 ◽  
Vol 65 (16) ◽  
pp. 4293-4308 ◽  
Author(s):  
Mark Borgerding ◽  
Philip Schniter ◽  
Sundeep Rangan

2019 ◽  
Vol 27 (3) ◽  
pp. 317-340 ◽  
Author(s):  
Max Kontak ◽  
Volker Michel

Abstract In this work, we present the so-called Regularized Weak Functional Matching Pursuit (RWFMP) algorithm, which is a weak greedy algorithm for linear ill-posed inverse problems. In comparison to the Regularized Functional Matching Pursuit (RFMP), on which it is based, the RWFMP possesses an improved theoretical analysis including the guaranteed existence of the iterates, the convergence of the algorithm for inverse problems in infinite-dimensional Hilbert spaces, and a convergence rate, which is also valid for the particular case of the RFMP. Another improvement is the cancellation of the previously required and difficult to verify semi-frame condition. Furthermore, we provide an a-priori parameter choice rule for the RWFMP, which yields a convergent regularization. Finally, we will give a numerical example, which shows that the “weak” approach is also beneficial from the computational point of view. By applying an improved search strategy in the algorithm, which is motivated by the weak approach, we can save up to 90  of computation time in comparison to the RFMP, whereas the accuracy of the solution does not change as much.


2011 ◽  
Vol 38 (2) ◽  
pp. 125-154 ◽  
Author(s):  
S. Andrieux ◽  
H.D. Bui

In this paper, we make a review of some inverse problems in elasticity, in statics and dynamics, in acoustics, thermoelasticity and viscoelasticity. Crack inverse problems have been solved in closed form, by considering a nonlinear variational equation provided by the reciprocity gap functional. This equation involves the unknown geometry of the crack and the boundary data. It results from the symmetry lost between current fields and adjoint fields which is related to their support. The nonlinear equation is solved step by step by considering linear inverse problems. The normal to the crack plane, then the crack plane and finally the geometry of the crack, defined by the support of the crack displacement discontinuity, are determined explicitly. We also consider the problem of a volumetric defect viewed as the perturbation of a material constant in elastic solids which satisfies the nonlinear Calderon?s equation. The nonlinear problem reduces to two successive ones: a source inverse problem and a Volterra integral equation of the first kind. The first problem provides information on the inclusion geometry. The second one provides the magnitude of the perturbation. The geometry of the defect in the nonlinear case is obtained in closed form and compared to the linearized Calderon?s solution. Both geometries, in linearized and nonlinear cases, are found to be the same.


Sign in / Sign up

Export Citation Format

Share Document