亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

Privacy-preserving blockchain-based federated learning for brain tumor segmentation

计算机科学 遮罩(插图) 数据共享 块链 人工智能 异步通信 信息隐私 医疗保健 分割 质量(理念) 机器学习 计算机安全 计算机网络 医学 艺术 哲学 替代医学 认识论 病理 经济 视觉艺术 经济增长
作者
Rajesh Kumar,Cobbinah M. Bernard,Aman Ullah,Riaz Ullah Khan,Jay Kumar,Delanyo Kwame Bensah Kulevome,Yunbo Rao,Shaoning Zeng
出处
期刊:Computers in Biology and Medicine [Elsevier BV]
卷期号:177: 108646-108646 被引量:6
标识
DOI:10.1016/j.compbiomed.2024.108646
摘要

Improved data sharing between healthcare providers can lead to a higher probability of accurate diagnosis, more effective treatments, and enhanced capabilities of healthcare organizations. One critical area of focus is brain tumor segmentation, a complex task due to the heterogeneous appearance, irregular shape, and variable location of tumors. Accurate segmentation is essential for proper diagnosis and effective treatment planning, yet current techniques often fall short due to these complexities. However, the sensitive nature of health data often prohibits its sharing. Moreover, the healthcare industry faces significant issues, including preserving the privacy of the model and instilling trust in the model. This paper proposes a framework to address these privacy and trust issues by introducing a mechanism for training the global model using federated learning and sharing the encrypted learned parameters via a permissioned blockchain. The blockchain-federated learning algorithm we designed aggregates gradients in the permissioned blockchain to decentralize the global model, while the introduced masking approach retains the privacy of the model parameters. Unlike traditional raw data sharing, this approach enables hospitals or medical research centers to contribute to a globally learned model, thereby enhancing the performance of the central model for all participating medical entities. As a result, the global model can learn about several specific diseases and benefit each contributor with new disease diagnosis tasks, leading to improved treatment options. The proposed algorithm ensures the quality of model data when aggregating the local model, using an asynchronous federated learning procedure to evaluate the shared model's quality. The experimental results demonstrate the efficacy of the proposed scheme for the critical and challenging task of brain tumor segmentation. Specifically, our method achieved a 1.99% improvement in Dice similarity coefficient for enhancing tumors and a 19.08% reduction in Hausdorff distance for whole tumors compared to the baseline methods, highlighting the significant advancement in segmentation performance and reliability.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
厚芋泥发布了新的文献求助10
5秒前
6秒前
9秒前
淡水痕完成签到,获得积分10
14秒前
15秒前
hahahah完成签到,获得积分10
17秒前
18秒前
CipherSage应助科研通管家采纳,获得10
18秒前
18秒前
18秒前
李爱国应助科研通管家采纳,获得30
18秒前
耳东秋衣完成签到,获得积分10
18秒前
19秒前
西西发布了新的文献求助10
22秒前
22秒前
22秒前
万能图书馆应助欣喜的茗采纳,获得10
23秒前
biopp发布了新的文献求助10
24秒前
Zenia完成签到,获得积分10
25秒前
25秒前
xiaoyan发布了新的文献求助10
25秒前
jiangjiang完成签到,获得积分10
25秒前
27秒前
28秒前
Akim应助欣喜的茗采纳,获得10
28秒前
向北要上岸应助与其会意采纳,获得30
30秒前
激情的不弱完成签到,获得积分10
36秒前
40秒前
orange发布了新的文献求助10
43秒前
小羊完成签到,获得积分10
46秒前
46秒前
48秒前
abc完成签到 ,获得积分0
53秒前
CC完成签到 ,获得积分10
53秒前
biopp完成签到,获得积分10
58秒前
33完成签到,获得积分10
59秒前
orange发布了新的文献求助10
1分钟前
1分钟前
害羞的天真完成签到 ,获得积分10
1分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
卤化钙钛矿人工突触的研究 1000
Engineering for calcareous sediments : proceedings of the International Conference on Calcareous Sediments, Perth 15-18 March 1988 / edited by R.J. Jewell, D.C. Andrews 1000
Wolffs Headache and Other Head Pain 9th Edition 1000
Continuing Syntax 1000
Kirklin/Barratt-Boyes Cardiac Surgery, 5th Edition 880
Signals, Systems, and Signal Processing 510
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6237466
求助须知:如何正确求助?哪些是违规求助? 8061330
关于积分的说明 16820491
捐赠科研通 5316947
什么是DOI,文献DOI怎么找? 2831837
邀请新用户注册赠送积分活动 1809054
关于科研通互助平台的介绍 1666180