Multi-class DTI Segmentation: A Convex Approach.

In this paper, we propose a novel variational framework for multi-class DTI segmentation based on global convex optimization. The existing variational approaches to the DTI segmentation problem have mainly used gradient-descent type optimization techniques which are slow in convergence and sensitive to the initialization. This paper on the other hand provides a new perspective on the often difficult optimization problem in DTI segmentation by providing a reasonably tight convex approximation (relaxation) of the original problem, and the relaxed convex problem can then be efficiently solved using various methods such as primal-dual type algorithms. To the best of our knowledge, such a DTI segmentation technique has never been reported in literature. We also show that a variety of tensor metrics (similarity measures) can be easily incorporated in the proposed framework. Experimental results on both synthetic and real diffusion tensor images clearly demonstrate the advantages of our method in terms of segmentation accuracy and robustness. In particular, when compared with existing state-of-the-art methods, our results demonstrate convincingly the importance as well as the benefit of using more refined and elaborated optimization method in diffusion tensor MR image segmentation.

[1]  René Vidal,et al.  Segmenting Fiber Bundles in Diffusion Tensor Images , 2008, ECCV.

[2]  Zhizhou Wang,et al.  Tensor Field Segmentation Using Region Based Active Contour Model , 2004, ECCV.

[3]  Antonin Chambolle,et al.  A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging , 2011, Journal of Mathematical Imaging and Vision.

[4]  P. Thomas Fletcher,et al.  Riemannian geometry for the statistical analysis of diffusion tensor data , 2007, Signal Process..

[5]  Xavier Pennec,et al.  A Riemannian Framework for Tensor Computing , 2005, International Journal of Computer Vision.

[6]  Bengt Jönsson,et al.  Restricted Diffusion in Cylindrical Geometry , 1995 .

[7]  R. Dykstra,et al.  A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces , 1986 .

[8]  Daniel Cremers,et al.  A convex relaxation approach for computing minimal partitions , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[9]  Zhizhou Wang,et al.  DTI segmentation using an information theoretic tensor dissimilarity measure , 2005, IEEE Transactions on Medical Imaging.

[10]  Carl-Fredrik Westin,et al.  Segmentation of Thalamic Nuclei from DTI Using Spectral Clustering , 2006, MICCAI.

[11]  Jan-Michael Frahm,et al.  Fast Global Labeling for Real-Time Stereo Using Multiple Plane Sweeps , 2008, VMV.

[12]  Daniel Cremers,et al.  A Convex Approach to Minimal Partitions , 2012, SIAM J. Imaging Sci..

[13]  Rachid Deriche,et al.  DTI segmentation by statistical surface evolution , 2006, IEEE Transactions on Medical Imaging.

[14]  Frank Nielsen,et al.  This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. 1 Total Bregman Divergence and its Applications to DTI Analysis , 2022 .

[15]  Mila Nikolova,et al.  Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models , 2006, SIAM J. Appl. Math..

[16]  Tony F. Chan,et al.  Active contours without edges , 2001, IEEE Trans. Image Process..

[17]  Ghassan Hamarneh,et al.  DT-MRI segmentation using graph cuts , 2007, SPIE Medical Imaging.

[18]  P. Basser,et al.  Estimation of the effective self-diffusion tensor from the NMR spin echo. , 1994, Journal of magnetic resonance. Series B.