首页 > 最新文献

DeCaF/FAIR@MICCAI最新文献

英文 中文
Towards Sparsified Federated Neuroimaging Models via Weight Pruning 基于权值修剪的稀疏联邦神经成像模型
Pub Date : 2022-08-24 DOI: 10.48550/arXiv.2208.11669
Dimitris Stripelis, Umang Gupta, N. Dhinagar, G. V. Steeg, Paul M. Thompson, J. Ambite
Federated training of large deep neural networks can often be restrictive due to the increasing costs of communicating the updates with increasing model sizes. Various model pruning techniques have been designed in centralized settings to reduce inference times. Combining centralized pruning techniques with federated training seems intuitive for reducing communication costs -- by pruning the model parameters right before the communication step. Moreover, such a progressive model pruning approach during training can also reduce training times/costs. To this end, we propose FedSparsify, which performs model pruning during federated training. In our experiments in centralized and federated settings on the brain age prediction task (estimating a person's age from their brain MRI), we demonstrate that models can be pruned up to 95% sparsity without affecting performance even in challenging federated learning environments with highly heterogeneous data distributions. One surprising benefit of model pruning is improved model privacy. We demonstrate that models with high sparsity are less susceptible to membership inference attacks, a type of privacy attack.
大型深度神经网络的联合训练通常会受到限制,因为随着模型大小的增加,更新的通信成本不断增加。在集中设置中设计了各种模型修剪技术来减少推理时间。将集中修剪技术与联邦训练相结合,似乎可以直观地降低通信成本——在通信步骤之前修剪模型参数。此外,这种在训练过程中的渐进模型修剪方法也可以减少训练时间/成本。为此,我们提出了FedSparsify,它在联邦训练期间执行模型修剪。在我们集中和联合设置的大脑年龄预测任务(从他们的大脑MRI中估计一个人的年龄)的实验中,我们证明了即使在具有高度异构数据分布的具有挑战性的联邦学习环境中,模型也可以被修剪到95%的稀疏度而不影响性能。模型修剪的一个惊人的好处是改进了模型的私密性。我们证明了具有高稀疏度的模型不易受到成员推理攻击(一种隐私攻击)的影响。
{"title":"Towards Sparsified Federated Neuroimaging Models via Weight Pruning","authors":"Dimitris Stripelis, Umang Gupta, N. Dhinagar, G. V. Steeg, Paul M. Thompson, J. Ambite","doi":"10.48550/arXiv.2208.11669","DOIUrl":"https://doi.org/10.48550/arXiv.2208.11669","url":null,"abstract":"Federated training of large deep neural networks can often be restrictive due to the increasing costs of communicating the updates with increasing model sizes. Various model pruning techniques have been designed in centralized settings to reduce inference times. Combining centralized pruning techniques with federated training seems intuitive for reducing communication costs -- by pruning the model parameters right before the communication step. Moreover, such a progressive model pruning approach during training can also reduce training times/costs. To this end, we propose FedSparsify, which performs model pruning during federated training. In our experiments in centralized and federated settings on the brain age prediction task (estimating a person's age from their brain MRI), we demonstrate that models can be pruned up to 95% sparsity without affecting performance even in challenging federated learning environments with highly heterogeneous data distributions. One surprising benefit of model pruning is improved model privacy. We demonstrate that models with high sparsity are less susceptible to membership inference attacks, a type of privacy attack.","PeriodicalId":347091,"journal":{"name":"DeCaF/FAIR@MICCAI","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114183578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Split-U-Net: Preventing Data Leakage in Split Learning for Collaborative Multi-Modal Brain Tumor Segmentation Split- u - net:防止协同多模态脑肿瘤分割中分裂学习的数据泄漏
Pub Date : 2022-08-22 DOI: 10.48550/arXiv.2208.10553
H. Roth, Ali Hatamizadeh, Ziyue Xu, Can Zhao, Wenqi Li, A. Myronenko, Daguang Xu
Split learning (SL) has been proposed to train deep learning models in a decentralized manner. For decentralized healthcare applications with vertical data partitioning, SL can be beneficial as it allows institutes with complementary features or images for a shared set of patients to jointly develop more robust and generalizable models. In this work, we propose"Split-U-Net"and successfully apply SL for collaborative biomedical image segmentation. Nonetheless, SL requires the exchanging of intermediate activation maps and gradients to allow training models across different feature spaces, which might leak data and raise privacy concerns. Therefore, we also quantify the amount of data leakage in common SL scenarios for biomedical image segmentation and provide ways to counteract such leakage by applying appropriate defense strategies.
Split learning (SL)被提出以分散的方式训练深度学习模型。对于具有垂直数据分区的分散医疗保健应用程序,SL可能是有益的,因为它允许具有互补功能或图像的机构为共享的一组患者共同开发更健壮和可泛化的模型。在这项工作中,我们提出了“Split-U-Net”,并成功地将SL应用于协同生物医学图像分割。尽管如此,SL需要交换中间激活映射和梯度,以允许跨不同特征空间的训练模型,这可能会泄露数据并引起隐私问题。因此,我们还量化了用于生物医学图像分割的常见SL场景中的数据泄漏量,并提供了通过应用适当的防御策略来抵消这种泄漏的方法。
{"title":"Split-U-Net: Preventing Data Leakage in Split Learning for Collaborative Multi-Modal Brain Tumor Segmentation","authors":"H. Roth, Ali Hatamizadeh, Ziyue Xu, Can Zhao, Wenqi Li, A. Myronenko, Daguang Xu","doi":"10.48550/arXiv.2208.10553","DOIUrl":"https://doi.org/10.48550/arXiv.2208.10553","url":null,"abstract":"Split learning (SL) has been proposed to train deep learning models in a decentralized manner. For decentralized healthcare applications with vertical data partitioning, SL can be beneficial as it allows institutes with complementary features or images for a shared set of patients to jointly develop more robust and generalizable models. In this work, we propose\"Split-U-Net\"and successfully apply SL for collaborative biomedical image segmentation. Nonetheless, SL requires the exchanging of intermediate activation maps and gradients to allow training models across different feature spaces, which might leak data and raise privacy concerns. Therefore, we also quantify the amount of data leakage in common SL scenarios for biomedical image segmentation and provide ways to counteract such leakage by applying appropriate defense strategies.","PeriodicalId":347091,"journal":{"name":"DeCaF/FAIR@MICCAI","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134382767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Cluster Based Secure Multi-Party Computation in Federated Learning for Histopathology Images 组织病理学图像联邦学习中基于聚类的安全多方计算
Pub Date : 2022-08-21 DOI: 10.48550/arXiv.2208.10919
S. M. Hosseini, Milad Sikaroudi, Morteza Babaie, H. Tizhoosh
. Federated learning (FL) is a decentralized method enabling hospitals to collaboratively learn a model without sharing private pa-tient data for training. In FL, participant hospitals periodically exchange training results rather than training samples with a central server. How-ever, having access to model parameters or gradients can expose private training data samples. To address this challenge, we adopt secure multiparty computation (SMC) to establish a privacy-preserving federated learning framework. In our proposed method, the hospitals are divided into clusters. After local training, each hospital splits its model weights among other hospitals in the same cluster such that no single hospital can retrieve other hospitals’ weights on its own. Then, all hospitals sum up the received weights, sending the results to the central server. Fi-nally, the central server aggregates the results, retrieving the average of models’ weights and updating the model without having access to individual hospitals’ weights. We conduct experiments on a publicly available repository, The Cancer Genome Atlas (TCGA). We compare the performance of the proposed framework with differential privacy and federated averaging as the baseline. The results reveal that compared to differential privacy, our framework can achieve higher accuracy with no privacy leakage risk at a cost of higher communication overhead.
. 联邦学习(FL)是一种分散的方法,使医院能够协作学习模型,而无需共享用于训练的私人患者数据。在FL中,参与医院定期交换训练结果,而不是与中央服务器交换训练样本。然而,访问模型参数或梯度可能会暴露私有训练数据样本。为了解决这一挑战,我们采用安全多方计算(SMC)来建立一个保护隐私的联邦学习框架。在我们提出的方法中,医院被划分为集群。经过局部训练后,每个医院将自己的模型权值在同一集群的其他医院之间进行分割,这样就没有一家医院可以单独检索其他医院的权值。然后,所有医院汇总接收到的权重,将结果发送到中央服务器。最后,中央服务器汇总结果,检索模型权重的平均值并更新模型,而无需访问各个医院的权重。我们在一个公开可用的存储库——癌症基因组图谱(TCGA)上进行实验。我们将所提出的框架的性能与差分隐私和联邦平均作为基线进行比较。结果表明,与差分隐私相比,我们的框架可以在没有隐私泄露风险的情况下实现更高的准确性,但代价是更高的通信开销。
{"title":"Cluster Based Secure Multi-Party Computation in Federated Learning for Histopathology Images","authors":"S. M. Hosseini, Milad Sikaroudi, Morteza Babaie, H. Tizhoosh","doi":"10.48550/arXiv.2208.10919","DOIUrl":"https://doi.org/10.48550/arXiv.2208.10919","url":null,"abstract":". Federated learning (FL) is a decentralized method enabling hospitals to collaboratively learn a model without sharing private pa-tient data for training. In FL, participant hospitals periodically exchange training results rather than training samples with a central server. How-ever, having access to model parameters or gradients can expose private training data samples. To address this challenge, we adopt secure multiparty computation (SMC) to establish a privacy-preserving federated learning framework. In our proposed method, the hospitals are divided into clusters. After local training, each hospital splits its model weights among other hospitals in the same cluster such that no single hospital can retrieve other hospitals’ weights on its own. Then, all hospitals sum up the received weights, sending the results to the central server. Fi-nally, the central server aggregates the results, retrieving the average of models’ weights and updating the model without having access to individual hospitals’ weights. We conduct experiments on a publicly available repository, The Cancer Genome Atlas (TCGA). We compare the performance of the proposed framework with differential privacy and federated averaging as the baseline. The results reveal that compared to differential privacy, our framework can achieve higher accuracy with no privacy leakage risk at a cost of higher communication overhead.","PeriodicalId":347091,"journal":{"name":"DeCaF/FAIR@MICCAI","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129642494","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Deep Learning-based Segmentation of Pleural Effusion From Ultrasound Using Coordinate Convolutions 基于坐标卷积的超声胸膜积液深度学习分割
Pub Date : 2022-08-05 DOI: 10.48550/arXiv.2208.03305
Germain Morilhat, Naomi Kifle, Sandy FinesilverSmith, B. Ruijsink, V. Vergani, Habtamu Tegegne Desita, Z. Desita, E. Puyol-Antón, A. Carass, A. King
In many low-to-middle income (LMIC) countries, ultrasound is used for assessment of pleural effusion. Typically, the extent of the effusion is manually measured by a sonographer, leading to significant intra-/inter-observer variability. In this work, we investigate the use of deep learning (DL) to automate the process of pleural effusion segmentation from ultrasound images. On two datasets acquired in a LMIC setting, we achieve median Dice Similarity Coefficients (DSCs) of 0.82 and 0.74 respectively using the nnU-net DL model. We also investigate the use of coordinate convolutions in the DL model and find that this results in a statistically significant improvement in the median DSC on the first dataset to 0.85, with no significant change on the second dataset. This work showcases, for the first time, the potential of DL in automating the process of effusion assessment from ultrasound in LMIC settings where there is often a lack of experienced radiologists to perform such tasks.
在许多中低收入国家,超声被用于评估胸腔积液。通常情况下,积液的程度是由超声医师手动测量的,这导致了观察者内部/之间的显著差异。在这项工作中,我们研究了使用深度学习(DL)从超声图像中自动分割胸腔积液的过程。在LMIC设置中获得的两个数据集上,我们使用nnU-net DL模型分别获得了0.82和0.74的中位数骰子相似系数(dsc)。我们还研究了在DL模型中使用坐标卷积,并发现这导致第一个数据集的DSC中位数在统计上显着提高到0.85,而在第二个数据集上没有显着变化。这项工作首次展示了深度学习在LMIC环境中自动化超声积液评估过程中的潜力,在LMIC环境中,通常缺乏经验丰富的放射科医生来执行此类任务。
{"title":"Deep Learning-based Segmentation of Pleural Effusion From Ultrasound Using Coordinate Convolutions","authors":"Germain Morilhat, Naomi Kifle, Sandy FinesilverSmith, B. Ruijsink, V. Vergani, Habtamu Tegegne Desita, Z. Desita, E. Puyol-Antón, A. Carass, A. King","doi":"10.48550/arXiv.2208.03305","DOIUrl":"https://doi.org/10.48550/arXiv.2208.03305","url":null,"abstract":"In many low-to-middle income (LMIC) countries, ultrasound is used for assessment of pleural effusion. Typically, the extent of the effusion is manually measured by a sonographer, leading to significant intra-/inter-observer variability. In this work, we investigate the use of deep learning (DL) to automate the process of pleural effusion segmentation from ultrasound images. On two datasets acquired in a LMIC setting, we achieve median Dice Similarity Coefficients (DSCs) of 0.82 and 0.74 respectively using the nnU-net DL model. We also investigate the use of coordinate convolutions in the DL model and find that this results in a statistically significant improvement in the median DSC on the first dataset to 0.85, with no significant change on the second dataset. This work showcases, for the first time, the potential of DL in automating the process of effusion assessment from ultrasound in LMIC settings where there is often a lack of experienced radiologists to perform such tasks.","PeriodicalId":347091,"journal":{"name":"DeCaF/FAIR@MICCAI","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130247455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Content-Aware Differential Privacy with Conditional Invertible Neural Networks 基于条件可逆神经网络的内容感知差分隐私
Pub Date : 2022-07-29 DOI: 10.48550/arXiv.2207.14625
Malte Tölle, U. Köthe, F. André, B. Meder, S. Engelhardt
Differential privacy (DP) has arisen as the gold standard in protecting an individual's privacy in datasets by adding calibrated noise to each data sample. While the application to categorical data is straightforward, its usability in the context of images has been limited. Contrary to categorical data the meaning of an image is inherent in the spatial correlation of neighboring pixels making the simple application of noise infeasible. Invertible Neural Networks (INN) have shown excellent generative performance while still providing the ability to quantify the exact likelihood. Their principle is based on transforming a complicated distribution into a simple one e.g. an image into a spherical Gaussian. We hypothesize that adding noise to the latent space of an INN can enable differentially private image modification. Manipulation of the latent space leads to a modified image while preserving important details. Further, by conditioning the INN on meta-data provided with the dataset we aim at leaving dimensions important for downstream tasks like classification untouched while altering other parts that potentially contain identifying information. We term our method content-aware differential privacy (CADP). We conduct experiments on publicly available benchmarking datasets as well as dedicated medical ones. In addition, we show the generalizability of our method to categorical data. The source code is publicly available at https://github.com/Cardio-AI/CADP.
差分隐私(DP)已成为保护数据集中个人隐私的黄金标准,它通过在每个数据样本中添加校准噪声来保护个人隐私。虽然分类数据的应用很简单,但它在图像上下文中的可用性受到限制。与分类数据相反,图像的意义固有于相邻像素的空间相关性,使得简单的噪声应用不可行。可逆神经网络(INN)在提供精确似然量化能力的同时,表现出了优异的生成性能。它们的原理是基于将复杂的分布转换成简单的分布,例如将图像转换成球形高斯分布。我们假设在隐空间中加入噪声可以实现差分私有图像修改。对潜在空间的处理可以在保留重要细节的同时修改图像。此外,通过调整与数据集一起提供的元数据上的INN,我们的目标是保留对下游任务(如分类)重要的维度,同时改变可能包含识别信息的其他部分。我们将这种方法称为内容感知差分隐私(content-aware differential privacy, CADP)。我们在公开可用的基准数据集以及专用的医疗数据集上进行实验。此外,我们还展示了我们的方法对分类数据的泛化性。源代码可在https://github.com/Cardio-AI/CADP上公开获得。
{"title":"Content-Aware Differential Privacy with Conditional Invertible Neural Networks","authors":"Malte Tölle, U. Köthe, F. André, B. Meder, S. Engelhardt","doi":"10.48550/arXiv.2207.14625","DOIUrl":"https://doi.org/10.48550/arXiv.2207.14625","url":null,"abstract":"Differential privacy (DP) has arisen as the gold standard in protecting an individual's privacy in datasets by adding calibrated noise to each data sample. While the application to categorical data is straightforward, its usability in the context of images has been limited. Contrary to categorical data the meaning of an image is inherent in the spatial correlation of neighboring pixels making the simple application of noise infeasible. Invertible Neural Networks (INN) have shown excellent generative performance while still providing the ability to quantify the exact likelihood. Their principle is based on transforming a complicated distribution into a simple one e.g. an image into a spherical Gaussian. We hypothesize that adding noise to the latent space of an INN can enable differentially private image modification. Manipulation of the latent space leads to a modified image while preserving important details. Further, by conditioning the INN on meta-data provided with the dataset we aim at leaving dimensions important for downstream tasks like classification untouched while altering other parts that potentially contain identifying information. We term our method content-aware differential privacy (CADP). We conduct experiments on publicly available benchmarking datasets as well as dedicated medical ones. In addition, we show the generalizability of our method to categorical data. The source code is publicly available at https://github.com/Cardio-AI/CADP.","PeriodicalId":347091,"journal":{"name":"DeCaF/FAIR@MICCAI","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122009089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Can collaborative learning be private, robust and scalable? 协作学习可以是私有的、健壮的和可扩展的吗?
Pub Date : 2022-05-05 DOI: 10.48550/arXiv.2205.02652
Dmitrii Usynin, Helena Klause, D. Rueckert, Georgios Kaissis
In federated learning for medical image analysis, the safety of the learning protocol is paramount. Such settings can often be compromised by adversaries that target either the private data used by the federation or the integrity of the model itself. This requires the medical imaging community to develop mechanisms to train collaborative models that are private and robust against adversarial data. In response to these challenges, we propose a practical open-source framework to study the effectiveness of combining differential privacy, model compression and adversarial training to improve the robustness of models against adversarial samples under train- and inference-time attacks. Using our framework, we achieve competitive model performance, a significant reduction in model's size and an improved empirical adversarial robustness without a severe performance degradation, critical in medical image analysis.
在医学图像分析的联邦学习中,学习协议的安全性是至关重要的。这样的设置通常会被攻击者破坏,攻击者的目标要么是联邦使用的私有数据,要么是模型本身的完整性。这就要求医学成像社区开发机制来训练协作模型,这些模型是私有的,并且对对抗性数据具有强大的抵抗力。为了应对这些挑战,我们提出了一个实用的开源框架来研究结合差分隐私、模型压缩和对抗训练的有效性,以提高模型在训练时间和推理时间攻击下对对抗样本的鲁棒性。使用我们的框架,我们实现了具有竞争力的模型性能,模型尺寸显着减小,并且在没有严重性能下降的情况下改进了经验对抗性鲁棒性,这在医学图像分析中至关重要。
{"title":"Can collaborative learning be private, robust and scalable?","authors":"Dmitrii Usynin, Helena Klause, D. Rueckert, Georgios Kaissis","doi":"10.48550/arXiv.2205.02652","DOIUrl":"https://doi.org/10.48550/arXiv.2205.02652","url":null,"abstract":"In federated learning for medical image analysis, the safety of the learning protocol is paramount. Such settings can often be compromised by adversaries that target either the private data used by the federation or the integrity of the model itself. This requires the medical imaging community to develop mechanisms to train collaborative models that are private and robust against adversarial data. In response to these challenges, we propose a practical open-source framework to study the effectiveness of combining differential privacy, model compression and adversarial training to improve the robustness of models against adversarial samples under train- and inference-time attacks. Using our framework, we achieve competitive model performance, a significant reduction in model's size and an improved empirical adversarial robustness without a severe performance degradation, critical in medical image analysis.","PeriodicalId":347091,"journal":{"name":"DeCaF/FAIR@MICCAI","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129728337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
LRH-Net: A Multi-Level Knowledge Distillation Approach for Low-Resource Heart Network LRH-Net:低资源心脏网络的多层次知识精馏方法
Pub Date : 2022-04-11 DOI: 10.1007/978-3-031-18523-6_18
Ekansh Chauhan, Swathi Guptha, Likith Reddy, R. Bapi
{"title":"LRH-Net: A Multi-Level Knowledge Distillation Approach for Low-Resource Heart Network","authors":"Ekansh Chauhan, Swathi Guptha, Likith Reddy, R. Bapi","doi":"10.1007/978-3-031-18523-6_18","DOIUrl":"https://doi.org/10.1007/978-3-031-18523-6_18","url":null,"abstract":"","PeriodicalId":347091,"journal":{"name":"DeCaF/FAIR@MICCAI","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124090473","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
FedAP: Adaptive Personalization in Federated Learning for Non-IID Data FedAP:非id数据联邦学习中的自适应个性化
Pub Date : 1900-01-01 DOI: 10.1007/978-3-031-18523-6_2
Yousef Yeganeh, Azade Farshad, Johannes Boschmann, Richard Gaus, Maximilian Frantzen, N. Navab
{"title":"FedAP: Adaptive Personalization in Federated Learning for Non-IID Data","authors":"Yousef Yeganeh, Azade Farshad, Johannes Boschmann, Richard Gaus, Maximilian Frantzen, N. Navab","doi":"10.1007/978-3-031-18523-6_2","DOIUrl":"https://doi.org/10.1007/978-3-031-18523-6_2","url":null,"abstract":"","PeriodicalId":347091,"journal":{"name":"DeCaF/FAIR@MICCAI","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122608810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Enhancing Portable OCT Image Quality via GANs for AI-Based Eye Disease Detection 基于gan增强便携式OCT图像质量的人工智能眼病检测
Pub Date : 1900-01-01 DOI: 10.1007/978-3-031-18523-6_15
Kaveri A. Thakoor, Ari Carter, Ge Song, Adam Wax, Omar Moussa, Royce Chen, C. Hendon, P. Sajda
{"title":"Enhancing Portable OCT Image Quality via GANs for AI-Based Eye Disease Detection","authors":"Kaveri A. Thakoor, Ari Carter, Ge Song, Adam Wax, Omar Moussa, Royce Chen, C. Hendon, P. Sajda","doi":"10.1007/978-3-031-18523-6_15","DOIUrl":"https://doi.org/10.1007/978-3-031-18523-6_15","url":null,"abstract":"","PeriodicalId":347091,"journal":{"name":"DeCaF/FAIR@MICCAI","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125721907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DeMed: A Novel and Efficient Decentralized Learning Framework for Medical Images Classification on Blockchain DeMed:一种新颖高效的区块链医学图像分类分散学习框架
Pub Date : 1900-01-01 DOI: 10.1007/978-3-031-18523-6_10
Garima Aggarwal, Chun-Yin Huang, Dian Fan, Xiaoxiao Li, Zehua Wang
{"title":"DeMed: A Novel and Efficient Decentralized Learning Framework for Medical Images Classification on Blockchain","authors":"Garima Aggarwal, Chun-Yin Huang, Dian Fan, Xiaoxiao Li, Zehua Wang","doi":"10.1007/978-3-031-18523-6_10","DOIUrl":"https://doi.org/10.1007/978-3-031-18523-6_10","url":null,"abstract":"","PeriodicalId":347091,"journal":{"name":"DeCaF/FAIR@MICCAI","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127438305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
DeCaF/FAIR@MICCAI
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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