Efficient Recursive Algorithms for Computing the Mean Diffusion Tensor and Applications to DTI Segmentation
Computation of the mean of a collection of symmetric positive definite (SPD) matrices is a fundamental ingredient of many algorithms in diffusion tensor image (DTI) processing. For instance, in DTI segmentation, clustering, etc. In this paper, we present novel recursive algorithms for computing the mean of a set of diffusion tensors using several distance/divergence measures commonly used in DTI segmentation and clustering such as the Riemannian distance and symmetrized Kullback-Leibler divergence. To the best of our knowledge, to date, there are no recursive algorithms for computing the mean using these measures in literature. Recursive algorithms lead to a gain in computation time of several orders in magnitude over existing non-recursive algorithms. The key contributions of this paper are: (i) we present novel theoretical results on a recursive estimator for Karcher expectation in the space of SPD matrices, which in effect is a proof of the law of large numbers (with some restrictions) for the manifold of SPD matrices. (ii) We also present a recursive version of the symmetrized KL-divergence for computing the mean of a collection of SPD matrices. (iii) We present comparative timing results for computing the mean of a group of SPD matrices (diffusion tensors) depicting the gains in compute time using the proposed recursive algorithms over existing non-recursive counter parts. Finally, we also show results on gains in compute times obtained by applying these recursive algorithms to the task of DTI segmentation.
KeywordsSegmentation Result Active Contour Structure Tensor Recursive Algorithm Recursive Estimator
Unable to display preview. Download preview PDF.
- 4.Feddern, C., Weickert, J., Burgeth, B.: Level-set Methods for Tensor-valued Images. In: Proc. 2nd IEEE Workshop on Variational, Geometric and Level Set Methods in Comp. Vis., pp. 65–72 (2003)Google Scholar
- 10.Moakher, M., Batchelor, P.G.: Symmetric Positive-Definite Matrices: From Geometry to Applications and Visualization. Visualization and Processing of Tensor Fields. Springer (2006)Google Scholar
- 12.Barmpoutis, A., Vemuri, B.C., Shepherd, T.M., Forder, J.R.: Tensor splines for interpolation and approximation of DT-MRI with applications to segmentation of isolated rat hippocampi. IEEE Trans. Med. Imag. 26 (2007)Google Scholar
- 15.Weldeselassie, Y., Hamarneh, G.: Dt-mri segmentation using graph cuts. In: SPIE Medical Imaging, vol. 6512 (2007)Google Scholar
- 17.Wu, Y., Wang, J., Lu, H.: Real-time visual tracking via incremental covariance model update on log-euclidean riemannian manifold. In: Proc. IEEE Chinese Conference on Pattern Recognition, CCPR (2009)Google Scholar
- 19.Lurie, J.: Lecture notes on the theory of hadamard spaces (metric spaces of nonpositive curvature), http://www.math.harvard.edu/~lurie/papers/hadamard.pdf
- 21.Schwartzman, A.: Random ellipsoids and false discovery rates: Statistics for diffusion tensor imaging data. PhD thesis, Stanford University (2006)Google Scholar
- 23.Barmpoutis, A., Vemuri, B.C.: A unified framework for estimating diffusion tensors of any order with symmetric positive-definite constraints. In: Proceedings of ISBI 2010: IEEE International Symposium on Biomedical Imaging, pp. 1385–1388 (2010)Google Scholar