Target-Independent Domain Adaptation for WBC Classification using Generative Latent Search

• URL: http://arxiv.org/abs/2005.05432v2
• Date: Mon, 13 Jul 2020 18:30:20 GMT
• Title: Target-Independent Domain Adaptation for WBC Classification using Generative Latent Search
• Authors: Prashant Pandey, Prathosh AP, Vinay Kyatham, Deepak Mishra and Tathagato Rai Dastidar
• Abstract summary: Unsupervised Domain Adaptation (UDA) techniques presuppose the existence of sufficient amount of unlabelled target data. We propose a method for UDA that is devoid of the need for target data. We prove the existence of such a clone given that infinite number of data points can be sampled from the source distribution.
• Score: 20.199195698983715
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Automating the classification of camera-obtained microscopic images of White Blood Cells (WBCs) and related cell subtypes has assumed importance since it aids the laborious manual process of review and diagnosis. Several State-Of-The-Art (SOTA) methods developed using Deep Convolutional Neural Networks suffer from the problem of domain shift - severe performance degradation when they are tested on data (target) obtained in a setting different from that of the training (source). The change in the target data might be caused by factors such as differences in camera/microscope types, lenses, lighting-conditions etc. This problem can potentially be solved using Unsupervised Domain Adaptation (UDA) techniques albeit standard algorithms presuppose the existence of a sufficient amount of unlabelled target data which is not always the case with medical images. In this paper, we propose a method for UDA that is devoid of the need for target data. Given a test image from the target data, we obtain its 'closest-clone' from the source data that is used as a proxy in the classifier. We prove the existence of such a clone given that infinite number of data points can be sampled from the source distribution. We propose a method in which a latent-variable generative model based on variational inference is used to simultaneously sample and find the 'closest-clone' from the source distribution through an optimization procedure in the latent space. We demonstrate the efficacy of the proposed method over several SOTA UDA methods for WBC classification on datasets captured using different imaging modalities under multiple settings.

Related papers

• Source-Free Domain Adaptation for Medical Image Segmentation via Prototype-Anchored Feature Alignment and Contrastive Learning [57.43322536718131]
  We present a two-stage source-free domain adaptation (SFDA) framework for medical image segmentation. In the prototype-anchored feature alignment stage, we first utilize the weights of the pre-trained pixel-wise classifier as source prototypes. Then, we introduce the bi-directional transport to align the target features with class prototypes by minimizing its expected cost.
  arXiv  Detail & Related papers  (2023-07-19T06:07:12Z)
• Adaptive Face Recognition Using Adversarial Information Network [57.29464116557734]
  Face recognition models often degenerate when training data are different from testing data. We propose a novel adversarial information network (AIN) to address it.
  arXiv  Detail & Related papers  (2023-05-23T02:14:11Z)
• Unsupervised Domain Adaptive Fundus Image Segmentation with Few Labeled Source Data [17.106866501665916]
  unsupervised domain adaptation (UDA) methods enhance the models' generalization ability on the unlabeled target fundus datasets. UDA methods always require sufficient labeled data from the source domain, bringing auxiliary data acquisition and annotation costs. We propose a Searching-based Multi-style Invariant Mechanism to diversify the source data style and increase the data amount. Our method has outperformed several state-of-the-art UDA segmentation methods under the UDA fundus segmentation with few labeled source data.
  arXiv  Detail & Related papers  (2022-10-10T00:30:48Z)
• VAESim: A probabilistic approach for self-supervised prototype discovery [0.23624125155742057]
  We propose an architecture for image stratification based on a conditional variational autoencoder. We use a continuous latent space to represent the continuum of disorders and find clusters during training, which can then be used for image/patient stratification. We demonstrate that our method outperforms baselines in terms of kNN accuracy measured on a classification task against a standard VAE.
  arXiv  Detail & Related papers  (2022-09-25T17:55:31Z)
• Back to the Source: Diffusion-Driven Test-Time Adaptation [77.4229736436935]
  Test-time adaptation harnesses test inputs to improve accuracy of a model trained on source data when tested on shifted target data. We instead update the target data, by projecting all test inputs toward the source domain with a generative diffusion model.
  arXiv  Detail & Related papers  (2022-07-07T17:14:10Z)
• Source-Free Domain Adaptation via Distribution Estimation [106.48277721860036]
  Domain Adaptation aims to transfer the knowledge learned from a labeled source domain to an unlabeled target domain whose data distributions are different. Recently, Source-Free Domain Adaptation (SFDA) has drawn much attention, which tries to tackle domain adaptation problem without using source data. In this work, we propose a novel framework called SFDA-DE to address SFDA task via source Distribution Estimation.
  arXiv  Detail & Related papers  (2022-04-24T12:22:19Z)
• Self-Trained One-class Classification for Unsupervised Anomaly Detection [56.35424872736276]
  Anomaly detection (AD) has various applications across domains, from manufacturing to healthcare. In this work, we focus on unsupervised AD problems whose entire training data are unlabeled and may contain both normal and anomalous samples. To tackle this problem, we build a robust one-class classification framework via data refinement. We show that our method outperforms state-of-the-art one-class classification method by 6.3 AUC and 12.5 average precision.
  arXiv  Detail & Related papers  (2021-06-11T01:36:08Z)
• Semi-Supervised Domain Adaptation with Prototypical Alignment and Consistency Learning [86.6929930921905]
  This paper studies how much it can help address domain shifts if we further have a few target samples labeled. To explore the full potential of landmarks, we incorporate a prototypical alignment (PA) module which calculates a target prototype for each class from the landmarks. Specifically, we severely perturb the labeled images, making PA non-trivial to achieve and thus promoting model generalizability.
  arXiv  Detail & Related papers  (2021-04-19T08:46:08Z)
• Domain Impression: A Source Data Free Domain Adaptation Method [27.19677042654432]
  Unsupervised domain adaptation methods solve the adaptation problem for an unlabeled target set, assuming that the source dataset is available with all labels. This paper proposes a domain adaptation technique that does not need any source data. Instead of the source data, we are only provided with a classifier that is trained on the source data.
  arXiv  Detail & Related papers  (2021-02-17T19:50:49Z)
• Learn by Guessing: Multi-Step Pseudo-Label Refinement for Person Re-Identification [0.0]
  A promising approach relies on the use of unsupervised learning as part of the pipeline. In this work, we propose a multi-step pseudo-label refinement method to select the best possible clusters. We surpass state-of-the-art for UDA Re-ID by 3.4% on Market1501-DukeMTMC datasets.
  arXiv  Detail & Related papers  (2021-01-04T20:00:33Z)
• Deep Adversarial Domain Adaptation Based on Multi-layer Joint Kernelized Distance [30.452492118887182]
  Domain adaptation refers to the learning scenario that a model learned from the source data is applied on the target data. The distribution discrepancy between source data and target data can substantially affect the adaptation performance. A deep adversarial domain adaptation model based on a multi-layer joint kernelized distance metric is proposed.
  arXiv  Detail & Related papers  (2020-10-09T02:32:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.