TY - GEN
T1 - A Tri-Branch Network with Prototype-aware Matching for Universal Category Discovery
AU - Lin, Haonan
AU - An, Wenbin
AU - Chen, Yan
AU - Tian, Feng
AU - Yao, Yuzhe
AU - Ding, Wei
AU - Wang, Qianying
AU - Chen, Ping
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - In this paper, we propose a novel task, Universal Category Discovery (UCD), to address the challenge of partial overlap between source and target domain categories. Different from previous tasks that assume all known categories exist in the target domain, UCD introduces "private-known"categories that only exist in the source domain and aims to classify unlabeled data as "common"or "novel"categories while avoiding misclassifying them into "private-known"categories. For this task, we propose a Tri-branch network with bidirectional Prototype-aware Matching (TriPM). TriPM effectively transfers knowledge from labeled to unlabeled data by bidirectionally matching similar data pairs, while a prototype matching strategy reduces the negative transfer risk from "private-known"categories. Finally, we propose a tri-branch network to decouple knowledge acquisition from labeled data, unlabeled data, and their interactions, which can avoid knowledge forgetting, explore novel patterns, and transfer common knowledge, respectively. Experiments demonstrate our model's superiority over SOTA methods.
AB - In this paper, we propose a novel task, Universal Category Discovery (UCD), to address the challenge of partial overlap between source and target domain categories. Different from previous tasks that assume all known categories exist in the target domain, UCD introduces "private-known"categories that only exist in the source domain and aims to classify unlabeled data as "common"or "novel"categories while avoiding misclassifying them into "private-known"categories. For this task, we propose a Tri-branch network with bidirectional Prototype-aware Matching (TriPM). TriPM effectively transfers knowledge from labeled to unlabeled data by bidirectionally matching similar data pairs, while a prototype matching strategy reduces the negative transfer risk from "private-known"categories. Finally, we propose a tri-branch network to decouple knowledge acquisition from labeled data, unlabeled data, and their interactions, which can avoid knowledge forgetting, explore novel patterns, and transfer common knowledge, respectively. Experiments demonstrate our model's superiority over SOTA methods.
KW - Tri-Branch Network
KW - Universal Category Discovery
UR - https://www.scopus.com/pages/publications/85206588823
U2 - 10.1109/ICME57554.2024.10687497
DO - 10.1109/ICME57554.2024.10687497
M3 - 会议稿件
AN - SCOPUS:85206588823
T3 - Proceedings - IEEE International Conference on Multimedia and Expo
BT - 2024 IEEE International Conference on Multimedia and Expo, ICME 2024
PB - IEEE Computer Society
T2 - 2024 IEEE International Conference on Multimedia and Expo, ICME 2024
Y2 - 15 July 2024 through 19 July 2024
ER -