Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zi-Xian Huang

dblp:436/4656 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0005-6010-7445ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Transfer learning and domain adaptation · 87% Image recognition and object detection · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation › domain adaptation
open-set domain adaptation
1.012026
Open-Set Domain Adaptation via Target-Relaxed Optimal Transport · IEEE Trans. Image Process. 2026
Machine learning › Transfer learning and domain adaptation › domain adaptation › distribution adaptation
optimal transport domain adaptation
1.012026
Open-Set Domain Adaptation via Target-Relaxed Optimal Transport · IEEE Trans. Image Process. 2026
Computer vision › Image recognition and object detection
visual recognition
0.312026
Open-Set Domain Adaptation via Target-Relaxed Optimal Transport · IEEE Trans. Image Process. 2026

Methods — techniques the papers use, named apart from their topics

optimal transport · 1.0graph embedding · 1.0
YearPublicationVenuePosition
2026 Open-Set Domain Adaptation via Target-Relaxed Optimal Transport
abstract
Open set domain adaptation (OSDA) aims to transfer classification-oriented knowledge from a labeled source domain to an unlabeled target domain, which faces the challenges from unseen knowledge in open-set scenarios, i.e., unknown classes privileged to the target domain. Existing methods usually identify unknown classes from classifier prediction directly, which are sensitive to the intrinsic clustering structure and cluster numbers of the unknown class data. In this paper, inspired by the sample relation characterization ability of Optimal Transport (OT), we propose a new type of OT method for OSDA, namely, Target-relaxed Optimal Transport (TROT). Compared with existing OT with strict marginal constraints, TROT imposes a single-side relaxation to the mass requirement on the open-set target domain. Theoretically, we prove that such a relaxation can reduce mis-matches between known and unknown classes, which indicates the transport plan of TROT is promising to identify unknown classes. Methodologically, TROT can identify unknown classes adaptively and map the cross-domain shared data with a sparse plan assignment, which improves both the effectiveness and robustness of known class alignment; besides, a graph embedding with multi-cluster structure of unknown classes is designed to learn a discriminative metric space for open-set classification. Empirically, extensive evaluations are conducted on several image datasets, where TROT achieves significant performance improvements compared with existing techniques for visual recognition in open-set scenarios.
Chuan-Xian Ren, Zi-Xian Huang, Hong Yan 0001
IEEE Trans. Image Process.2