Automatic Segmentation and Ventricular Border Detection of 2D Echocardiographic Images Combining K-Means Clustering and Active Contour Model

S. Nandagopalan, B. Adiga, C. Dhanalakshmi, N. Deepak
{"title":"Automatic Segmentation and Ventricular Border Detection of 2D Echocardiographic Images Combining K-Means Clustering and Active Contour Model","authors":"S. Nandagopalan, B. Adiga, C. Dhanalakshmi, N. Deepak","doi":"10.1109/ICCNT.2010.110","DOIUrl":null,"url":null,"abstract":"Accurate analysis of 2D echocardiographic images is vital for diagnosis and treatment of heart related diseases. For this task, extraction of cardiac borders must be carried out. In particular, automatic quantitative measurements of Left Ventricle (LV), Right Ventricle (RV), Left Atrium (LA), Right Atrium, Valve size, etc. are essential. We believe that automatic processing of these echo images could speed up the clinical decisions and reduce human error. In this paper we focus on automatic segmentation of echocardiographic images of different views (Long Axis View, Short Axis View, Apical 4-chamber View) to extract ventricle and atrium borders for detecting heart abnormalities. A novel approach of combining the K-Means clustering algorithm for segmentation and active contour model for boundary detection is proposed. Since conventional K-Means implementation is not time efficient, we propose a novel algorithm called fast K-Means SQL based on (i) TRUNCATE-INSERT instead of DELETE-INSERT for table updates (ii) denormalized database design and tuning (iii) minimal table joins, to accelerate the image segmentation. Thus, with this approach an image of resolution 400×250 takes just 16 seconds, whereas the conventional method takes 950 seconds. After the operator selects the initial contour in the appropriate part of the echocardiographic image, the deformable contour (snake) converges to the boundaries of the region of interest (ROI). Once the shape of the ventricle or atrium is extracted, we apply coordinate geometry to compute all the necessary parameters required for clinical decision. Normally, ultrasound images are embedded with speckle noise; hence we first apply median filter and then the image segmentation. Experiments are conducted using relatively large set of images obtained from a cardiology hospital. The results show that our proposed method is computationally efficient and 2D measurements are accurate.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Computer and Network Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNT.2010.110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

Abstract

Accurate analysis of 2D echocardiographic images is vital for diagnosis and treatment of heart related diseases. For this task, extraction of cardiac borders must be carried out. In particular, automatic quantitative measurements of Left Ventricle (LV), Right Ventricle (RV), Left Atrium (LA), Right Atrium, Valve size, etc. are essential. We believe that automatic processing of these echo images could speed up the clinical decisions and reduce human error. In this paper we focus on automatic segmentation of echocardiographic images of different views (Long Axis View, Short Axis View, Apical 4-chamber View) to extract ventricle and atrium borders for detecting heart abnormalities. A novel approach of combining the K-Means clustering algorithm for segmentation and active contour model for boundary detection is proposed. Since conventional K-Means implementation is not time efficient, we propose a novel algorithm called fast K-Means SQL based on (i) TRUNCATE-INSERT instead of DELETE-INSERT for table updates (ii) denormalized database design and tuning (iii) minimal table joins, to accelerate the image segmentation. Thus, with this approach an image of resolution 400×250 takes just 16 seconds, whereas the conventional method takes 950 seconds. After the operator selects the initial contour in the appropriate part of the echocardiographic image, the deformable contour (snake) converges to the boundaries of the region of interest (ROI). Once the shape of the ventricle or atrium is extracted, we apply coordinate geometry to compute all the necessary parameters required for clinical decision. Normally, ultrasound images are embedded with speckle noise; hence we first apply median filter and then the image segmentation. Experiments are conducted using relatively large set of images obtained from a cardiology hospital. The results show that our proposed method is computationally efficient and 2D measurements are accurate.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
结合k均值聚类和活动轮廓模型的二维超声心动图图像自动分割与心室边界检测
准确分析二维超声心动图图像对心脏相关疾病的诊断和治疗至关重要。为了完成这项任务,必须进行心脏边界的提取。特别是左心室(LV)、右心室(RV)、左心房(LA)、右心房、瓣膜大小等的自动定量测量是必不可少的。我们相信这些回声图像的自动处理可以加快临床决策,减少人为错误。本文主要对超声心动图不同视点(长轴视点、短轴视点、尖室视点)图像进行自动分割,提取心室和心房边界,用于检测心脏异常。提出了一种结合k均值聚类分割算法和活动轮廓模型进行边界检测的新方法。由于传统的K-Means实现不具有时间效率,我们提出了一种新的算法,称为快速K-Means SQL,该算法基于(i)表更新的TRUNCATE-INSERT而不是DELETE-INSERT; (ii)非规范化数据库设计和调优;(iii)最小表连接,以加速图像分割。因此,使用这种方法,分辨率为400×250的图像只需16秒,而传统方法需要950秒。在超声心动图图像的适当位置选择初始轮廓后,可变形轮廓(蛇形)收敛到感兴趣区域(ROI)的边界。一旦心室或心房的形状被提取出来,我们应用坐标几何来计算临床决策所需的所有必要参数。通常,超声图像中会嵌入斑点噪声;因此,我们首先应用中值滤波,然后进行图像分割。实验使用从心脏病医院获得的相对较大的图像集进行。结果表明,该方法计算效率高,测量精度高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic Multiple Pattern Detection Algorithm On Energy Decay of Global Solutions for a Petrovsky System with Damping Term and Source Term Development of Semantic Based Information Retrieval Using Word-Net Approach Ontology Description of Jade Computational Agents in OWL-DL Stock Exchange of Thailand Index Prediction Using Back Propagation Neural Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1