Fast Tensor Image Morphing for Elastic Registration

Authors:
Pew-Thian Yap;Guorong Wu;Hongtu Zhu;Weili Lin;Dinggang Shen
Affiliations:
Department of Radiology, and BRIC, University of North Carolina at Chapel Hill;Department of Radiology, and BRIC, University of North Carolina at Chapel Hill;Department of Biostatistics, and BRIC, University of North Carolina at Chapel Hill;Department of Radiology, and BRIC, University of North Carolina at Chapel Hill;Department of Radiology, and BRIC, University of North Carolina at Chapel Hill
Venue:
MICCAI '09 Proceedings of the 12th International Conference on Medical Image Computing and Computer-Assisted Intervention: Part I
Year:
2009

Citing 3
Cited 2

Principal Warps: Thin-Plate Splines and the Decomposition of Deformations

IEEE Transactions on Pattern Analysis and Machine Intelligence
A new point matching algorithm for non-rigid registration

Computer Vision and Image Understanding - Special issue on nonrigid image registration
Diffusion Tensor Image Registration Using Tensor Geometry and Orientation Features

MICCAI '08 Proceedings of the 11th International Conference on Medical Image Computing and Computer-Assisted Intervention, Part II

Accurate identification of MCI patients via enriched white-matter connectivity network

MLMI'10 Proceedings of the First international conference on Machine learning in medical imaging
Hierachical spherical harmonics based deformable HARDI registration

MIAR'10 Proceedings of the 5th international conference on Medical imaging and augmented reality

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a novel algorithm, called Fast Tensor Image Morphing for Elastic Registration or F-TIMER. F-TIMER leverages multiscale tensor regional distributions and local boundaries for hierarchically driving deformable matching of tensor image volumes. Registration is achieved by aligning a set of automatically determined structural landmarks, via solving a soft correspondence problem. Based on the estimated correspondences, thin-plate splines are employed to generate a smooth, topology preserving, and dense transformation, and to avoid arbitrary mapping of non-landmark voxels. To mitigate the problem of local minima, which is common in the estimation of high dimensional transformations, we employ a hierarchical strategy where a small subset of voxels with more distinctive attribute vectors are first deployed as landmarks to estimate a relatively robust low-degrees-of-freedom transformation. As the registration progresses, an increasing number of voxels are permitted to participate in refining the correspondence matching. A scheme as such allows less conservative progression of the correspondence matching towards the optimal solution, and hence results in a faster matching speed. Results indicate that better accuracy can be achieved by F-TIMER, compared with other deformable registration algorithms [1, 2], with significantly reduced computation time cost of 4---14 folds.