Riemannian Graph Diffusion for DT-MRI Regularization
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.
KeywordsRiemannian Manifold Heat Kernel Edge Weight Geodesic Distance Medical Image Analysis
- 1.Chefd’Hotel, C., Tschumperle, D., Deriche, R., Faugeras, O.: Constrained Flows of Matrix-Valued Functions: Application to Diffusion Tensor Regularization. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol. 2350, pp. 251–265. Springer, Heidelberg (2002)CrossRefGoogle Scholar
- 4.Tschumperle, D., Deriche, R.: Diffusion tensor regularization with constraints preservation. In: Proc. of CVPR, pp. 948–953 (2001)Google Scholar
- 7.Kondor, R., Lafferty, J.: Diffusion kernels on graphs and other discrete structures. In: Proc. of ICML (2002)Google Scholar