检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:唐柳 王晓东[1] 陈哲彬 文含 姚宇[1] TANG Liu;WANG Xiaodong;CHENG Zhebin;WEN Han;YAO Yu(Chengdu Institute of Computer Application,Chinese Academy of Sciences,Chengdu Sichuan 610041,China;University of Chinese Academy of Sciences,Beijing 100049,China)
机构地区:[1]中国科学院成都计算机应用研究所,成都610041 [2]中国科学院大学,北京100049
出 处:《计算机应用》2020年第S01期215-219,共5页journal of Computer Applications
基 金:四川省新一代人工智能重大专项(2018GZDZX0036)。
摘 要:针对传统卷积神经网络(CNN)对左心室的分割精度低且在特征提取过程中存在特征冗余的问题,在传统卷积神经网络的基础上提出基于Octave卷积的超声心动图左心室分割方法。首先,使用Octave卷积对图像进行特征提取,将特征图分为高频部分和低频部分,在卷积的过程中减少了低频信息的使用,从而降低了网络模型的计算量;其次,提出了新的损失函数,将交叉熵和Dice系数进行加权结合。实验结果表明,利用该方法在二腔心数据集上测试,其分割结果的平均像素交并比(MIoU)能够达到79.21%,较传统的U-net卷积神经网络精度提升6.1个百分点,在拥有低计算量的同时提高了分割精度。Aiming at the problem that traditional Convolutional Neural Network(CNN)has low segmentation precision of left ventricle and feature redundancy in feature extraction process,based on traditional convolutional neural network,left ventricular echocardiography segmentation method based on octave convolution was proposed. Firstly,octave convolution was used to extract features from the images and divide the feature map into high frequency part and low frequency part,which reduces the use of low frequency information in the process of convolution,thus reducing the computational complexity of the network model. Secondly,a new loss function was proposed,which combined the cross entropy and the Dice coefficient. The experimental results show that the Mean Intersection of Union(MIoU)of the segmentation result can reach79. 21% by using this method on the two-cavity dataset,which is 6. 1 percentage points higher than that of the traditional U-net convolutional neural network. The proposed method has high segmentation accuracy and low computational complexity.
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147