TimeMatch: Unsupervised Cross-Region Adaptation by Temporal Shift
Estimation
- URL: http://arxiv.org/abs/2111.02682v1
- Date: Thu, 4 Nov 2021 08:32:59 GMT
- Title: TimeMatch: Unsupervised Cross-Region Adaptation by Temporal Shift
Estimation
- Authors: Joachim Nyborg, Charlotte Pelletier, S\'ebastien Lef\`evre, Ira Assent
- Abstract summary: TimeMatch is a new unsupervised domain adaptation method for SITS that directly accounts for the temporal shift.
TimeMatch outperforms all competing methods by 11% in F1-score across five different adaptation scenarios.
We introduce an open-access dataset for cross-region adaptation with SITS from four different regions in Europe.
- Score: 5.027714423258537
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The recent developments of deep learning models that capture the complex
temporal patterns of crop phenology have greatly advanced crop classification
of Satellite Image Time Series (SITS). However, when applied to target regions
spatially different from the training region, these models perform poorly
without any target labels due to the temporal shift of crop phenology between
regions. To address this unsupervised cross-region adaptation setting, existing
methods learn domain-invariant features without any target supervision, but not
the temporal shift itself. As a consequence, these techniques provide only
limited benefits for SITS. In this paper, we propose TimeMatch, a new
unsupervised domain adaptation method for SITS that directly accounts for the
temporal shift. TimeMatch consists of two components: 1) temporal shift
estimation, which estimates the temporal shift of the unlabeled target region
with a source-trained model, and 2) TimeMatch learning, which combines temporal
shift estimation with semi-supervised learning to adapt a classifier to an
unlabeled target region. We also introduce an open-access dataset for
cross-region adaptation with SITS from four different regions in Europe. On
this dataset, we demonstrate that TimeMatch outperforms all competing methods
by 11% in F1-score across five different adaptation scenarios, setting a new
state-of-the-art for cross-region adaptation.
Related papers
- Cross Domain Early Crop Mapping using CropSTGAN [12.271756709807898]
This paper introduces the Crop Mapping Spectral-temporal Generative Adrial Neural Network (CropSTGAN)
CropSTGAN learns to transform the target domain's spectral features to those of the source domain, effectively bridging large dissimilarities.
In experiments, CropSTGAN is benchmarked against various state-of-the-art (SOTA) methods.
arXiv Detail & Related papers (2024-01-15T00:27:41Z) - Bidirectional Domain Mixup for Domain Adaptive Semantic Segmentation [73.3083304858763]
This paper systematically studies the impact of mixup under the domain adaptaive semantic segmentation task.
In specific, we achieve domain mixup in two-step: cut and paste.
We provide extensive ablation experiments to empirically verify our main components of the framework.
arXiv Detail & Related papers (2023-03-17T05:22:44Z) - IDA: Informed Domain Adaptive Semantic Segmentation [51.12107564372869]
We propose an Domain Informed Adaptation (IDA) model, a self-training framework that mixes the data based on class-level segmentation performance.
In our IDA model, the class-level performance is tracked by an expected confidence score (ECS) and we then use a dynamic schedule to determine the mixing ratio for data in different domains.
Our proposed method is able to outperform the state-of-the-art UDA-SS method by a margin of 1.1 mIoU in the adaptation of GTA-V to Cityscapes and of 0.9 mIoU in the adaptation of SYNTHIA to City
arXiv Detail & Related papers (2023-03-05T18:16:34Z) - GaitSADA: Self-Aligned Domain Adaptation for mmWave Gait Recognition [14.750765172614836]
mmWave radar-based gait recognition is a novel user identification method that captures human gait biometrics from mmWave radar return signals.
To mitigate this issue, a novel self-aligned domain adaptation method called GaitSADA is proposed.
Experiments show that GaitSADA outperforms representative domain adaptation methods with an improvement ranging from 15.41% to 26.32% on average accuracy in low data regimes.
arXiv Detail & Related papers (2023-01-31T03:21:08Z) - Domain Adaptive Semantic Segmentation with Regional Contrastive
Consistency Regularization [19.279884432843822]
We propose a novel and fully end-to-end trainable approach, called regional contrastive consistency regularization (RCCR) for domain adaptive semantic segmentation.
Our core idea is to pull the similar regional features extracted from the same location of different images to be closer, and meanwhile push the features from the different locations of the two images to be separated.
arXiv Detail & Related papers (2021-10-11T11:45:00Z) - Region Invariant Normalizing Flows for Mobility Transfer [3.776855783688713]
We propose a novel transfer learning framework called REFORMD, for continuous-time location prediction.
We capture the evolving region-specific checkin dynamics for MTPP and spatial-temporal flows.
Our model significantly outperforms state-of-the-art methods for modeling continuous-time sequences.
arXiv Detail & Related papers (2021-09-13T06:54:08Z) - Attention-based Domain Adaptation for Single Stage Detectors [75.88557558238841]
We introduce an attention mechanism that lets us identify the important regions on which adaptation should focus.
Our approach is generic and can be integrated into any single-stage detector.
For an equivalent single-stage architecture, our method outperforms the state-of-the-art domain adaptation technique.
arXiv Detail & Related papers (2021-06-14T10:30:44Z) - Unsupervised Domain Adaptation for Spatio-Temporal Action Localization [69.12982544509427]
S-temporal action localization is an important problem in computer vision.
We propose an end-to-end unsupervised domain adaptation algorithm.
We show that significant performance gain can be achieved when spatial and temporal features are adapted separately or jointly.
arXiv Detail & Related papers (2020-10-19T04:25:10Z) - Collaborative Training between Region Proposal Localization and
Classification for Domain Adaptive Object Detection [121.28769542994664]
Domain adaptation for object detection tries to adapt the detector from labeled datasets to unlabeled ones for better performance.
In this paper, we are the first to reveal that the region proposal network (RPN) and region proposal classifier(RPC) demonstrate significantly different transferability when facing large domain gap.
arXiv Detail & Related papers (2020-09-17T07:39:52Z) - Adaptive Risk Minimization: Learning to Adapt to Domain Shift [109.87561509436016]
A fundamental assumption of most machine learning algorithms is that the training and test data are drawn from the same underlying distribution.
In this work, we consider the problem setting of domain generalization, where the training data are structured into domains and there may be multiple test time shifts.
We introduce the framework of adaptive risk minimization (ARM), in which models are directly optimized for effective adaptation to shift by learning to adapt on the training domains.
arXiv Detail & Related papers (2020-07-06T17:59:30Z)
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.