File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-031-09002-8_38
- Scopus: eid_2-s2.0-85135178663
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Efficient Federated Tumor Segmentation via Normalized Tensor Aggregation and Client Pruning
Title | Efficient Federated Tumor Segmentation via Normalized Tensor Aggregation and Client Pruning |
---|---|
Authors | |
Keywords | Brain tumor segmentation Federated learning nnU-Net Test-time adaptation |
Issue Date | 2022 |
Citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2022, v. 12963 LNCS, p. 433-443 How to Cite? |
Abstract | Federated learning, which trains a generic model for different institutions without sharing their data, is a new trend to avoid training with centralized data, which is often impossible due to privacy issues. The Federated Tumor Segmentation (FeTS) Challenge 2021 has two tasks for participants. Task 1 aims at effective weight aggregation methods given a pre-defined segmentation algorithm for clients training. While task 2 looks for robust segmentation algorithms evaluated on unseen data from remote independent institutions. In federated learning, heterogeneity in the local clients’ datasets and training speeds results in non-negligible variations between clients in each aggregation round. The naive weighted average aggregation of such models causes objective inconsistency. As for task 1, we devise a tensor normalization approach to solve the objective inconsistency. Furthermore, we propose a client pruning strategy to alleviate the negative impact on the convergence time caused by the uneven training time among local clients. Our method achieves a projected convergence score of 74.32% during the training phase. For task 2, we dynamically adapt model weights at test time by minimizing the entropy loss to address the domain shifting problem for unseen data evaluation. Our method finally achieves dice scores of 90.67%, 86.23%, and 78.90% for the whole tumor, tumor core, and enhancing tumor, respectively, on the task’s validation data. Overall, the proposed solution ranked first for task 2 and third for task 1 in the FeTS Challenge 2021. |
Persistent Identifier | http://hdl.handle.net/10722/349760 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yin, Youtan | - |
dc.contributor.author | Yang, Hongzheng | - |
dc.contributor.author | Liu, Quande | - |
dc.contributor.author | Jiang, Meirui | - |
dc.contributor.author | Chen, Cheng | - |
dc.contributor.author | Dou, Qi | - |
dc.contributor.author | Heng, Pheng Ann | - |
dc.date.accessioned | 2024-10-17T07:00:37Z | - |
dc.date.available | 2024-10-17T07:00:37Z | - |
dc.date.issued | 2022 | - |
dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2022, v. 12963 LNCS, p. 433-443 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10722/349760 | - |
dc.description.abstract | Federated learning, which trains a generic model for different institutions without sharing their data, is a new trend to avoid training with centralized data, which is often impossible due to privacy issues. The Federated Tumor Segmentation (FeTS) Challenge 2021 has two tasks for participants. Task 1 aims at effective weight aggregation methods given a pre-defined segmentation algorithm for clients training. While task 2 looks for robust segmentation algorithms evaluated on unseen data from remote independent institutions. In federated learning, heterogeneity in the local clients’ datasets and training speeds results in non-negligible variations between clients in each aggregation round. The naive weighted average aggregation of such models causes objective inconsistency. As for task 1, we devise a tensor normalization approach to solve the objective inconsistency. Furthermore, we propose a client pruning strategy to alleviate the negative impact on the convergence time caused by the uneven training time among local clients. Our method achieves a projected convergence score of 74.32% during the training phase. For task 2, we dynamically adapt model weights at test time by minimizing the entropy loss to address the domain shifting problem for unseen data evaluation. Our method finally achieves dice scores of 90.67%, 86.23%, and 78.90% for the whole tumor, tumor core, and enhancing tumor, respectively, on the task’s validation data. Overall, the proposed solution ranked first for task 2 and third for task 1 in the FeTS Challenge 2021. | - |
dc.language | eng | - |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.subject | Brain tumor segmentation | - |
dc.subject | Federated learning | - |
dc.subject | nnU-Net | - |
dc.subject | Test-time adaptation | - |
dc.title | Efficient Federated Tumor Segmentation via Normalized Tensor Aggregation and Client Pruning | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-031-09002-8_38 | - |
dc.identifier.scopus | eid_2-s2.0-85135178663 | - |
dc.identifier.volume | 12963 LNCS | - |
dc.identifier.spage | 433 | - |
dc.identifier.epage | 443 | - |
dc.identifier.eissn | 1611-3349 | - |