Efficient recursive algorithms for computing the mean diffusion tensor and applications to DTI segmentation

Authors:
Guang Cheng;Hesamoddin Salehian;Baba C. Vemuri
Affiliations:
Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL;Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL;Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL
Venue:
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VII
Year:
2012

Citing 8
Cited 0

Shape Modeling with Front Propagation: A Level Set Approach

IEEE Transactions on Pattern Analysis and Machine Intelligence
Geodesic Active Contours

International Journal of Computer Vision
A Riemannian Framework for Tensor Computing

International Journal of Computer Vision
Segmenting Fiber Bundles in Diffusion Tensor Images

ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part III
A unified framework for estimating diffusion tensors of any order with symmetric positive-definite constraints

ISBI'10 Proceedings of the 2010 IEEE international conference on Biomedical imaging: from nano to Macro
Segmentation of thalamic nuclei from DTI using spectral clustering

MICCAI'06 Proceedings of the 9th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part II
Active contours without edges

IEEE Transactions on Image Processing
Curve evolution implementation of the Mumford-Shah functional for image segmentation, denoising, interpolation, and magnification

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.