Results 11  20
of
345
Spatial Transformation and Registration of Brain Images Using Elastically Deformable Models
, 1997
"... The development of algorithms for the spatial transformation and registration of tomographic brain images is a key issue in several clinical and basic science medical applications, including computer aided neurosurgery, functional image analysis, and morphometrics. This paper describes a technique f ..."
Abstract

Cited by 160 (29 self)
 Add to MetaCart
The development of algorithms for the spatial transformation and registration of tomographic brain images is a key issue in several clinical and basic science medical applications, including computer aided neurosurgery, functional image analysis, and morphometrics. This paper describes a technique for the spatial transformation of brain images, which is based on elastically deformable models. A deformable surface algorithm is used to find a parametric representation of the outer cortical surface and then and then to define a map between corresponding cortical regions in two brain images. Based on the resulting map, a threedimensional elastic warping transformation is then determined, which brings two images into register. This transformation models images as inhomogeneous elastic objects which are deformed into registration with each other by external force fields. The elastic properties of the images can vary from one region to the other, allowing more variable brain regions, such as...
Consistent Image Registration
, 2001
"... This paper presents a new method for image registration based on jointly estimating the forward and reverse transformations between two images while constraining these transforms to be inverses of one another. This approach produces a consistent set of transformations that have less pairwise registr ..."
Abstract

Cited by 157 (8 self)
 Add to MetaCart
This paper presents a new method for image registration based on jointly estimating the forward and reverse transformations between two images while constraining these transforms to be inverses of one another. This approach produces a consistent set of transformations that have less pairwise registration error, i.e., better correspondence, than traditional methods that estimate the forward and reverse transformations independently. The transformations are estimated iteratively and are restricted to preserve topology by constraining them to obey the laws of continuum mechanics. The transformations are parameterized by a Fourier series to diagonalize the covariance structure imposed by the continuum mechanics constraints and to provide a computationally efficient numerical implementation. Results using a linear elastic material constraint are presented using both magnetic resonance and Xray computed tomography image data. The results show that the joint estimation of a consistent set of forward and reverse transformations constrained by linearelasticity give better registration results than using either constraint alone or none at all.
Splinebased image registration
 IN PROC. IEEE CONFERENCE ON COMPUTER VISION PATTERN RECOGNITION
, 1994
"... ..."
Matching 3D Anatomical Surfaces with NonRigid Deformations using OctreeSplines
 International Journal of Computer Vision
, 1996
"... Abstract. This paper presents a new method for determining the minimal nonrigid deformation between two 3D surfaces, such as those which describe anatomical structures in 3D medical images. Although we match surfaces, we represent the deformation as a volumetric transformation. Our method perform ..."
Abstract

Cited by 156 (2 self)
 Add to MetaCart
(Show Context)
Abstract. This paper presents a new method for determining the minimal nonrigid deformation between two 3D surfaces, such as those which describe anatomical structures in 3D medical images. Although we match surfaces, we represent the deformation as a volumetric transformation. Our method performs a least squares minimization of the distance between the two surfaces of interest. To quickly and accurately compute distances between points on the two surfaces, we use a precomputed distance map represented using an octree spline whose resolution increases near the surface. To quickly and robustly compute the deformation, we use a second octree spline to model the deformation function. The coarsest level of the deformation encodes the global (e.g., affine) transformation between the two surfaces, while finer levels encode smooth local displacements which bring the two surfaces into closer registration. We present experimental results on both synthetic and real 3D surfaces. 1.
Group Actions, Homeomorphisms, and Matching: A General Framework
, 2001
"... This paper constructs metrics on the space of images I defined as orbits under group actions G. The groups studied include the finite dimensional matrix groups and their products, as well as the infinite dimensional diffeomorphisms examined in Trouvé (1999, Quaterly of Applied Math.) and Dupuis et a ..."
Abstract

Cited by 132 (7 self)
 Add to MetaCart
This paper constructs metrics on the space of images I defined as orbits under group actions G. The groups studied include the finite dimensional matrix groups and their products, as well as the infinite dimensional diffeomorphisms examined in Trouvé (1999, Quaterly of Applied Math.) and Dupuis et al. (1998). Quaterly of Applied Math.). Leftinvariant metrics are defined on the product G × I thus allowing the generation of transformations of the background geometry as well as the image values. Examples of the application of such metrics are presented for rigid object matching with and without signature variation, curves and volume matching, and structural generation in which image values are changed supporting notions such as tissue creation in carrying one image to another.
Statistical Models of Appearance for Medical Image Analysis and Computer Vision
 In Proc. SPIE Medical Imaging
, 2001
"... Statistical models of shape and appearance are powerful tools for interpreting medical images. We assume a training set of images in which corresponding `landmark' points have been marked on every image. From this data we can compute a statistical model of the shape variation, a model of the te ..."
Abstract

Cited by 114 (1 self)
 Add to MetaCart
Statistical models of shape and appearance are powerful tools for interpreting medical images. We assume a training set of images in which corresponding `landmark' points have been marked on every image. From this data we can compute a statistical model of the shape variation, a model of the texture variation and a model of the correlations between shape and texture. With enough training examples such models should be able to synthesize any image of normal anatomy. By finding the parameters which optimize the match between a synthesized model image and a target image we can locate all the structures represented by the model. Two approaches to the matching will be described. The Active Shape Model essentially matches a model to boundaries in an image. The Active Appearance Model finds model parameters which synthesize a complete image which is as similar as possible to the target image. By using a `difference decomposition' approach the current difference between target image and synthesi...
Fast parametric elastic image registration
 IEEE Transactions on Image Processing
, 2003
"... Abstract—We present an algorithm for fast elastic multidimensional intensitybased image registration with a parametric model of the deformation. It is fully automatic in its default mode of operation. In the case of hard realworld problems, it is capable of accepting expert hints in the form of so ..."
Abstract

Cited by 102 (8 self)
 Add to MetaCart
(Show Context)
Abstract—We present an algorithm for fast elastic multidimensional intensitybased image registration with a parametric model of the deformation. It is fully automatic in its default mode of operation. In the case of hard realworld problems, it is capable of accepting expert hints in the form of soft landmark constraints. Much fewer landmarks are needed and the results are far superior compared to pure landmark registration. Particular attention has been paid to the factors influencing the speed of this algorithm. The Bspline deformation model is shown to be computationally more efficient than other alternatives. The algorithm has been successfully used for several twodimensional (2D) and threedimensional (3D) registration tasks in the medical domain, involving MRI, SPECT, CT, and ultrasound image modalities. We also present experiments in a controlled environment, permitting an exact evaluation of the registration accuracy. Test deformations are generated automatically using a random hierarchical fractional waveletbased generator. Index Terms—Elastic registration, image registration, landmarks, splines. I.
Consistent Landmark and IntensityBased Image Registration
, 2002
"... Two new consistent image registration algorithms are presented: one is based on matching corresponding landmarks and the other is based on matching both landmark and intensity information. The consistent landmark and intensity registration algorithm produces good correspondences between images near ..."
Abstract

Cited by 100 (3 self)
 Add to MetaCart
Two new consistent image registration algorithms are presented: one is based on matching corresponding landmarks and the other is based on matching both landmark and intensity information. The consistent landmark and intensity registration algorithm produces good correspondences between images near landmark locations by matching corresponding landmarks and away from landmark locations by matching the image intensities. In contrast to similar unidirectional algorithms, these new consistent algorithms jointly estimate the forward and reverse transformation between two images while minimizing the inverse consistency error  the error between the forward (reverse) transformation and the inverse of the the reverse (forward) transformation. This reduces the ambiguous correspondence between the forward and reverse transformations associated with large inverse consistency errors. In both algorithms a thinplate spline (TPS) model is used to regularize the estimated transformations. Twodimensional (2D) examples are presented that show the inverse consistency error produced by the traditional unidirectional landmark TPS algorithm can be relatively large and that this error is minimized using the consistent landmark algorithm. Results using 2D magnetic resonance imaging data are presented that demonstrate that using landmark and intensity information together produce better correspondence between medical images than using either landmarks or intensity information alone.
Image Registration Based on Boundary Mapping
, 1996
"... A new twostage approach for nonlinear brain image registration is proposed. In the first stage, an active contour algorithm is used to establish a homothetic onetoone map between a set of region boundaries in two images to be registered. This mapping is used in the second step: a twodimensional ..."
Abstract

Cited by 86 (7 self)
 Add to MetaCart
A new twostage approach for nonlinear brain image registration is proposed. In the first stage, an active contour algorithm is used to establish a homothetic onetoone map between a set of region boundaries in two images to be registered. This mapping is used in the second step: a twodimensional transformation which is based on an elastic body deformation. This method is tested by registering magnetic resonance images to atlas images. I. Introduction Registration of both intrasubject and intersubject brain images has been the subject of extensive study in the medical imaging literature. The various techniques that have been proposed can be classified into three major categories: polynomial transformations, similaritybased methods, and boundarybased methods. Polynomial transformations [1, 2, 3] apply a polynomial warping and determine the coefficients of the polynomial using linear regression if a sufficient number of landmark points is provided. Numerical instabilities and the ...