Scatter Matrix Normalization for Unsupervised Domain Adaptation

Shreyash Mishra, R. Sanodiya
{"title":"Scatter Matrix Normalization for Unsupervised Domain Adaptation","authors":"Shreyash Mishra, R. Sanodiya","doi":"10.1109/UPCON56432.2022.9986396","DOIUrl":null,"url":null,"abstract":"The field of Domain Adaptation(DA) involves the usage of data from a source to train a model, and then predict the class of data samples of a different distribution. Domain Adaptation (DA) aims to leverage the available training and testing data to model a target domain classifier. Domain invariant features are extracted, and are used to minimize the distribution divergence between the source and target domains. The existing works do not consider reducing the discrepancy between the source and target covariance matrices, an important information source. No previous work has incorporated all objectives like manifold feature learning, scatter matrix normalization, discriminative information preservation, variance maximization, divergence minimization and geometric similarity preservation into a single objective function. In this work, we propose a novel domain adaptation framework for image classification that utilizes the covariance matrices of the source and target domains along with other important objectives like discrimination information preservation, divergence minimization, among others. A robust objective function that comprises of all these objectives is designed for optimal performance of the algorithm. The significance and impact of different types of normalization on the overall performance of the algorithm is also described. Experiments on benchmark domain adaptation datasets like PIE and Office-Home signify improvements over existing state of the art algorithms.","PeriodicalId":185782,"journal":{"name":"2022 IEEE 9th Uttar Pradesh Section International Conference on Electrical, Electronics and Computer Engineering (UPCON)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 9th Uttar Pradesh Section International Conference on Electrical, Electronics and Computer Engineering (UPCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UPCON56432.2022.9986396","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The field of Domain Adaptation(DA) involves the usage of data from a source to train a model, and then predict the class of data samples of a different distribution. Domain Adaptation (DA) aims to leverage the available training and testing data to model a target domain classifier. Domain invariant features are extracted, and are used to minimize the distribution divergence between the source and target domains. The existing works do not consider reducing the discrepancy between the source and target covariance matrices, an important information source. No previous work has incorporated all objectives like manifold feature learning, scatter matrix normalization, discriminative information preservation, variance maximization, divergence minimization and geometric similarity preservation into a single objective function. In this work, we propose a novel domain adaptation framework for image classification that utilizes the covariance matrices of the source and target domains along with other important objectives like discrimination information preservation, divergence minimization, among others. A robust objective function that comprises of all these objectives is designed for optimal performance of the algorithm. The significance and impact of different types of normalization on the overall performance of the algorithm is also described. Experiments on benchmark domain adaptation datasets like PIE and Office-Home signify improvements over existing state of the art algorithms.
无监督域自适应的散点矩阵归一化
领域自适应(Domain Adaptation, DA)涉及到使用一个数据源中的数据来训练模型,然后预测不同分布的数据样本的类别。领域适应(DA)旨在利用可用的训练和测试数据来建模目标领域分类器。提取域不变特征,利用域不变特征最小化源域和目标域之间的分布差异。现有的工作没有考虑减小源和目标协方差矩阵之间的差异,这是一个重要的信息源。以前的工作没有将流形特征学习、散点矩阵归一化、判别信息保存、方差最大化、散度最小化和几何相似性保存等所有目标纳入一个单一的目标函数中。在这项工作中,我们提出了一种新的图像分类领域自适应框架,该框架利用源域和目标域的协方差矩阵以及其他重要目标,如区分信息保存,分歧最小化等。为了优化算法的性能,设计了一个包含所有这些目标的鲁棒目标函数。描述了不同类型的归一化对算法整体性能的重要性和影响。在PIE和Office-Home等基准领域自适应数据集上的实验表明,该算法比现有的最先进算法有了改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信