Riemannian graph diffusion for DT-MRI regularization

5Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new method for diffusion tensor MRI (DT-MRI) regularization is presented that relies on graph diffusion. We represent a DT image using a weighted graph, where the weights of edges are functions of the geodesic distances between tensors. Diffusion across this graph with time is captured by the heat-equation, and the solution, i.e. the heat kernel, is found by exponentiating the Laplacian eigen-system with time. Tensor regularization is accomplished by computing the Riemannian weighted mean using the heat kernel as its weights. The method can efficiently remove noise, while preserving the fine details of images. Experiments on synthetic and real-world datasets illustrate the effectiveness of the method. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Zhang, F., & Hancock, E. R. (2006). Riemannian graph diffusion for DT-MRI regularization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4191 LNCS-II, pp. 234–242). Springer Verlag. https://doi.org/10.1007/11866763_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free