769 research outputs found
Joint methods in imaging based on diffuse image representations
This thesis deals with the application and the analysis of different variants of the Mumford-Shah model in the context of image processing. In this kind of models, a given function is approximated in a piecewise smooth or piecewise constant manner. Especially the numerical treatment of the discontinuities requires additional models that are also outlined in this work. The main part of this thesis is concerned with four different topics. Simultaneous edge detection and registration of two images: The image edges are detected with the Ambrosio-Tortorelli model, an approximation of the Mumford-Shah model that approximates the discontinuity set with a phase field, and the registration is based on these edges. The registration obtained by this model is fully symmetric in the sense that the same matching is obtained if the roles of the two input images are swapped. Detection of grain boundaries from atomic scale images of metals or metal alloys: This is an image processing problem from materials science where atomic scale images are obtained either experimentally for instance by transmission electron microscopy or by numerical simulation tools. Grains are homogenous material regions whose atomic lattice orientation differs from their surroundings. Based on a Mumford-Shah type functional, the grain boundaries are modeled as the discontinuity set of the lattice orientation. In addition to the grain boundaries, the model incorporates the extraction of a global elastic deformation of the atomic lattice. Numerically, the discontinuity set is modeled by a level set function following the approach by Chan and Vese. Joint motion estimation and restoration of motion-blurred video: A variational model for joint object detection, motion estimation and deblurring of consecutive video frames is proposed. For this purpose, a new motion blur model is developed that accurately describes the blur also close to the boundary of a moving object. Here, the video is assumed to consist of an object moving in front of a static background. The segmentation into object and background is handled by a Mumford-Shah type aspect of the proposed model. Convexification of the binary Mumford-Shah segmentation model: After considering the application of Mumford-Shah type models to tackle specific image processing problems in the previous topics, the Mumford-Shah model itself is studied more closely. Inspired by the work of Nikolova, Esedoglu and Chan, a method is developed that allows global minimization of the binary Mumford-Shah segmentation model by solving a convex, unconstrained optimization problem. In an outlook, segmentation of flowfields into piecewise affine regions using this convexification method is briefly discussed
Discrete stochastic approximations of the Mumford-Shah functional
We propose a -convergent discrete approximation of the Mumford-Shah
functional. The discrete functionals act on functions defined on stationary
stochastic lattices and take into account general finite differences through a
non-convex potential. In this setting the geometry of the lattice strongly
influences the anisotropy of the limit functional. Thus we can use
statistically isotropic lattices and stochastic homogenization techniques to
approximate the vectorial Mumford-Shah functional in any dimension.Comment: 47 pages, reorganized versio
A Posteriori Error Control for the Binary Mumford-Shah Model
The binary Mumford-Shah model is a widespread tool for image segmentation and
can be considered as a basic model in shape optimization with a broad range of
applications in computer vision, ranging from basic segmentation and labeling
to object reconstruction. This paper presents robust a posteriori error
estimates for a natural error quantity, namely the area of the non properly
segmented region. To this end, a suitable strictly convex and non-constrained
relaxation of the originally non-convex functional is investigated and Repin's
functional approach for a posteriori error estimation is used to control the
numerical error for the relaxed problem in the -norm. In combination with
a suitable cut out argument, a fully practical estimate for the area mismatch
is derived. This estimate is incorporated in an adaptive meshing strategy. Two
different adaptive primal-dual finite element schemes, and the most frequently
used finite difference discretization are investigated and compared. Numerical
experiments show qualitative and quantitative properties of the estimates and
demonstrate their usefulness in practical applications.Comment: 18 pages, 7 figures, 1 tabl
The KSBA compactification for the moduli space of degree two K3 pairs
Inspired by the ideas of the minimal model program, Shepherd-Barron,
Koll\'ar, and Alexeev have constructed a geometric compactification for the
moduli space of surfaces of log general type. In this paper, we discuss one of
the simplest examples that fits into this framework: the case of pairs (X,H)
consisting of a degree two K3 surface X and an ample divisor H. Specifically,
we construct and describe explicitly a geometric compactification
for the moduli of degree two K3 pairs. This compactification has a natural
forgetful map to the Baily-Borel compactification of the moduli space of
degree two K3 surfaces. Using this map and the modular meaning of ,
we obtain a better understanding of the geometry of the standard
compactifications of .Comment: 45 pages, 4 figures, 2 table
- …