109,347 research outputs found
Segmentation and Restoration of Images on Surfaces by Parametric Active Contours with Topology Changes
In this article, a new method for segmentation and restoration of images on
two-dimensional surfaces is given. Active contour models for image segmentation
are extended to images on surfaces. The evolving curves on the surfaces are
mathematically described using a parametric approach. For image restoration, a
diffusion equation with Neumann boundary conditions is solved in a
postprocessing step in the individual regions. Numerical schemes are presented
which allow to efficiently compute segmentations and denoised versions of
images on surfaces. Also topology changes of the evolving curves are detected
and performed using a fast sub-routine. Finally, several experiments are
presented where the developed methods are applied on different artificial and
real images defined on different surfaces
Terrain analysis using radar shape-from-shading
This paper develops a maximum a posteriori (MAP) probability estimation framework for shape-from-shading (SFS) from synthetic aperture radar (SAR) images. The aim is to use this method to reconstruct surface topography from a single radar image of relatively complex terrain. Our MAP framework makes explicit how the recovery of local surface orientation depends on the whereabouts of terrain edge features and the available radar reflectance information. To apply the resulting process to real world radar data, we require probabilistic models for the appearance of terrain features and the relationship between the orientation of surface normals and the radar reflectance. We show that the SAR data can be modeled using a Rayleigh-Bessel distribution and use this distribution to develop a maximum likelihood algorithm for detecting and labeling terrain edge features. Moreover, we show how robust statistics can be used to estimate the characteristic parameters of this distribution. We also develop an empirical model for the SAR reflectance function. Using the reflectance model, we perform Lambertian correction so that a conventional SFS algorithm can be applied to the radar data. The initial surface normal direction is constrained to point in the direction of the nearest ridge or ravine feature. Each surface normal must fall within a conical envelope whose axis is in the direction of the radar illuminant. The extent of the envelope depends on the corrected radar reflectance and the variance of the radar signal statistics. We explore various ways of smoothing the field of surface normals using robust statistics. Finally, we show how to reconstruct the terrain surface from the smoothed field of surface normal vectors. The proposed algorithm is applied to various SAR data sets containing relatively complex terrain structure
Computing stationary free-surface shapes in microfluidics
A finite-element algorithm for computing free-surface flows driven by
arbitrary body forces is presented. The algorithm is primarily designed for the
microfluidic parameter range where (i) the Reynolds number is small and (ii)
force-driven pressure and flow fields compete with the surface tension for the
shape of a stationary free surface. The free surface shape is represented by
the boundaries of finite elements that move according to the stress applied by
the adjacent fluid. Additionally, the surface tends to minimize its free energy
and by that adapts its curvature to balance the normal stress at the surface.
The numerical approach consists of the iteration of two alternating steps: The
solution of a fluidic problem in a prescribed domain with slip boundary
conditions at the free surface and a consecutive update of the domain driven by
the previously determined pressure and velocity fields. ...Comment: Revised versio
On Approximations of the Curve Shortening Flow and of the Mean Curvature Flow based on the DeTurck trick
In this paper we discuss novel numerical schemes for the computation of the
curve shortening and mean curvature flows that are based on special
reparametrizations. The main idea is to use special solutions to the harmonic
map heat flow in order to reparametrize the equations of motion. This idea is
widely known from the Ricci flow as the DeTurck trick. By introducing a
variable time scale for the harmonic map heat flow, we obtain families of
numerical schemes for the reparametrized flows. For the curve shortening flow
this family unveils a surprising geometric connection between the numerical
schemes in [5] and [9]. For the mean curvature flow we obtain families of
schemes with good mesh properties similar to those in [3]. We prove error
estimates for the semi-discrete scheme of the curve shortening flow. The
behaviour of the fully-discrete schemes with respect to the redistribution of
mesh points is studied in numerical experiments. We also discuss possible
generalizations of our ideas to other extrinsic flows
- …