Searcharxiv⌕ Search

arXiv subjects

Otmar Scherzer

Publications and source records attributed to Otmar Scherzer.

102 records · Page 6Linked to original sources
arXiv2012

A convergence analysis of a multi-level projected steepest descent iteration for nonlinear inverse problems in Banach spaces subject to stability constraints

We consider nonlinear inverse problems described by operator equations in Banach spaces. Assuming conditional stability of the inverse problem, that is, assuming that stability holds on a closed, convex subset of the domain of the operator, we introduce a novel nonlinear projected steepest descent iteration and analyze its convergence to an approximate solution given limited accuracy data. We proceed with developing a multi-level algorithm based on a nested family of closed, convex subsets on which stability holds and the stability constants are ordered. Growth of the stability constants is coupled to the increase in accuracy of approximation between neighboring levels to ensure that the algorithm can continue from level to level until the iterate satisfies a desired discrepancy criterion, after a finite number of steps.

math.NA↗
arXiv2012

Local Analysis of Inverse Problems: Hölder Stability and Iterative Reconstruction

We consider a class of inverse problems defined by a nonlinear map from parameter or model functions to the data. We assume that solutions exist. The space of model functions is a Banach space which is smooth and uniformly convex; however, the data space can be an arbitrary Banach space. We study sequences of parameter functions generated by a nonlinear Landweber iteration and conditions under which these strongly converge, locally, to the solutions within an appropriate distance. We express the conditions for convergence in terms of Hölder stability of the inverse maps, which ties naturally to the analysis of inverse problems.

math.FA↗
arXiv2011

Reconstruction Formulas for Photoacoustic Sectional Imaging

The literature on reconstruction formulas for photoacoustic tomography (PAT) is vast. The various reconstruction formulas differ by used measurement devices and geometry on which the data are sampled. In standard photoacoustic imaging (PAI), the object under investigation is illuminated uniformly. Recently, sectional photoacoustic imaging techniques, using focusing techniques for initializing and measuring the pressure along a plane, appeared in the literature. This paper surveys existing and provides novel exact reconstruction formulas for sectional photoacoustic imaging.

math.AP↗
arXiv2011

The Residual Method for Regularizing Ill-Posed Problems

Although the \emph{residual method}, or \emph{constrained regularization}, is frequently used in applications, a detailed study of its properties is still missing. This sharply contrasts the progress of the theory of Tikhonov regularization, where a series of new results for regularization in Banach spaces has been published in the recent years. The present paper intends to bridge the gap between the existing theories as far as possible. We develop a stability and convergence theory for the residual method in general topological spaces. In addition, we prove convergence rates in terms of (generalized) Bregman distances, which can also be applied to non-convex regularization functionals. We provide three examples that show the applicability of our theory. The first example is the regularized solution of linear operator equations on $L^p$-spaces, where we show that the results of Tikhonov regularization generalize unchanged to the residual method. As a second example, we consider the problem of density estimation from a finite number of sampling points, using the Wasserstein distance as a fidelity term and an entropy measure as regularization term. It is shown that the densities obtained in this way depend continuously on the location of the sampled points and that the underlying density can be recovered as the number of sampling points tends to infinity. Finally, we apply our theory to compressed sensing. Here, we show the well-posedness of the method and derive convergence rates both for convex and non-convex regularization under rather weak conditions.

math.OC↗
arXiv2011

Convergence of Variational Regularization Methods for Imaging on Riemannian Manifolds

We consider abstract operator equations $Fu=y$, where $F$ is a compact linear operator between Hilbert spaces $U$ and $V$, which are function spaces on \emph{closed, finite dimensional Riemannian manifolds}, respectively. This setting is of interest in numerous applications such as Computer Vision and non-destructive evaluation. In this work, we study the approximation of the solution of the ill-posed operator equation with Tikhonov type regularization methods. We prove well-posedness, stability, convergence, and convergence rates of the regularization methods. Moreover, we study in detail the numerical analysis and the numerical implementation. Finally, we provide for three different inverse problems numerical experiments.

math.NA↗
arXiv2010

Photoacoustic Imaging Taking into Account Attenuation

First, we review existing attenuation models and discuss their causality properties, which we believe to be essential for algorithms for inversion with attenuated data. Then, we survey causality properties of common attenuation models. We also derive integro-differential equations which the attenuated waves are satisfying. In addition we discuss the ill--conditionness of the inverse problem for calculating the unattenuated wave from the attenuated one.

math.AP↗
arXiv2009

A Derivative-Free Approach to Total Variation Regularization

The goal of this paper is to present a novel approach for total variation regularization and Sobolev minimization, which are prominent tools for variational imaging. Thereby we use derivative free characterizations of the total variation semi-norm and Sobolev semi-norms of functions recently derived by Bourgain, Brézis, Mironescu and Dávila. Their analysis is to approximate the semi-norms of a function by singular integral operators. With this characterization we derive a series of novel regularization methods for total variation minimization which have as a novel feature a non-local double integral regularization term.

math.OC↗
arXiv2008

Sparse Regularization with $l^q$ Penalty Term

We consider the stable approximation of sparse solutions to non-linear operator equations by means of Tikhonov regularization with a subquadratic penalty term. Imposing certain assumptions, which for a linear operator are equivalent to the standard range condition, we derive the usual convergence rate $O(\sqrtδ)$ of the regularized solutions in dependence of the noise level $δ$. Particular emphasis lies on the case, where the true solution is known to have a sparse representation in a given basis. In this case, if the differential of the operator satisfies a certain injectivity condition, we can show that the actual convergence rate improves up to $O(δ)$.

math.FA↗
arXiv2005

Robust Reconstruction from Chopped and Nodded Images

In ground based infrared imaging a well-known technique to reduce the influence of thermal and background noise is chopping and nodding, where four different signals of the same object are recorded from which the object is reconstructed numerically. Since noise in the data can severely affect the reconstruction, regularization algorithms have to be implemented. In this paper we propose to combine iterative reconstruction algorithms with robust statistical methods. Moreover, we study the use of multiple chopped data sets with different chopping amplitudes and the according numerical reconstruction algorithm. Numerical simulations show robustness of the proposed methods with respect to noisy data.

astro-ph↗
arXiv2003

Automatic detection of arcs and arclets formed by gravitational lensing

We present an algorithm developed particularly to detect gravitationally lensed arcs in clusters of galaxies. This algorithm is suited for automated surveys as well as individual arc detections. New methods are used for image smoothing and source detection. The smoothing is performed by so-called anisotropic diffusion, which maintains the shape of the arcs and does not disperse them. The algorithm is much more efficient in detecting arcs than other source finding algorithms and the detection by eye.

astro-ph↗
arXiv1999

A multi-level algorithm for the solution of moment problems

We study numerical methods for the solution of general linear moment problems, where the solution belongs to a family of nested subspaces of a Hilbert space. Multi-level algorithms, based on the conjugate gradient method and the Landweber--Richardson method are proposed that determine the "optimal" reconstruction level a posteriori from quantities that arise during the numerical calculations. As an important example we discuss the reconstruction of band-limited signals from irregularly spaced noisy samples, when the actual bandwidth of the signal is not available. Numerical examples show the usefulness of the proposed algorithms.

math.NA↗