Bernd Fischer

Bio: Bernd Fischer is an academic researcher from University of Lübeck. The author has contributed to research in topics: Image registration & Image processing. The author has an hindex of 23, co-authored 77 publications receiving 2854 citations.

Visual field representations and locations of visual areas V1/2/3 in human visual cortex.

Abstract: The position, surface area and visual field representation of human visual areas V1, V2 and V3 were measured using fMRI in 7 subjects (14 hemispheres). Cortical visual field maps of the central 12 deg were measured using rotating wedge and expanding ring stimuli. The boundaries between areas were identified using an automated procedure to fit an atlas of the expected visual field map to the data. All position and surface area measurements were made along the boundary between white matter and gray matter. The representation of the central 2 deg of visual field in areas V1, V2, V3 and hV4 spans about 2100 mm2 and is centered on the lateral-ventral aspect of the occipital lobes at Talairach coordinates -29, -78, -11 and 25, -80, -9. The mean area between the 2-deg and 12-deg eccentricities for the primary visual areas was: V1: 1470 mm2; V2: 1115 mm2; and V3: 819 mm2. The sizes of areas V1, V2 and V3 varied by about a factor of 2.5 across individuals; the sizes of V1 and V2 are significantly correlated within individuals, but there is a very low correlation between V1 and V3. These in vivo measurements of normal human retinotopic visual areas can be used as a reference for comparison to unusual cases involving developmental plasticity, recovery from injury, identifying homology with animal models, or analyzing the computational resources available within the visual pathways.

Curvature Based Image Registration

Abstract: A fully automated, non-rigid image registration algorithm is presented. The deformation field is found by minimizing a suitable measure subject to a curvature based constraint. It is a well-known fact that non-rigid image registration techniques may converge poorly if the initial position is not sufficiently near to the solution. A common approach to address this problem is to perform a time consuming rigid pre-registration step. In this paper we show that the new curvature registration not only produces accurate and smooth solutions but also allows for an automatic rigid alignment. Thus, in contrast to other popular registration schemes, the new method no longer requires a pre-registration step. Furthermore, we present an implementation of the new scheme based on the numerical solution of the underlying Euler-Lagrange equations. The real discrete cosine transform is the backbone of our implementation and leads to a stable and fast {\cal O}(N log N) algorithm, where N denotes the number of voxels. Finally, we report on some numerical test runs.

Ill-posed medicine—an introduction to image registration

Abstract: Image registration is the process of aligning two or more images of the same scene taken at different times, from different viewpoints and/or by different sensors. Image registration is a crucial step in imaging problems where the valuable information is contained in more than one image. Here, spatial alignment is required to properly integrate useful information from the separate images. It is the goal of this paper to give an overview on modern techniques in this area. It turns out that the registration problem is an inverse problem which does require a sound regularization and the use of proper models. Also, the numerics have to be done with great care. We will comment on these issues and supplement it by real life examples.

Minimum residual methods for augmented systems

Abstract: For large systems of linear equations, iterative methods provide attractive solution techniques. We describe the applicability and convergence of iterative methods of Krylov subspace type for an important class of symmetric and indefinite matrix problems, namely augmented (or KKT) systems. Specifically, we consider preconditioned minimum residual methods and discuss indefinite versus positive definite preconditioning. For a natural choice of starting vector we prove that when the definite and indenfinite preconditioners are related in the obvious way, MINRES (which is applicable in the case of positive definite preconditioning) and full GMRES (which is applicable in the case of indefinite preconditioning) give residual vectors with identical Euclidean norm at each iteration. Moreover, we show that the convergence of both methods is related to a system of normal equations for which the LSQR algorithm can be employed. As a side result, we give a rare example of a non-trivial normal(1) matrix where the corresponding inner product is explicitly known: a conjugate gradient method therefore exists and can be employed in this case.

elastix : A Toolbox for Intensity-Based Medical Image Registration

Abstract: Medical image registration is an important task in medical image processing. It refers to the process of aligning data sets, possibly from different modalities (e.g., magnetic resonance and computed tomography), different time points (e.g., follow-up scans), and/or different subjects (in case of population studies). A large number of methods for image registration are described in the literature. Unfortunately, there is not one method that works for all applications. We have therefore developed elastix, a publicly available computer program for intensity-based medical image registration. The software consists of a collection of algorithms that are commonly used to solve medical image registration problems. The modular design of elastix allows the user to quickly configure, test, and compare different registration methods for a specific application. The command-line interface enables automated processing of large numbers of data sets, by means of scripting. The usage of elastix for comparing different registration methods is illustrated with three example experiments, in which individual components of the registration method are varied.

Numerical solution of saddle point problems

Abstract: Large linear systems of saddle point type arise in a wide variety of applications throughout computational science and engineering. Due to their indefiniteness and often poor spectral properties, such linear systems represent a significant challenge for solver developers. In recent years there has been a surge of interest in saddle point problems, and numerous solution techniques have been proposed for this type of system. The aim of this paper is to present and discuss a large selection of solution methods for linear systems in saddle point form, with an emphasis on iterative methods for large and sparse problems.

Deformable Medical Image Registration: A Survey

Abstract: Deformable image registration is a fundamental task in medical image processing. Among its most important applications, one may cite: 1) multi-modality fusion, where information acquired by different imaging devices or protocols is fused to facilitate diagnosis and treatment planning; 2) longitudinal studies, where temporal structural or anatomical changes are investigated; and 3) population modeling and statistical atlases used to study normal anatomical variability. In this paper, we attempt to give an overview of deformable registration methods, putting emphasis on the most recent advances in the domain. Additional emphasis has been given to techniques applied to medical images. In order to study image registration methods in depth, their main components are identified and studied independently. The most recent techniques are presented in a systematic fashion. The contribution of this paper is to provide an extensive account of registration techniques in a systematic manner.

Barycentric Lagrange Interpolation

Abstract: Barycentric interpolation is a variant of Lagrange polynomial interpolation that is fast and stable. It deserves to be known as the standard method of polynomial interpolation.