Results 1 - 10
of
103
Deformable medical image registration: A survey
- IEEE TRANSACTIONS ON MEDICAL IMAGING
, 2013
"... Deformable image registration is a fundamental task in medical image processing. Among its most important applications, one may cite: i) multi-modality fusion, where information acquired by different imaging devices or protocols is fused to facilitate diagnosis and treatment planning; ii) longitudin ..."
Abstract
-
Cited by 34 (1 self)
- Add to MetaCart
(Show Context)
Deformable image registration is a fundamental task in medical image processing. Among its most important applications, one may cite: i) multi-modality fusion, where information acquired by different imaging devices or protocols is fused to facilitate diagnosis and treatment planning; ii) longitudinal studies, where temporal structural or anatomical changes are investigated; and iii) 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.
DT-REFinD: Diffusion Tensor Registration with Exact Finite-Strain Differential
- IEEE Transactions on Medical Imaging, In
, 2009
"... Abstract—In this paper, we propose the DT-REFinD 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 25 (9 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper, we propose the DT-REFinD 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 finite-strain (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 closed-form 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
Spherical Demons: Fast Diffeomorphic Landmark-Free 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 24 (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 non-diffeomorphic 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 in-vivo cortical surfaces and (2) Brodmann area localization in ex-vivo cortical surfaces.
ABSORB: Atlas building by self-organized registration and bundling
- NeuroImage
"... A novel groupwise registration framework, called Atlas Building by Self-Organized Registration and Bundling (ABSORB), is proposed in this paper. In this framework, the global structure of relative subject image distribution is preserved during the registration by constraining each subject to deform ..."
Abstract
-
Cited by 22 (13 self)
- Add to MetaCart
(Show Context)
A novel groupwise registration framework, called Atlas Building by Self-Organized Registration and Bundling (ABSORB), is proposed in this paper. In this framework, the global structure of relative subject image distribution is preserved during the registration by constraining each subject to deform locally within the learned manifold. A self-organized registration is employed to deform each subject towards a subset of its neighbors that are closer to the global center. Some subjects close enough in the manifold will be bundled into a subgroup during the registration, and then deformed together in the subsequent registration process. This framework performs groupwise registration in a hierarchical way. Specifically, in the higher level, it will perform on a much smaller dataset formed by the representative subjects of all subgroups generated in the previous levels of registration. The atlas image can be eventually built once the registration arrives at the upmost level. Experimental results on both synthetic and real datasets show that the proposed framework can achieve substantial improvements, compared to the other two widely used groupwise methods, in terms of both registration accuracy and robustness. 1.
Xiaoyong, A Review on
- Hybrid Storage, Microcomputer Applications, Vol.29, No.2
"... Epidemiology and prevention of hepatitis B virus infection in China ..."
Abstract
-
Cited by 18 (7 self)
- Add to MetaCart
(Show Context)
Epidemiology and prevention of hepatitis B virus infection in China
A multi-scale kernel bundle for LDDMM: Towards sparse deformation description across space and scales
- IN: IPMI. LNCS
, 2011
"... The Large Deformation Diffeomorphic Metric Mapping framework constitutes a widely used and mathematically well-founded setup for registration in medical imaging. At its heart lies the notion of the regularization kernel, and the choice of kernel greatly affects the results of registrations. This pap ..."
Abstract
-
Cited by 15 (7 self)
- Add to MetaCart
(Show Context)
The Large Deformation Diffeomorphic Metric Mapping framework constitutes a widely used and mathematically well-founded setup for registration in medical imaging. At its heart lies the notion of the regularization kernel, and the choice of kernel greatly affects the results of registrations. This paper presents an extension of the LDDMM framework allowing multiple kernels at multiple scales to be incorporated in each registration while preserving many of the mathematical properties of standard LDDMM. On a dataset of landmarks from lung CT images, we show by example the influence of the kernel size in standard LDDMM, and we demonstrate how our framework, LDDKBM, automatically incorporates the advantages of each scale to reach the same accuracy as the standard method optimally tuned with respect to scale. The framework, which is not limited to landmark data, thus removes the need for classical scale selection. Moreover, by decoupling the momentum across scales, it promises to provide better interpolation properties, to allow sparse descriptions of the total deformation, to remove the trade-off between match quality and regularity, and to allow for momentum based statistics using scale information.
Image Similarity and Tissue Overlaps as Surrogates for Image Registration Accuracy: Widely Used but Unreliable
"... Abstract—The accuracy of nonrigid image registrations is commonly approximated using surrogate measures such as tissue label overlap scores, image similarity, image difference, or transformation inverse consistency error. This paper provides experimental evidence that these measures, even when used ..."
Abstract
-
Cited by 12 (0 self)
- Add to MetaCart
(Show Context)
Abstract—The accuracy of nonrigid image registrations is commonly approximated using surrogate measures such as tissue label overlap scores, image similarity, image difference, or transformation inverse consistency error. This paper provides experimental evidence that these measures, even when used in combination, cannot distinguish accurate from inaccurate registrations. To this end, we introduce a “registration ” algorithm that generates highly inaccurate image transformations, yet performs extremely well in terms of the surrogate measures. Of the tested criteria, only overlap scores of localized anatomical regions reliably distinguish reasonable from inaccurate registrations, whereas image similarity and tissue overlap do not. We conclude that tissue overlap and image similarity, whether used alone or together, do not provide valid evidence for accurate registrations and should thus not be reported or accepted as such. Index Terms—Nonrigid image registration, registration accuracy, unreliable surrogates, validation. I.
M.: Capturing the Multiscale Anatomical Shape Variability with Polyaffine Transformation Trees
- Med. Image Anal. (2012), http: //dx.doi.org/10.1016/j.media.2012.05.011
"... HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract
-
Cited by 9 (7 self)
- Add to MetaCart
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Robust Atlas-Based Segmentation of Highly Variable Anatomy: Left Atrium Segmentation
"... Abstract. Automatic segmentation of the heart’s left atrium offers great benefits for planning and outcome evaluation of atrial ablation procedures. However, the high anatomical variability of the left atrium presents significant challenges for atlas-guided segmentation. In this paper, we demonstrat ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
(Show Context)
Abstract. Automatic segmentation of the heart’s left atrium offers great benefits for planning and outcome evaluation of atrial ablation procedures. However, the high anatomical variability of the left atrium presents significant challenges for atlas-guided segmentation. In this paper, we demonstrate an automatic method for left atrium segmentation using weighted voting label fusion and a variant of the demons registration algorithm adapted to handle images with different intensity distributions. We achieve accurate automatic segmentation that is robust to the high anatomical variations in the shape of the left atrium in a clinical dataset of MRA images. Key words: Atlas-based segmentation, left atrium segmentation, cardiac segmentation, label fusion, non-rigid registration. 1
