Stefan Henn
University of Düsseldorf
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Stefan Henn.
VBC '96 Proceedings of the 4th International Conference on Visualization in Biomedical Computing | 1996
Thorsten Schormann; Stefan Henn; Karl Zilles
A technique is presented for elastic alignment applicable to human brains. The transformation which minimizes the distance measure D(u) between template and reference is determined, thereby simultaneously satisfying smoothness constraints derived from an elastic potential known from the theory of kontinuum mechanics. The resulting partial differential equations, with up to 3·220 unknowns are directly solved for each voxel, that is, without interpolation, by an adapted full multigrid-method (FMG) providing a perfect alignment. For further increases of resolution, the full advantages of the FMG are maintained, that is, parallelization and linear effort with O(N), N being the number of grid-points.
SIAM Journal on Scientific Computing | 2001
Stefan Henn; Kristian Witsch
In this paper, we consider the problem of matching images, i.e., to find a deformation u, which transforms a digital image into another such that the images have nearly equal gray values in every image element. The difference of the two images is measured by their L2-difference, which should be minimized. This yields a nonlinear ill conditioned inverse problem for u, so the numerical solution is quite difficult. A Tikhonov regularization method is considered to rule out discontinuous and irregular solutions to the minimization problem. An important problem is a proper choice of the regularization parameter
Computing | 2000
Stefan Henn; Kristian Witsch
\alpha
SIAM Journal on Scientific Computing | 2005
Stefan Henn
. For the practical choice of
Archive | 2006
Ulrich Clarenz; Marc Droske; Stefan Henn; Martin Rumpf; Kristian Witsch
\alpha,
Journal of Mathematical Imaging and Vision | 2006
Stefan Henn
we use iterative regularization methods based on multigrid techniques. To obtain a suitable initial guess, we use an approach similar to the full multigrid (FMG) developed by Brandt [Math. Comp., 31 (1977), pp. 333--390]. The algorithms have optimal complexity: the amount of work is proportional to the number of picture elements. Finally, we present some experimental results for synthetic and real images.
Bit Numerical Mathematics | 2003
Stefan Henn
Abstract In this paper, we consider a multigrid application in digital image processing. Here, the problem is to find a map, which transforms an image T into another image R such that the grey level of the different images are nearly equal in every picture-element. This problem arises in the investigation of human brains. The complete inverse problem is ill posed in the sense of Hadamard and nonlinear, so the numerical solution is quite difficult. We solve the inverse problem by a Landweber iteration. In each minimization step an approximate solution for the linearized problem is computed with a multigrid method as an inner iteration. Finally, we present some experimental results for synthetic and real images.
Mustererkennung 1997, 19. DAGM-Symposium | 1997
Stefan Henn; Thorsten Schormann; Knut Engler; Karl Zilles; Kristian Witsch
In this paper we are concerned with the efficient solution of the elliptic system
SIAM Journal on Scientific Computing | 2003
Stefan Henn; Kristian Witsch
(\alpha L +\nobreak I) u =\nobreak f
Multiscale Modeling & Simulation | 2005
Stefan Henn; Kristian Witsch
, where