Fu Li , Yifan Lan , Yuwu Lu , Wai Keung Wong , Ming Zhao , Zhihui Lai , Xuelong Li
{"title":"Separation of Unknown Features and Samples for Unbiased Source-free Open Set Domain Adaptation","authors":"Fu Li , Yifan Lan , Yuwu Lu , Wai Keung Wong , Ming Zhao , Zhihui Lai , Xuelong Li","doi":"10.1016/j.patcog.2025.111661","DOIUrl":null,"url":null,"abstract":"<div><div>Open Set Domain Adaptation (OSDA) is proposed to train a model on a source domain that performs well on a target domain with domain discrepancy and unknown class samples outside the source domain. Recently, Source-free Open Set Domain Adaptation (SF-OSDA) aims to achieve OSDA without accessing source domain samples. Existing SF-OSDA only focuses on the known class samples in the target domain and overlooks the abundant unknown class semantics in the target domain. To address these issues, in this paper, we propose a Separation of Unknown Features and Samples (SUFS) method for unbiased SF-OSDA. Specifically, SUFS consists of a Sample Feature Separation (SFS) module that separates the private features from the known features in each sample. This module not only utilizes the semantic information of each sample label, but also explores the potential unknown information of each sample. Then, we integrate a Feature Correlation Representation (FCR) module, which computes the similarity between each sample and its neighboring samples to correct semantic bias and build instance-level decision boundaries. A large number of experiments in the SF-OSDA scenario have demonstrated the effectiveness of SUFS. In addition, SUFS also shows great performance in the Source-free Partial Domain Adaptation (SF-PDA) scenario.</div></div>","PeriodicalId":49713,"journal":{"name":"Pattern Recognition","volume":"166 ","pages":"Article 111661"},"PeriodicalIF":7.5000,"publicationDate":"2025-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Recognition","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0031320325003218","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Open Set Domain Adaptation (OSDA) is proposed to train a model on a source domain that performs well on a target domain with domain discrepancy and unknown class samples outside the source domain. Recently, Source-free Open Set Domain Adaptation (SF-OSDA) aims to achieve OSDA without accessing source domain samples. Existing SF-OSDA only focuses on the known class samples in the target domain and overlooks the abundant unknown class semantics in the target domain. To address these issues, in this paper, we propose a Separation of Unknown Features and Samples (SUFS) method for unbiased SF-OSDA. Specifically, SUFS consists of a Sample Feature Separation (SFS) module that separates the private features from the known features in each sample. This module not only utilizes the semantic information of each sample label, but also explores the potential unknown information of each sample. Then, we integrate a Feature Correlation Representation (FCR) module, which computes the similarity between each sample and its neighboring samples to correct semantic bias and build instance-level decision boundaries. A large number of experiments in the SF-OSDA scenario have demonstrated the effectiveness of SUFS. In addition, SUFS also shows great performance in the Source-free Partial Domain Adaptation (SF-PDA) scenario.
期刊介绍:
The field of Pattern Recognition is both mature and rapidly evolving, playing a crucial role in various related fields such as computer vision, image processing, text analysis, and neural networks. It closely intersects with machine learning and is being applied in emerging areas like biometrics, bioinformatics, multimedia data analysis, and data science. The journal Pattern Recognition, established half a century ago during the early days of computer science, has since grown significantly in scope and influence.