Results 1  10
of
52
Evaluation of 14 nonlinear deformation algorithms applied to human brain MRI registration
 NEUROIMAGE 46 (2009) 786–802
, 2009
"... ..."
Diffeomorphic Demons: Efficient Nonparametric Image Registration
, 2008
"... We propose an efficient nonparametric diffeomorphic image registration algorithm based on Thirion’s demons algorithm. In the first part of this paper, we show that Thirion’s demons algorithm can be seen as an optimization procedure on the entire space of displacement fields. We provide strong theor ..."
Abstract

Cited by 64 (8 self)
 Add to MetaCart
(Show Context)
We propose an efficient nonparametric diffeomorphic image registration algorithm based on Thirion’s demons algorithm. In the first part of this paper, we show that Thirion’s demons algorithm can be seen as an optimization procedure on the entire space of displacement fields. We provide strong theoretical roots to the different variants of Thirion’s demons algorithm. This analysis predicts a theoretical advantage for the symmetric forces variant of the demons algorithm. We show on controlled experiments that this advantage is confirmed in practice and yields a faster convergence. In the second part of this paper, we adapt the optimization procedure underlying the demons algorithm to a space of diffeomorphic transformations. In contrast to many diffeomorphic registration algorithms, our solution is computationally efficient since in practice it only replaces an addition of displacement fields by a few compositions. Our experiments show that in addition to being diffeomorphic, our algorithm provides results that are similar to the ones from the demons algorithm but with transformations that are much smoother and closer to the gold standard, available in controlled experiments, in terms of Jacobians.
Symmetric logdomain diffeomorphic registration: A demonsbased approach
 IMAG. COMPUT
, 2008
"... Modern morphometric studies use nonlinear image registration to compare anatomies and perform group analysis. Recently, logEuclidean approaches have contributed to promote the use of such computational anatomy tools by permitting simple computations of statistics on a rather large class of inverti ..."
Abstract

Cited by 51 (23 self)
 Add to MetaCart
(Show Context)
Modern morphometric studies use nonlinear image registration to compare anatomies and perform group analysis. Recently, logEuclidean approaches have contributed to promote the use of such computational anatomy tools by permitting simple computations of statistics on a rather large class of invertible spatial transformations. In this work, we propose a nonlinear registration algorithm perfectly fit for logEuclidean statistics on diffeomorphisms. Our algorithm works completely in the logdomain, i.e. it uses a stationary velocity field. This implies that we guarantee the invertibility of the deformation and have access to the true inverse transformation. This also means that our output can be directly used for logEuclidean statistics without relying on the heavy computation of the log of the spatial transformation. As it is often desirable, our algorithm is symmetric with respect to the order of the input images. Furthermore, we use an alternate optimization approach related to Thirion’s demons algorithm to provide a fast nonlinear registration algorithm. First results show that our algorithm outperforms both the demons algorithm and the recently proposed diffeomorphic demons algorithm in terms of accuracy of the transformation while remaining computationally efficient.
Dense Image Registration through MRFs and Efficient Linear Programming
, 2008
"... In this paper we introduce a novel and efficient approach to dense image registration, which does not require a derivative of the employed cost function. In such a context the registration problem is formulated using a discrete Markov Random Field objective function. First, towards dimensionality re ..."
Abstract

Cited by 46 (28 self)
 Add to MetaCart
In this paper we introduce a novel and efficient approach to dense image registration, which does not require a derivative of the employed cost function. In such a context the registration problem is formulated using a discrete Markov Random Field objective function. First, towards dimensionality reduction on the variables we assume that the dense deformation field can be expressed using a small number of control points (registration grid) and an interpolation strategy. Then, the registration cost is expressed using a discrete sum over image costs (using an arbitrary similarity measure) projected on the control points, and a smoothness term that penalizes local deviations on the deformation field according to a neighborhood system on the grid. Towards a discrete approach the search space is quantized resulting in a fully discrete model. In order to account for large deformations and produce results on a high resolution level a multiscale incremental approach is considered where the optimal solution is iteratively updated. This is done through successive morphings of the source towards the target image. Efficient linear programming using the primal dual principles is considered to recover the lowest potential of the cost function. Very promising results using synthetic data with known deformations and real data demonstrate the potentials of our approach.
Nonparametric Diffeomorphic Image Registration with Demons Algorithm
, 2007
"... We propose a nonparametric diffeomorphic image registration algorithm based on Thirion’s demons algorithm. The demons algorithm can be seen as an optimization procedure on the entire space of displacement fields. The main idea of our algorithm is to adapt this procedure to a space of diffeomorphi ..."
Abstract

Cited by 33 (9 self)
 Add to MetaCart
(Show Context)
We propose a nonparametric diffeomorphic image registration algorithm based on Thirion’s demons algorithm. The demons algorithm can be seen as an optimization procedure on the entire space of displacement fields. The main idea of our algorithm is to adapt this procedure to a space of diffeomorphic transformations. In contrast to many diffeomorphic registration algorithms, our solution is computationally efficient since in practice it only replaces an addition of free form deformations by a few compositions. Our experiments show that in addition to being diffeomorphic, our algorithm provides results that are similar to the ones from the demons algorithm but with transformations that are much smoother and closer to the true ones in terms of Jacobians.
Grid Powered Nonlinear Image Registration with Locally Adaptive Regularization
 MICCAI 2003 Special Issue
, 2004
"... Multisubject nonrigid registration algorithms using dense deformation fields often encounter cases where the transformation to be estimated has a large spatial variability. In these cases, linear stationary regularization methods are not su#cient. In this paper, we present an algorithm that uses a ..."
Abstract

Cited by 30 (11 self)
 Add to MetaCart
Multisubject nonrigid registration algorithms using dense deformation fields often encounter cases where the transformation to be estimated has a large spatial variability. In these cases, linear stationary regularization methods are not su#cient. In this paper, we present an algorithm that uses a priori information about the nature of imaged objects in order to adapt the regularization of the deformations. We also present a robustness improvement that gives higher weight to those points in images that contain more information. Finally, a fast parallel implementation using networked personal computers is presented. In order to improve the usability of the parallel software by a clinical user, we have implemented it as a grid service that can be controlled by a graphics workstation embedded in the clinical environment. Results on intersubject pairs of images show that our method can take into account the large variability of most brain structures. The registration time for images 124 is 5 minutes on 15 standard PCs. A comparison of our nonstationary viscoelastic smoothing versus solely elastic or fluid regularizations shows that our algorithm converges faster towards a more optimal solution in terms of accuracy and transformation regularity.
Learning Object Correspondences with the Observed Transport Shape Measure
 In Prof. IPMI
, 2003
"... We propose a learning method which introduces explicit knowledge to the object correspondence problem. Our approach uses an a priori learning set to compute a dense correspondence field between two objects, where the characteristics of the field bear close resemblance to those in the learning s ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
(Show Context)
We propose a learning method which introduces explicit knowledge to the object correspondence problem. Our approach uses an a priori learning set to compute a dense correspondence field between two objects, where the characteristics of the field bear close resemblance to those in the learning set. We introduce a new local shape measure we call the "observed transport measure", whose properties make it particularly amenable to the matching problem. From the values of our measure obtained at every point of the objects to be matched, we compute a distance matrix which embeds the correspondence problem in a highly expressive and redundant construct and facilitates its manipulation. We present two learning strategies that rely on the distance matrix and discuss their applications to the matching of a variety of 1D, 2D and 3D objects, including the corpus callosum and ventricular surfaces.
Spherical Demons: Fast Diffeomorphic LandmarkFree Surface Registration
 IEEE TRANSACTIONS ON MEDICAL IMAGING. 29(3):650–668, 2010
, 2010
"... We present the Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large class of regularizors for the modified Demons objective function can be efficiently approximated on the sphere using iterative smoothing. B ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
We present the Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large class of regularizors for the modified Demons objective function can be efficiently approximated on the sphere using iterative smoothing. Based on one parameter subgroups of diffeomorphisms, the resulting registration is diffeomorphic and fast. The Spherical Demons algorithm can also be modified to register a given spherical image to a probabilistic atlas. We demonstrate two variants of the algorithm corresponding to warping the atlas or warping the subject. Registration of a cortical surface mesh to an atlas mesh, both with more than 160k nodes requires less than 5 minutes when warping the atlas and less than 3 minutes when warping the subject on a Xeon 3.2GHz single processor machine. This is comparable to the fastest nondiffeomorphic landmarkfree surface registration algorithms. Furthermore, the accuracy of our method compares favorably to the popular FreeSurfer registration algorithm. We validate the technique in two different applications that use registration to transfer segmentation labels onto a new image: (1) parcellation of invivo cortical surfaces and (2) Brodmann area localization in exvivo cortical surfaces.
P.: A Generative Model for Image Segmentation Based on Label Fusion
 IEEE Transactions in Medical Imaging
, 2010
"... Abstract—We propose a nonparametric, probabilistic model for the automatic segmentation of medical images, given a training set of images and corresponding label maps. The resulting inference algorithms rely on pairwise registrations between the test image and individual training images. The trainin ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
(Show Context)
Abstract—We propose a nonparametric, probabilistic model for the automatic segmentation of medical images, given a training set of images and corresponding label maps. The resulting inference algorithms rely on pairwise registrations between the test image and individual training images. The training labels are then transferred to the test image and fused to compute the final segmentation of the test subject. Such label fusion methods have been shown to yield accurate segmentation, since the use of multiple registrations captures greater intersubject anatomical variability and improves robustness against occasional registration failures. To the best of our knowledge, this manuscript presents the first comprehensive probabilistic framework that rigorously motivates label fusion as a segmentation approach. The proposed framework allows us to compare different label fusion algorithms theoretically and practically. In particular, recent label fusion or multiatlas segmentation
DTREFinD: Diffusion Tensor Registration with Exact FiniteStrain Differential
 IEEE Transactions on Medical Imaging, In
, 2009
"... Abstract—In this paper, we propose the DTREFinD algorithm for the diffeomorphic nonlinear registration of diffusion tensor images. Unlike scalar images, deforming tensor images requires choosing both a reorientation strategy and an interpolation scheme. Current diffusion tensor registration algorit ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
(Show Context)
Abstract—In this paper, we propose the DTREFinD algorithm for the diffeomorphic nonlinear registration of diffusion tensor images. Unlike scalar images, deforming tensor images requires choosing both a reorientation strategy and an interpolation scheme. Current diffusion tensor registration algorithms that use full tensor information face difficulties in computing the differential of the tensor reorientation strategy and consequently, these methods often approximate the gradient of the objective function. In the case of the finitestrain (FS) reorientation strategy, we borrow results from the pose estimation literature in computer vision to derive an analytical gradient of the registration objective function. By utilizing the closedform gradient and the velocity field representation of one parameter subgroups of diffeomorphisms, the resulting registration algorithm is diffeomorphic and fast. We contrast the algorithm with a traditional FS alternative