The segmentation of the CT image based on k clustering and graph-cut
暂无分享,去创建一个
Ken Cai | Rongqian Yang | Xiaoming Wu | Yuke Chen | Shan-xin Ou | Hai Chen | Yuke Chen | Xiaoming Wu | Ken Cai | Rongqian Yang | Shanxing Ou | Hai Chen
[1] A. Engel,et al. Feasibility of automatic assessment of four-chamber cardiac function with MDCT: Initial clinical application and validation. , 2010, European journal of radiology.
[2] Richard J. Anderson,et al. A Parallel Implementation of the Push-Relabel Algorithm for the Maximum Flow Problem , 1995, J. Parallel Distributed Comput..
[3] Vladimir Kolmogorov,et al. Minimizing Nonsubmodular Functions with Graph Cuts-A Review , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[4] Peter J Hunter,et al. Modeling total heart function. , 2003, Annual review of biomedical engineering.
[5] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .
[6] Horst Bischof,et al. Liver Segmentation in CT Data: A Segmentation Refinement Approach , 2007 .
[7] Olivier Ecabert,et al. Modeling shape variability for full heart segmentation in cardiac computed-tomography images , 2006, SPIE Medical Imaging.
[8] Theo van Walsum,et al. Coronary Lumen Segmentation Using Graph Cuts and Robust Kernel Regression , 2009, IPMI.
[9] O. Ecabert,et al. Feature optimization via simulated search for model-based heart segmentation , 2005 .
[10] Konstantin Nikolaou,et al. Dual-source CT cardiac imaging: initial experience , 2006, European Radiology.
[11] Dorin Comaniciu,et al. Four-chamber heart modeling and automatic segmentation for 3D cardiac CT volumes , 2008, SPIE Medical Imaging.
[12] Vladimir Kolmogorov,et al. An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[13] Alejandro F Frangi,et al. Active shape models with invariant optimal features (IOF-ASM) application to cardiac MRI segmentation , 2003, Computers in Cardiology, 2003.
[14] L. Udawatta,et al. Identification of moving obstacles with Pyramidal Lucas Kanade optical flow and k means clustering , 2007, 2007 Third International Conference on Information and Automation for Sustainability.
[15] D. Greig,et al. Exact Maximum A Posteriori Estimation for Binary Images , 1989 .