Results 1  10
of
38
Shape analysis of brain ventricles using SPHARM
, 2001
"... Enlarged ventricular size and/or asymmetry have been found markers for psychiatric illness, including schizophrenia. However, this morphometric feature is nonspecific and occurs in many other brain diseases, and its variability in healthy controls is not sufficiently understood. We studied ventricu ..."
Abstract

Cited by 88 (9 self)
 Add to MetaCart
Enlarged ventricular size and/or asymmetry have been found markers for psychiatric illness, including schizophrenia. However, this morphometric feature is nonspecific and occurs in many other brain diseases, and its variability in healthy controls is not sufficiently understood. We studied ventricular size and shape in 3D MRI (N=20) of monozygotic (N=5) and dizygotic (N=5) twin pairs. Left and right lateral, third and fourth ventricles were segmented from highresolution T1w SPGR MRI using supervised classification and 3D connectivity. Surfaces of binary segmentations of left and right lateral ventricles were parametrized and described by a series expansion using spherical harmonics. Objects were aligned using the intrinsic coordinate system of the ellipsoid described by the first order expansion. The metric for pairwise shape similarity was the mean squared distance (MSD) between object surfaces. Without normalization for size, MZ twin pairs only showed a trend to have more similar lateral ventricles than DZ twins. After scaling by individual volumes, however, the pairwise shape difference between right lateral ventricles of MZ twins became very small with small group variance, differing significantly from DZ twin pairs. This finding suggests that there is new information in shape not represented by size, a property that might improve understanding of neurodevelopmental and neurodegenerative changes of brain objects and of heritability of size and shape of brain structures. The findings further suggest that alignment and normalization of objects are key issues in statistical shape analysis which need further exploration.
Construction of an abdominal probabilistic atlas and its application in segmentation
, 2003
"... There have been significant efforts to build a probabilistic atlas of the brain and to use it for many common applications, such as segmentation and registration. Though the work related to brain atlases can be applied to nonbrain organs, less attention has been paid to actually building an atlas f ..."
Abstract

Cited by 45 (3 self)
 Add to MetaCart
There have been significant efforts to build a probabilistic atlas of the brain and to use it for many common applications, such as segmentation and registration. Though the work related to brain atlases can be applied to nonbrain organs, less attention has been paid to actually building an atlas for organs other than the brain. Motivated by the automatic identification of normal organs for applications in radiation therapy treatment planning, we present a method to construct a probabilistic atlas of an abdomen consisting of four organs (i.e., liver, kidneys, and spinal cord). Using 32 noncontrast abdominal computed tomography (CT) scans, 31 were mapped onto one individual scan using thin plate spline as the warping transform and mutual information (MI) as the similarity measure. Except for an initial coarse placement of four control points by the operators, the MIbased registration was automatic. Additionally, the four organs in each of the 32 CT data sets were manually segmented. The manual segmentations were warped onto the “standard ” patient space using the same transform computed from their gray scale CT data set and a probabilistic atlas was calculated. Then, the atlas was used to aid the segmentation of lowcontrast organs in an additional 20 CT data sets not included in the atlas. By incorporating the atlas information into the Bayesian framework, segmentation results clearly showed improvements over a standard unsupervised segmentation method.
Brain functional localization: a survey of image registration techniques
 16th European Signal Processing Conference (EUSIPCO 2008
, 2007
"... Abstract—Functional localization is a concept which involves the application of a sequence of geometrical and statistical image processing operations in order to define the location of brain activity or to produce functional/parametric maps with respect to the brain structure or anatomy. Considerin ..."
Abstract

Cited by 40 (1 self)
 Add to MetaCart
(Show Context)
Abstract—Functional localization is a concept which involves the application of a sequence of geometrical and statistical image processing operations in order to define the location of brain activity or to produce functional/parametric maps with respect to the brain structure or anatomy. Considering that functional brain images do not normally convey detailed structural information and, thus, do not present an anatomically specific localization of functional activity, various image registration techniques are introduced in the literature for the purpose of mapping functional activity into an anatomical image or a brain atlas. The problems addressed by these techniques differ depending on the application and the type of analysis, i.e., singlesubject versus group analysis. Functional to anatomical brain image registration is the core part of functional localization in most applications and is accompanied by intersubject and subjecttoatlas registration for group analysis studies. Cortical surface registration and automatic brain labeling are some of the other tools towards establishing a fully automatic functional localization procedure. While several previous survey papers have reviewed and classified generalpurpose medical image registration techniques, this paper provides an overview of brain functional localization along with a survey and classification of the image registration techniques related to this problem. Index Terms—Brain functional localization, fMRI image processing, functional imaging, survey of image registration techniques. I.
Multiscale Medial ShapeBased Analysis of Image Objects
, 2003
"... Medial representation of a threedimensional (3D) object or an ensemble of 3D objects involves capturing the object interior as a locus of medial atoms, each atom being two vectors of equal length joined at the tail at the medial point. Medial representation has a variety of beneficial properties, ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
Medial representation of a threedimensional (3D) object or an ensemble of 3D objects involves capturing the object interior as a locus of medial atoms, each atom being two vectors of equal length joined at the tail at the medial point. Medial representation has a variety of beneficial properties, among the most important of which are 1) its inherent geometry, provides an objectintrinsic coordinate system and thus provides correspondence between instances of the object in and near the object(s); 2) it captures the object interior and is, thus, very suitable for deformation; and 3) it provides the basis for an intuitive objectbased multiscale sequence leading to efficiency of segmentation algorithms and trainability of statistical characterizations with limited training sets. As a result of these properties, medial representation is particularly suitable for the following image analysis tasks; how each operates will be described and will be illustrated by results:
Least biased target selection in probabilistic atlas construction
 Proc of MICCAI’05, 3750:419–426
, 2005
"... Abstract. Probabilistic atlas has broad applications in medical image segmentation and registration. The most common problem building a probabilistic atlas is picking a target image upon which to map the rest of the training images. Here we present a method to choose a target image that is the close ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Probabilistic atlas has broad applications in medical image segmentation and registration. The most common problem building a probabilistic atlas is picking a target image upon which to map the rest of the training images. Here we present a method to choose a target image that is the closest to the mean geometry of the population under consideration as determined by bending energy. Our approach is based on forming a distance matrix based on bending energies of all pairwise registrations and performing multidimensional scaling (MDS) on the distance matrix. 1
FreeForm Bspline Deformation Model for Groupwise Registration
, 2007
"... In this work, we extend a previously demonstrated entropy based groupwise registration method to include a freeform deformation model based on Bsplines. We provide an efficient implementation using stochastic gradient descents in a multiresolution setting. We demonstrate the method in application ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
In this work, we extend a previously demonstrated entropy based groupwise registration method to include a freeform deformation model based on Bsplines. We provide an efficient implementation using stochastic gradient descents in a multiresolution setting. We demonstrate the method in application to a set of 50 MRI brain scans and compare the results to a pairwise approach using segmentation labels to evaluate the quality of alignment. Our results indicate that increasing the complexity of the deformation model improves registration accuracy significantly, especially at cortical regions.
Determining correspondence in 3d MR brain images using attribute vectors as morphological signatures of voxels
 IEEE Transactions on Medical Imaging
, 2004
"... Abstract—Finding point correspondence in anatomical images is a key step in shape analysis and deformable registration. This paper proposes an automatic correspondence detection algorithm for intramodality MR brain images of different subjects using waveletbased attribute vectors (WAVs) defined on ..."
Abstract

Cited by 21 (9 self)
 Add to MetaCart
Abstract—Finding point correspondence in anatomical images is a key step in shape analysis and deformable registration. This paper proposes an automatic correspondence detection algorithm for intramodality MR brain images of different subjects using waveletbased attribute vectors (WAVs) defined on every image voxel. The attribute vector (AV) is extracted from the wavelet subimages and reflects the image structure in a large neighborhood around the respective voxel in a multiscale fashion. It plays the role of a morphological signature for each voxel, and our goal is, therefore, to make it distinctive of the respective voxel. Correspondence is then determined from similarities of AVs. By incorporating the prior knowledge of the spatial relationship among voxels, the ability of the proposed algorithm to find anatomical correspondence is further improved. Experiments with MR images of human brains show that the algorithm performs similarly to experts, even for complex cortical structures. Index Terms—Computational anatomy, correspondence, deformable registration, image matching, wavelet transformations. I.
A low dimensional fluid motion estimator
 Int. J. Comp. Vision
"... In this paper we propose a new motion estimator for image sequences depicting fluid flows. The proposed estimator is based on the Helmholtz decomposition of vector fields. This decomposition consists in representing the velocity field as a sum of a divergence free component and a vorticity free comp ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
(Show Context)
In this paper we propose a new motion estimator for image sequences depicting fluid flows. The proposed estimator is based on the Helmholtz decomposition of vector fields. This decomposition consists in representing the velocity field as a sum of a divergence free component and a vorticity free component. The objective is to provide a lowdimensional parametric representation of optical flows by depicting them as deformations generated by a reduced number of vortex and source particles. Both components are approximated using a discretization of the vorticity and divergence maps through regularized Dirac measures. The resulting so called irrotational and solenoidal fields consist of linear combinations of basis functions obtained through a convolution product of the Green kernel gradient and the vorticity map or the divergence map respectively. The coefficient values and the basis function parameters are obtained by minimization of a functional relying on an integrated version of mass conservation principle of fluid mechanics. Results are provided on synthetic examples and real world sequences. 1
Shape Metrics, Warping and Statistics
 in Proc. International Conference on Image Processing
, 2003
"... We propose to use approximations of shape metrics, such as the Hausdorff distance, to define similarity measures between shapes. Our approximations being continuous and differentiable, they provide an obvious way to warp a shape onto another by solving a Partial Differential Equation (PDE), in effec ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
(Show Context)
We propose to use approximations of shape metrics, such as the Hausdorff distance, to define similarity measures between shapes. Our approximations being continuous and differentiable, they provide an obvious way to warp a shape onto another by solving a Partial Differential Equation (PDE), in effect a curve flow, obtained from their first order variation. This first order variation defines a normal deformation field for a given curve. We use the normal deformation fields induced by several sample shape examples to define their mean, their covariance ”operator”, and the principal modes of variation. Our theory, which can be seen as a nonlinear generalization of the linear approaches proposed by several authors, is illustrated with numerous examples. Our approach being based upon the use of distance functions is characterized by the fact that it is intrinsic, i.e. independent of the shape parametrization. 1.
Nonrigid Groupwise Registration using BSpline Deformation Model  Release 0.00
, 2007
"... In this work, we extend a previously demonstrated entropy based groupwise registration method to include a nonrigid deformation model based on Bsplines. We describe an open source implementation of the groupwise registration algorithm using the Insight Toolkit ITK www.itk.org. We provide the sourc ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
In this work, we extend a previously demonstrated entropy based groupwise registration method to include a nonrigid deformation model based on Bsplines. We describe an open source implementation of the groupwise registration algorithm using the Insight Toolkit ITK www.itk.org. We provide the source code, parameters, input and output data that we used for validation. We describe an efficient implementation of the algorithm by using a stochastic optimization scheme embedded in a multiresolution setting. The objective function is optimized using gradient descent algorithm combined with line search for the step size. The derivative of the objective function is evaluated efficiently by computing Jacobian of Bspline deformation field locally. We demonstrate the algorithm in application to different imaging modalities including proton density, FA, T1 and T2 MR images. We validate the algorithm on synthetic datasets varying from 2 to 30 images by