2,274 research outputs found
On a continuation approach in Tikhonov regularization and its application in piecewise-constant parameter identification
We present a new approach to convexification of the Tikhonov regularization
using a continuation method strategy. We embed the original minimization
problem into a one-parameter family of minimization problems. Both the penalty
term and the minimizer of the Tikhonov functional become dependent on a
continuation parameter.
In this way we can independently treat two main roles of the regularization
term, which are stabilization of the ill-posed problem and introduction of the
a priori knowledge. For zero continuation parameter we solve a relaxed
regularization problem, which stabilizes the ill-posed problem in a weaker
sense. The problem is recast to the original minimization by the continuation
method and so the a priori knowledge is enforced.
We apply this approach in the context of topology-to-shape geometry
identification, where it allows to avoid the convergence of gradient-based
methods to a local minima. We present illustrative results for magnetic
induction tomography which is an example of PDE constrained inverse problem
Parametric Level Set Methods for Inverse Problems
In this paper, a parametric level set method for reconstruction of obstacles
in general inverse problems is considered. General evolution equations for the
reconstruction of unknown obstacles are derived in terms of the underlying
level set parameters. We show that using the appropriate form of parameterizing
the level set function results a significantly lower dimensional problem, which
bypasses many difficulties with traditional level set methods, such as
regularization, re-initialization and use of signed distance function.
Moreover, we show that from a computational point of view, low order
representation of the problem paves the path for easier use of Newton and
quasi-Newton methods. Specifically for the purposes of this paper, we
parameterize the level set function in terms of adaptive compactly supported
radial basis functions, which used in the proposed manner provides flexibility
in presenting a larger class of shapes with fewer terms. Also they provide a
"narrow-banding" advantage which can further reduce the number of active
unknowns at each step of the evolution. The performance of the proposed
approach is examined in three examples of inverse problems, i.e., electrical
resistance tomography, X-ray computed tomography and diffuse optical
tomography
Image Segmentation with Eigenfunctions of an Anisotropic Diffusion Operator
We propose the eigenvalue problem of an anisotropic diffusion operator for
image segmentation. The diffusion matrix is defined based on the input image.
The eigenfunctions and the projection of the input image in some eigenspace
capture key features of the input image. An important property of the model is
that for many input images, the first few eigenfunctions are close to being
piecewise constant, which makes them useful as the basis for a variety of
applications such as image segmentation and edge detection. The eigenvalue
problem is shown to be related to the algebraic eigenvalue problems resulting
from several commonly used discrete spectral clustering models. The relation
provides a better understanding and helps developing more efficient numerical
implementation and rigorous numerical analysis for discrete spectral
segmentation methods. The new continuous model is also different from
energy-minimization methods such as geodesic active contour in that no initial
guess is required for in the current model. The multi-scale feature is a
natural consequence of the anisotropic diffusion operator so there is no need
to solve the eigenvalue problem at multiple levels. A numerical implementation
based on a finite element method with an anisotropic mesh adaptation strategy
is presented. It is shown that the numerical scheme gives much more accurate
results on eigenfunctions than uniform meshes. Several interesting features of
the model are examined in numerical examples and possible applications are
discussed
Total variation regularization of multi-material topology optimization
This work is concerned with the determination of the diffusion coefficient
from distributed data of the state. This problem is related to homogenization
theory on the one hand and to regularization theory on the other hand. An
approach is proposed which involves total variation regularization combined
with a suitably chosen cost functional that promotes the diffusion coefficient
assuming prespecified values at each point of the domain. The main difficulty
lies in the delicate functional-analytic structure of the resulting
nondifferentiable optimization problem with pointwise constraints for functions
of bounded variation, which makes the derivation of useful pointwise optimality
conditions challenging. To cope with this difficulty, a novel reparametrization
technique is introduced. Numerical examples using a regularized semismooth
Newton method illustrate the structure of the obtained diffusion coefficient.
Optimising Spatial and Tonal Data for PDE-based Inpainting
Some recent methods for lossy signal and image compression store only a few
selected pixels and fill in the missing structures by inpainting with a partial
differential equation (PDE). Suitable operators include the Laplacian, the
biharmonic operator, and edge-enhancing anisotropic diffusion (EED). The
quality of such approaches depends substantially on the selection of the data
that is kept. Optimising this data in the domain and codomain gives rise to
challenging mathematical problems that shall be addressed in our work.
In the 1D case, we prove results that provide insights into the difficulty of
this problem, and we give evidence that a splitting into spatial and tonal
(i.e. function value) optimisation does hardly deteriorate the results. In the
2D setting, we present generic algorithms that achieve a high reconstruction
quality even if the specified data is very sparse. To optimise the spatial
data, we use a probabilistic sparsification, followed by a nonlocal pixel
exchange that avoids getting trapped in bad local optima. After this spatial
optimisation we perform a tonal optimisation that modifies the function values
in order to reduce the global reconstruction error. For homogeneous diffusion
inpainting, this comes down to a least squares problem for which we prove that
it has a unique solution. We demonstrate that it can be found efficiently with
a gradient descent approach that is accelerated with fast explicit diffusion
(FED) cycles. Our framework allows to specify the desired density of the
inpainting mask a priori. Moreover, is more generic than other data
optimisation approaches for the sparse inpainting problem, since it can also be
extended to nonlinear inpainting operators such as EED. This is exploited to
achieve reconstructions with state-of-the-art quality.
We also give an extensive literature survey on PDE-based image compression
methods
- …