期刊文献+

基于核图割算法的冠脉光学相干断层图像斑块区域分割 被引量:6

Plaque region segmentation of intracoronary optical cohenrence tomography images based on kernel graph cuts
原文传递
导出
摘要 冠脉光学相干断层成像(OCT)图像斑块区域分割是冠脉斑块识别的前提和基础,对后续斑块特征分析及易损斑块识别,进而实现冠脉疾病的辅助诊断分析具有十分重要的意义。本文提出了一种新的算法,使用K-means算法与图割算法结合,实现了冠脉OCT图像斑块准确的多区域分割——纤维化斑块、钙化斑块和脂质池,并较好地保留了斑块的边界特征信息。本文实验中对20组具有典型斑块特征的冠脉OCT图像进行了分割,通过与医生手动分割结果比较,证明本文方法能准确地分割出斑块区域,且算法具有较好的稳定性。研究结果证明了本文工作能够极大减少医生分割斑块所消耗的时间,避免不同医生之间的主观差异性,或可辅助临床医生对冠心病的诊断与治疗。 The segmentation of the intracoronary optical coherence tomography (OCT) images is the basis of theplaque recognition, and it is important to the following plaque feature analysis, vulnerable plaque recognition and further coronary disease aided diagnosis. This paper proposes an algorithm about multi region plaque segmentation based on kernel graph cuts model that realizes accurate segmentation of fibrous, calcium and lipid pool plaques in coronary OCT image, while boundary information has been well reserved. We segmented 20 coronary images with typical plaques in our experiment, and compared the plaque regions segmented by this algorithm to the plaque regions obtained by doctor's manual segmentation. The results showed that our algorithm is accurate to segment the plaque regions. This work has demonstrated that it can be used for reducing doctors' working time on segmenting plaque significantly, reduce sub)ectivity and differences between different doctors, assist clinician's diagnosis and treatment of coronary artery disease.
作者 张勃 杨建利 王光磊 王洪瑞 刘秀玲 韩业晨 ZHANG Bo YANG Jianli WANG Guanglei WANG Hongrui LIU Xiuling HAN Yechen(College of Eletronic and Information Engineering, Hebei University, Baoding, Hebei 071002, P.R.China Department of Cardiology, Chinese Academy of Medical Sciences & Peking Union Medical College Hospital, Beijing 100730, P.R.China)
出处 《生物医学工程学杂志》 EI CAS CSCD 北大核心 2017年第1期15-20,共6页 Journal of Biomedical Engineering
基金 国家自然科学基金资助项目(61473112) 河北省杰出青年科学基金资助项目(F2016201186)
关键词 斑块区域分割 冠脉光学相干断层成像图像 图割算法 plaque region segmentation intracoronary optical coherence tomography image graph cuts
  • 相关文献

参考文献3

二级参考文献37

  • 1Anil K J. Data clustering:50 years beyond K-Means[J].Pattern Recognition Letters,2010,(08):651-666.
  • 2Likas A,Vlassis M,Verbeek J. The global K-means clustering algorithm[J].Pattern Recognition,2003,(02):451-461.doi:10.1016/S0031-3203(02)00060-2.
  • 3Selim S Z,Al-Sultan K S. Analysis of global K-means,an incremental heuristic for minimum sum-of-squares clustering[J].Journal of Classification,2005,(22):287-310.
  • 4Bellman R,Dreyfus S. Applied dynamic programming[M].Princeton,New Jersey:Princeton University Press,1962.
  • 5Aloise D,Deshpande A,Hansen P. NP-hardness of euclidean sum-of-squares clustering[J].Machine Learning,2009,(02):245-248.
  • 6Mahajan M,Nimbor P,Varadarajan K. The planar K-means problem is NP-hard[J].Lecture Notes in Computer Science,2009,(5431):274-285.
  • 7Ball G,Hall D. ISODATA,a novel method of data analysis and pattern classification[Technical rept. NTIS AD 699616. ][M].California:Stanford Research Institute,1965.
  • 8WANG Cheng,LI Jiao-jiao,BAI Jun-qing. Max-Min K- means Clustering Algorithm and Application in Post-processing of Scientific Computing[A].Napoli,2011.7-9.
  • 9Pena J M,Lozano J A,Larranaga P. An empirical comparison of four initialization methods for the K-means algorithm[J].Pattern Recognition Letters,1999,(20):1027-1040.doi:10.1016/S0167-8655(99)00069-0.
  • 10Lai J Z C,Tsung-Jen H. Fast global K-means clustering using cluster membership and inequality[J].Pattern Recogni- tion,2010,(43):1954-1963.

共引文献307

同被引文献27

引证文献6

二级引证文献27

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部