Diffusion tensor magnetic resonance imaging (DT-MRI or DTI) is an imaging modality that is gaining importance in clinical applications. However, in a clinical environment, data have to be acquired rapidly, often at the expense of the image quality. This often results in DTI datasets that are not suitable for complex postprocessing like fiber tracking. We propose a new variational framework to improve the estimation of DT-MRI in this clinical context. Most of the existing estimation methods rely on a log-Gaussian noise (Gaussian noise on the image logarithms), or a Gaussian noise, that do not reflect the Rician nature of the noise in MR images with a low signal-to-noise ratio (SNR). With these methods, the Rician noise induces a shrinking effect: the tensor volume is underestimated when other noise models are used for the estimation. In this paper, we propose a maximum likelihood strategy that fully exploits the assumption of a Rician noise. To further reduce the influence of the noise, we optimally exploit the spatial correlation by coupling the estimation with an anisotropic prior previously proposed on the spatial regularity of the tensor field itself, which results in a maximum a posteriori estimation. Optimizing such a nonlinear criterion requires adapted tools for tensor computing. We show that Riemannian metrics for tensors, and more specifically the log-Euclidean metrics, are a good candidate and that this criterion can be efficiently optimized. Experiments on synthetic data show that our method correctly handles the shrinking effect even with very low SNR, and that the positive definiteness of tensors is always ensured. Results on real clinical data demonstrate the truthfulness of the proposed approach and show promising improvements of fiber tracking in the brain and the spinal cord.

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 that ignores the reorientation in the gradient computation. We show that the exact gradient leads to significantly better registration at the cost of computation time. Independently of the choice of Euclidean or Log-Euclidean interpolation and sum of squared differences dissimilarity measure, the exact gradient achieves better alignment over an entire spectrum of deformation penalties. Alignment quality is assessed with a battery of metrics including tensor overlap, fractional anisotropy, inverse consistency and closeness to synthetic warps. The improvements persist even when a different reorientation scheme, preservation of principal directions, is used to apply the final deformations.