Klaus Frick
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Klaus Frick has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Axel Munk
Institute for Mathematical Stochastics University of Göttingen Goldschmidtstrasse 7 37077 Göttingen Germany
4 shared publications Philipp Marnitz
University of Göttingen
3 shared publications- Dirk A. Lorenz
Center for Industrial Mathematics Fachbereich 3 University of Bremen Postfach 33 04 40 28334 Bremen Germany
1 shared publication - Elena Resmerita
Institute of Mathematics University of Klagenfurt Austria
1 shared publication - Philipp Marnitz
Institute for Mathematical Stochastics University of Göttingen Goldschmidtstraße 7 37077 Göttingen
1 shared publication
Latest Publications
- Open Access
- 18 July 2012
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 46 (3) , 370-387
Statistical Multiresolution Estimation for Variational Imaging: With an Application in Poisson-Biophotonics
- 18 July 2012
- Published by Springer Nature in Journal of Mathematical Imaging and Vision
- Vol. 46 (3) , 370-387
Open AccessStatistical Multiresolution Estimation for Variational Imaging: With an Application in Poisson-Biophotonics
- Open Access
Statistical Multiresolution Estimation for Variational Imaging: With an Application in Poisson-Biophotonics
In this paper we present a spatially-adaptive method for image reconstruction that is based on the concept of statistical multiresolution estimation as introduced in [Frick K, Marnitz P, and Munk A. "Statistical multiresolution Dantzig estimation in imaging: Fundamental concepts and algorithmic framework". Electron. J. Stat., 6:231-268, 2012]. It constitutes a variational regularization technique that uses an supremum-type distance measure as data-fidelity combined with a convex cost functional. The resulting convex optimization problem is approached by a combination of an inexact alternating direction method of multipliers and Dykstra's projection algorithm. We describe a novel method for balancing data-fit and regularity that is fully automatic and allows for a sound statistical interpretation. The performance of our estimation approach is studied for various problems in imaging. Among others, this includes deconvolution problems that arise in Poisson nanoscale fluorescence microscopy.
Open AccessStatistical Multiresolution Estimation for Variational Imaging: With an Application in Poisson-Biophotonics
In this paper we present a spatially-adaptive method for image reconstruction that is based on the concept of statistical multiresolution estimation as introduced in [Frick K, Marnitz P, and Munk A. "Statistical multiresolution Dantzig estimation in imaging: Fundamental concepts and algorithmic framework". Electron. J. Stat., 6:231-268, 2012]. It constitutes a variational regularization technique that uses an supremum-type distance measure as data-fidelity combined with a convex cost functional. The resulting convex optimization problem is approached by a combination of an inexact alternating direction method of multipliers and Dykstra's projection algorithm. We describe a novel method for balancing data-fit and regularity that is fully automatic and allows for a sound statistical interpretation. The performance of our estimation approach is studied for various problems in imaging. Among others, this includes deconvolution problems that arise in Poisson nanoscale fluorescence microscopy.
- Open Access
Shape Constrained Regularisation by Statistical Multiresolution for Inverse Problems: Asymptotic Analysis
This paper is concerned with a novel regularisation technique for solving linear ill-posed operator equations in Hilbert spaces from data that is corrupted by white noise. We combine convex penalty functionals with extreme-value statistics of projections of the residuals on a given set of sub-spaces in the image-space of the operator. We prove general consistency and convergence rate results in the framework of Bregman-divergences which allows for a vast range of penalty functionals. Various examples that indicate the applicability of our approach will be discussed. We will illustrate in the context of signal and image processing that the presented method constitutes a locally adaptive reconstruction method.
Open AccessShape Constrained Regularisation by Statistical Multiresolution for Inverse Problems: Asymptotic Analysis
This paper is concerned with a novel regularisation technique for solving linear ill-posed operator equations in Hilbert spaces from data that is corrupted by white noise. We combine convex penalty functionals with extreme-value statistics of projections of the residuals on a given set of sub-spaces in the image-space of the operator. We prove general consistency and convergence rate results in the framework of Bregman-divergences which allows for a vast range of penalty functionals. Various examples that indicate the applicability of our approach will be discussed. We will illustrate in the context of signal and image processing that the presented method constitutes a locally adaptive reconstruction method.
- Open Access
Statistical Multiresolution Dantzig Estimation in Imaging: Fundamental Concepts and Algorithmic Framework
In this paper we are concerned with fully automatic and locally adaptive estimation of functions in a "signal + noise"-model where the regression function may additionally be blurred by a linear operator, e.g. by a convolution. To this end, we introduce a general class of statistical multiresolution estimators and develop an algorithmic framework for computing those. By this we mean estimators that are defined as solutions of convex optimization problems with supremum-type constraints. We employ a combination of the alternating direction method of multipliers with Dykstra's algorithm for computing orthogonal projections onto intersections of convex sets and prove numerical convergence. The capability of the proposed method is illustrated by various examples from imaging and signal detection.
Open AccessStatistical Multiresolution Dantzig Estimation in Imaging: Fundamental Concepts and Algorithmic Framework
In this paper we are concerned with fully automatic and locally adaptive estimation of functions in a "signal + noise"-model where the regression function may additionally be blurred by a linear operator, e.g. by a convolution. To this end, we introduce a general class of statistical multiresolution estimators and develop an algorithmic framework for computing those. By this we mean estimators that are defined as solutions of convex optimization problems with supremum-type constraints. We employ a combination of the alternating direction method of multipliers with Dykstra's algorithm for computing orthogonal projections onto intersections of convex sets and prove numerical convergence. The capability of the proposed method is illustrated by various examples from imaging and signal detection.
- Open Access
Morozov's principle for the augmented Lagrangian method applied to linear inverse problems
The Augmented Lagrangian Method as an approach for regularizing inverse problems received much attention recently, e.g. under the name Bregman iteration in imaging. This work shows convergence (rates) for this method when Morozov's discrepancy principle is chosen as a stopping rule. Moreover, error estimates for the involved sequence of subgradients are pointed out. The paper studies implications of these results for particular examples motivated by applications in imaging. These include the total variation regularization as well as $\ell^q$ penalties with $q\in[1,2]$. It is shown that Morozov's principle implies convergence (rates) for the iterates with respect to the metric of strict convergence and the $\ell^q$-norm, respectively.Open AccessMorozov's principle for the augmented Lagrangian method applied to linear inverse problems
The Augmented Lagrangian Method as an approach for regularizing inverse problems received much attention recently, e.g. under the name Bregman iteration in imaging. This work shows convergence (rates) for this method when Morozov's discrepancy principle is chosen as a stopping rule. Moreover, error estimates for the involved sequence of subgradients are pointed out. The paper studies implications of these results for particular examples motivated by applications in imaging. These include the total variation regularization as well as $\ell^q$ penalties with $q\in[1,2]$. It is shown that Morozov's principle implies convergence (rates) for the iterates with respect to the metric of strict convergence and the $\ell^q$-norm, respectively.