Saved in:
Bibliographic Details
Main Authors: Zamanitajeddin, Neda, Jahanifar, Mostafa, Xu, Kesi, Siraj, Fouzia, Rajpoot, Nasir
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2409.17063
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914148285153280
author Zamanitajeddin, Neda
Jahanifar, Mostafa
Xu, Kesi
Siraj, Fouzia
Rajpoot, Nasir
author_facet Zamanitajeddin, Neda
Jahanifar, Mostafa
Xu, Kesi
Siraj, Fouzia
Rajpoot, Nasir
contents Deep learning models have shown immense promise in computational pathology (CPath) tasks, but their performance often suffers when applied to unseen data due to domain shifts. Addressing this requires domain generalization (DG) algorithms. However, a systematic evaluation of DG algorithms in the CPath context is lacking. This study aims to benchmark the effectiveness of 30 DG algorithms on 3 CPath tasks of varying difficulty through 7,560 cross-validation runs. We evaluate these algorithms using a unified and robust platform, incorporating modality-specific techniques and recent advances like pretrained foundation models. Our extensive cross-validation experiments provide insights into the relative performance of various DG strategies. We observe that self-supervised learning and stain augmentation consistently outperform other methods, highlighting the potential of pretrained models and data augmentation. Furthermore, we introduce a new pan-cancer tumor detection dataset (HISTOPANTUM) as a benchmark for future research. This study offers valuable guidance to researchers in selecting appropriate DG approaches for CPath tasks.
format Preprint
id arxiv_https___arxiv_org_abs_2409_17063
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Benchmarking Domain Generalization Algorithms in Computational Pathology
Zamanitajeddin, Neda
Jahanifar, Mostafa
Xu, Kesi
Siraj, Fouzia
Rajpoot, Nasir
Computer Vision and Pattern Recognition
Artificial Intelligence
Machine Learning
Deep learning models have shown immense promise in computational pathology (CPath) tasks, but their performance often suffers when applied to unseen data due to domain shifts. Addressing this requires domain generalization (DG) algorithms. However, a systematic evaluation of DG algorithms in the CPath context is lacking. This study aims to benchmark the effectiveness of 30 DG algorithms on 3 CPath tasks of varying difficulty through 7,560 cross-validation runs. We evaluate these algorithms using a unified and robust platform, incorporating modality-specific techniques and recent advances like pretrained foundation models. Our extensive cross-validation experiments provide insights into the relative performance of various DG strategies. We observe that self-supervised learning and stain augmentation consistently outperform other methods, highlighting the potential of pretrained models and data augmentation. Furthermore, we introduce a new pan-cancer tumor detection dataset (HISTOPANTUM) as a benchmark for future research. This study offers valuable guidance to researchers in selecting appropriate DG approaches for CPath tasks.
title Benchmarking Domain Generalization Algorithms in Computational Pathology
topic Computer Vision and Pattern Recognition
Artificial Intelligence
Machine Learning
url https://arxiv.org/abs/2409.17063