Image based sub-second fast fully automatic complete cardiac cycle left ventricle segmentation in multi frame cardiac MRI images using pixel clustering and labelling

This research presents a fully automatic sub-second fast method for left ventricle (LV) segmentation from clinical cardiac MRI images based on fast continuous max flow graph cuts and connected component labeling. The motivation for LV segmentation is to measure cardiac disease in a patient based on left ventricular function. This novel classification scheme of graph cuts labeling removes the need for manual segmentation and initialization with a seed point, since it automatically accurately extracts the LV in all slices of the full cardiac cycle in multi-frame MRI. This LV segmentation method achieves a sub-second fast computational time of 0.67 seconds on average per frame. The validity of the graph cuts labeling based automatic segmentation technique was verified by comparison with manual segmentation. Medical parameters like End Systolic Volume (ESV), End Diastolic Volume (EDV) and Ejection Fraction (EF) were calculated both automatically and manually and compared for accuracy.

[1]  Xue-Cheng Tai,et al.  A Fast Continuous Max-Flow Approach to Non-convex Multi-labeling Problems , 2011, Efficient Algorithms for Global Optimization Methods in Computer Vision.

[2]  Xue-Cheng Tai,et al.  A study on continuous max-flow and min-cut approaches , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[3]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[4]  Liang Zhong,et al.  Analysis of Left Ventricular Surface Deformation during Isovolumic Contraction , 2007, 2007 29th Annual International Conference of the IEEE Engineering in Medicine and Biology Society.

[5]  Timothy F. Cootes,et al.  Active Appearance Models , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Anupama Bhan Parametric models for segmentation of Cardiac MRI database with geometrical interpretation , 2014, 2014 International Conference on Signal Processing and Integrated Networks (SPIN).

[7]  Timothy F. Cootes,et al.  Active Appearance Models , 1998, ECCV.

[8]  D.M. Mount,et al.  An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Xue-Cheng Tai,et al.  A Continuous Max-Flow Approach to Potts Model , 2010, ECCV.