Non-Parametric Neighborhood Test-Time Generalization: Application to Medical Image Classification

Published: 16 Jul 2024, Last Modified: 16 Jul 2024MICCAI Student Board EMERGE Workshop 2024 OralEveryoneRevisionsBibTeXCC BY 4.0
Keywords: domain adaptation, generalization, unsupervised learning, parameter-free optimization
TL;DR: We propose a non-parametric classifier that leverages neighborhood information with dynamic voting for efficient and stable test-time generalization in medical imaging without any finetuning or optimization.
Abstract: Reliable and stable performance is crucial for the application of computer-aided medical image systems in clinical settings. However, approaches based on deep learning often fail to generalize well under distribution shifts. In medical imaging, such distribution shifts can, for example, be introduced by changes in scanner types or imaging protocols. To counter this, test-time generalization aims to optimize a model that has been trained on single or multiple source domains to an unseen target domain. Common test-time adaptation methods fine-tune model weights utilizing losses with gradient-based optimization, a time-consuming and computationally demanding procedure. In contrast, our approach adopts a non-parametric method that is entirely feedforward and utilizes information from target samples to extract neighborhood information. By doing so, we avoid any fine-tuning or optimization procedures, which enables our method to be more efficient and achieve stable adaptation. We demonstrate the effectiveness of our approach by benchmarking it against different state-of-the-art methods with three backbones on two publicly available datasets, consisting of fetal ultrasound and retinal images.
Submission Number: 3
Loading