GCA-Net: Geometrical Constraints-based Advanced Network for Polyp Segmentation

Q. Nguyen, Thi-Thao Tran, Van-Truong Pham
{"title":"GCA-Net: Geometrical Constraints-based Advanced Network for Polyp Segmentation","authors":"Q. Nguyen, Thi-Thao Tran, Van-Truong Pham","doi":"10.1109/NICS56915.2022.10013367","DOIUrl":null,"url":null,"abstract":"Colonoscopy is a common procedure for detecting and screening colorectal polyps, however, it poses a number of challenges because of the properties of images and the features of polyps inside, which can vary in shape, color, condition, and clear non-distinction with the surrounding context. Deep learning-based approaches have recently emerged, which considerably boost polyp segmentation procedures and gradually convert and replace out-of-date methods. Nevertheless, determining an effective measure remains a significant difficulty, which motivates us to propose GCA-Net for polyp segmentation. We first employ EfficientNetV2 as the backbone to extract improved salient features, then pass them via two modules, SE-PASPP and SE-RFB, to capture more contexture before feeding them into a dual-asymmetrical partial decoder to build a final resolution map. Finally, we develop a novel loss function based on the region-based strength of Dice loss and the geometrical constraints-based advantages of Active Contour with Elastica (ACE) loss. The suggested method's preeminence is demonstrated by comparing results to over state-of-the-art approaches in both learning and generalization assessment.","PeriodicalId":381028,"journal":{"name":"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"37 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 9th NAFOSTED Conference on Information and Computer Science (NICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NICS56915.2022.10013367","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Colonoscopy is a common procedure for detecting and screening colorectal polyps, however, it poses a number of challenges because of the properties of images and the features of polyps inside, which can vary in shape, color, condition, and clear non-distinction with the surrounding context. Deep learning-based approaches have recently emerged, which considerably boost polyp segmentation procedures and gradually convert and replace out-of-date methods. Nevertheless, determining an effective measure remains a significant difficulty, which motivates us to propose GCA-Net for polyp segmentation. We first employ EfficientNetV2 as the backbone to extract improved salient features, then pass them via two modules, SE-PASPP and SE-RFB, to capture more contexture before feeding them into a dual-asymmetrical partial decoder to build a final resolution map. Finally, we develop a novel loss function based on the region-based strength of Dice loss and the geometrical constraints-based advantages of Active Contour with Elastica (ACE) loss. The suggested method's preeminence is demonstrated by comparing results to over state-of-the-art approaches in both learning and generalization assessment.
GCA-Net:基于几何约束的高级多边形分割网络
结肠镜检查是一种检测和筛查结肠直肠息肉的常用方法,然而,由于图像的性质和息肉内部的特征,其形状、颜色、状况可能各不相同,并且与周围环境明显无区别,因此结肠镜检查带来了许多挑战。最近出现了基于深度学习的方法,大大提高了息肉分割程序,并逐渐转换和取代过时的方法。然而,确定一个有效的措施仍然是一个很大的困难,这促使我们提出GCA-Net用于息肉分割。我们首先使用effentnetv2作为主干提取改进的显著特征,然后通过SE-PASPP和SE-RFB两个模块传递它们,以捕获更多的上下文,然后将它们馈送到双不对称部分解码器中以构建最终的分辨率图。最后,我们基于Dice损失的区域强度和Active Contour with Elastica (ACE)损失的几何约束优势开发了一种新的损失函数。通过比较学习和泛化评估中最先进的方法的结果,证明了所建议的方法的卓越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信