Tree-Based Codification in Neural Architecture Search for Medical Image Segmentation

计算机科学 卷积神经网络 人工智能 树(集合论) 图像分割 分割 遗传程序设计 人工神经网络 进化算法 模式识别(心理学) 数学 数学分析
作者
José-Antonio Fuentes-Tomás,Efrén Mezura‐Montes,Héctor‐Gabriel Acosta‐Mesa,Aldo Márquez-Grajales
出处
期刊:IEEE Transactions on Evolutionary Computation [Institute of Electrical and Electronics Engineers]
卷期号:28 (3): 597-607 被引量:9
标识
DOI:10.1109/tevc.2024.3353182
摘要

Convolutional neural networks (CNNs) have shown a competitive performance in medical imaging applications, such as image segmentation. However, choosing an existing architecture capable of adapting to a specific dataset is challenging and requires design expertise. Neural architecture search (NAS) is employed to overcome these limitations. NAS uses techniques to design the Neural Networks architecture. Typically, the models' weights optimization is carried out using a continuous loss function, unlike model topology optimization, which is highly influenced by the specific problem. Genetic programming (GP) is an evolutionary algorithm (EA) capable of adapting to the topology optimization problem of CNNs by considering the attributes of its representation. A tree representation can express complex connectivity and apply variation operations. This article presents a tree-based GP algorithm for evolving CNNs based on the well-known U-Net architecture producing compact and flexible models for medical image segmentation across multiple domains. This proposal is called NAS / GP / U-Net (NASGP-Net). NASGP-Net uses a cell-based encoding and U-Net architecture as a backbone to construct CNNs based on a hierarchical arrangement of primitive operations. Our experiments indicate that our approach can produce remarkable segmentation results with fewer parameters regarding fixed architectures. Moreover, NASGP-Net presents competitive results against NAS methods. Finally, we observed notable performance improvements based on several evaluation metrics, including dice similarity coefficient (DSC), intersection over union (IoU), and Hausdorff distance (HD).
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
WZJ发布了新的文献求助10
1秒前
朴素凝冬完成签到 ,获得积分10
1秒前
谦让的慕凝完成签到 ,获得积分10
1秒前
zhao完成签到,获得积分10
1秒前
2秒前
2秒前
蒸蒸日上完成签到,获得积分10
2秒前
研友_VZG7GZ应助wwe采纳,获得10
3秒前
3秒前
雨霖铃应助lilili采纳,获得10
3秒前
123完成签到,获得积分10
4秒前
迅速语蕊发布了新的文献求助10
4秒前
睡不醒的耀应助陆小成采纳,获得10
5秒前
白昼完成签到,获得积分10
5秒前
123应助惠JUI采纳,获得10
5秒前
小蘑菇应助jie采纳,获得10
5秒前
鱼乐乐完成签到,获得积分10
6秒前
123发布了新的文献求助10
6秒前
7秒前
茗白发布了新的文献求助10
8秒前
8秒前
郭氧化氢完成签到,获得积分10
9秒前
aloha01完成签到,获得积分10
9秒前
JL完成签到,获得积分10
9秒前
小羊完成签到 ,获得积分10
9秒前
天天快乐应助科研通管家采纳,获得10
11秒前
李爱国应助科研通管家采纳,获得10
11秒前
bkagyin应助科研通管家采纳,获得10
11秒前
小马甲应助科研通管家采纳,获得10
11秒前
Jasper应助科研通管家采纳,获得10
11秒前
Akim应助科研通管家采纳,获得10
11秒前
汉堡包应助科研通管家采纳,获得10
11秒前
独闯江湖应助科研通管家采纳,获得10
11秒前
独闯江湖应助科研通管家采纳,获得10
12秒前
慕青应助科研通管家采纳,获得10
12秒前
小蘑菇应助科研通管家采纳,获得30
12秒前
12秒前
英俊的铭应助科研通管家采纳,获得20
12秒前
正好是我应助科研通管家采纳,获得20
12秒前
12秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Developing Genetic Editing Tools for Lysobacter 2000
卤化钙钛矿人工突触的研究 2000
Моделирование процессов самоорганизации в кристаллообразующих системах 1000
History of U.S. Space Surveillance and Satellite Cataloging 1000
Malcolm Fraser : a biography 700
Handbook of Optical Systems,Volume 6:Advanced Physical Optics 666
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6512913
求助须知:如何正确求助?哪些是违规求助? 8306408
关于积分的说明 17746268
捐赠科研通 5615097
什么是DOI,文献DOI怎么找? 2923940
邀请新用户注册赠送积分活动 1901150
关于科研通互助平台的介绍 1762850