Selection of unlabeled source domains for domain adaptation in remote sensing

IF 2.3 Q2 COMPUTER SCIENCE, THEORY & METHODS Array Pub Date : 2022-09-01 DOI:10.1016/j.array.2022.100233
Christian Geiß, Alexander Rabuske, Patrick Aravena Pelizari, Stefan Bauer, Hannes Taubenböck
{"title":"Selection of unlabeled source domains for domain adaptation in remote sensing","authors":"Christian Geiß,&nbsp;Alexander Rabuske,&nbsp;Patrick Aravena Pelizari,&nbsp;Stefan Bauer,&nbsp;Hannes Taubenböck","doi":"10.1016/j.array.2022.100233","DOIUrl":null,"url":null,"abstract":"<div><p>—In the context of supervised learning techniques, it can be desirable to utilize existing prior knowledge from a source domain to estimate a target variable in a target domain by exploiting the concept of domain adaptation. This is done to alleviate the costly compilation of prior knowledge, i.e., training data. Here, our goal is to select a single source domain for domain adaptation from multiple potentially helpful but unlabeled source domains. The training data is solely obtained for a source domain if it was identified as being relevant for estimating the target variable in the corresponding target domain by a selection mechanism. From a methodological point of view, we propose unsupervised source selection by voting from (an ensemble of) similarity metrics that follow aligned marginal distributions regarding image features of source and target domains. Thereby, we also propose an unsupervised pruning heuristic to solely include robust similarity metrics in an ensemble voting scheme. We provide an evaluation of the methods by learning models from training data sets created with Level-of-Detail-1 building models and regress <em>built-up density</em> and <em>height</em> on Sentinel-2 satellite imagery. To evaluate the domain adaptation capability, we learn and apply models interchangeably for the four largest cities in Germany. Experimental results underline the capability of the methods to obtain more frequently higher accuracy levels with an improvement of up to 10% regarding the most robust selection mechanisms compared to random source-target domain selections.</p></div>","PeriodicalId":8417,"journal":{"name":"Array","volume":"15 ","pages":"Article 100233"},"PeriodicalIF":2.3000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2590005622000716/pdfft?md5=3372953e18dfc031361e3f6c2606cfc4&pid=1-s2.0-S2590005622000716-main.pdf","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Array","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2590005622000716","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 2

Abstract

—In the context of supervised learning techniques, it can be desirable to utilize existing prior knowledge from a source domain to estimate a target variable in a target domain by exploiting the concept of domain adaptation. This is done to alleviate the costly compilation of prior knowledge, i.e., training data. Here, our goal is to select a single source domain for domain adaptation from multiple potentially helpful but unlabeled source domains. The training data is solely obtained for a source domain if it was identified as being relevant for estimating the target variable in the corresponding target domain by a selection mechanism. From a methodological point of view, we propose unsupervised source selection by voting from (an ensemble of) similarity metrics that follow aligned marginal distributions regarding image features of source and target domains. Thereby, we also propose an unsupervised pruning heuristic to solely include robust similarity metrics in an ensemble voting scheme. We provide an evaluation of the methods by learning models from training data sets created with Level-of-Detail-1 building models and regress built-up density and height on Sentinel-2 satellite imagery. To evaluate the domain adaptation capability, we learn and apply models interchangeably for the four largest cities in Germany. Experimental results underline the capability of the methods to obtain more frequently higher accuracy levels with an improvement of up to 10% regarding the most robust selection mechanisms compared to random source-target domain selections.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
遥感领域自适应中未标记源域的选择
在监督学习技术的背景下,通过利用领域自适应的概念,利用源领域的现有先验知识来估计目标领域中的目标变量是可取的。这样做是为了减少编译先验知识(即训练数据)的成本。这里,我们的目标是从多个可能有用但未标记的源域中选择一个用于域适应的源域。如果一个源域的训练数据通过选择机制被识别为与估计相应目标域中的目标变量相关,则该源域的训练数据是唯一获得的。从方法学的角度来看,我们提出了无监督源选择,通过从(一个集合)相似度量中投票,这些度量遵循关于源和目标域的图像特征的对齐边缘分布。因此,我们还提出了一种无监督剪枝启发式方法,在集成投票方案中仅包含鲁棒相似度量。我们通过学习由Level-of-Detail-1建筑模型创建的训练数据集中的模型,并对Sentinel-2卫星图像上的建筑密度和高度进行回归,对这些方法进行了评估。为了评估领域适应能力,我们在德国四个最大的城市中交替学习和应用模型。实验结果表明,与随机源-目标域选择相比,在最稳健的选择机制方面,该方法能够获得更频繁的更高精度水平,提高高达10%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Array
Array Computer Science-General Computer Science
CiteScore
4.40
自引率
0.00%
发文量
93
审稿时长
45 days
期刊最新文献
SAMU-Net: A dual-stage polyp segmentation network with a custom attention-based U-Net and segment anything model for enhanced mask prediction Combining computational linguistics with sentence embedding to create a zero-shot NLIDB Development of automatic CNC machine with versatile applications in art, design, and engineering Dual-model approach for one-shot lithium-ion battery state of health sequence prediction Maximizing influence via link prediction in evolving networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1