Yu-Wei Zhan

Yu-Wei Zhan

Auto-generated profile, based on publicly available information

Yu-Wei Zhan

Tsinghua University

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 December 2023 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
YWYongxin Wang
Yongxin Wang
YZYu-Wei Zhan
Yu-Wei Zhan
ZCZhen-Duo Chen
Zhen-Duo Chen
Xin LuoXin Luo
Xin Luo
XXXinshun Xu
Xinshun Xu
Recently, many efforts have been devoted to improving the retrieval performance of supervised cross-modal hashing; however, current methods are gradually reaching a performance bottleneck, especially when dealing with real-world multimedia data. This is mainly due to their application of coarse-grained semantics, unrobust hash functions, and inflexible workflows. Therefore, discovering refined semantics hidden in data, designing robust hash functions, and creating a non-interfering but facilitative learning workflow are much more significant. With this motivation, in this paper, we propose a novel supervised cross-modal hashing method, i.e., Multiple Information Embedded Hashing, MIEH for short. It consists of a three-step working flow that flexibly handles multiple information mining, hash code learning, and hash function learning. First, it explores the multimedia data from multiple perspectives such as modal-level consistency, class-level discriminability, and instance-level similarity to mine comprehensive semantic information, which not only contributes to the generation of discriminative hash codes, but also accelerates convergence. Subsequently, MIEH is committed to embed the refined semantics into targeted hash codes with an efficient discrete optimization algorithm. Finally, it improves the learning ability of linear hash function by noisy example erasing and deviation correcting. Considering this, MIEH is able to garner more robust hash function. Extensive experiments conducted on three popular benchmark datasets highlight the superiority of our MIEH on large-scale cross-modal retrieval tasks and demonstrate its competitive performance against state-of-the-art approaches. The source code is available 1 .

14 March 2025 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
FLFang-Yi Liang
Fang-Yi Liang
YZYu-Wei Zhan
Yu-Wei Zhan
JLJiale Liu
Jiale Liu
CZChong-Yu Zhang
Chong-Yu Zhang
ZCZhen-Duo Chen
Zhen-Duo Chen
XXXinshun Xu
Xinshun Xu
Few-Shot Class-Incremental Learning (FSCIL) aims to continuously learn new classes from limited samples while preventing catastrophic forgetting. With the increasing distribution of learning data across different clients and privacy concerns, FSCIL faces a more realistic scenario where few learning samples are distributed across different clients, thereby necessitating a Federated Few-Shot Class-Incremental Learning (FedFSCIL) scenario. However, this integration faces challenges from non-IID problem, which affects model generalization and training efficiency. The communication overhead in federated settings also presents a significant challenge. To address these issues, we propose Class-Aware Prompting for Federated Few-Shot Class-Incremental Learning (FedCAP). Our framework leverages pre-trained models enhanced by a class-wise prompt pool, where shared class-wise keys enable clients to utilize global class information during training. This unifies the understanding of base class features across clients and enhances model consistency. We further incorporate a class-level information fusion module to improve class representation and model generalization. Our approach requires very few parameter transmission during model aggregation, ensuring communication efficiency. To our knowledge, this is the first study to explore the scenario of FedFSCIL. Consequently, we designed comprehensive experimental setups and made the code publicly available.

26 October 2023
Verified
Conference Paper
Open access
CZChong-Yu Zhang
Chong-Yu Zhang
Xin LuoXin Luo
Xin Luo
YZYu-Wei Zhan
Yu-Wei Zhan
PZPeng-Fei Zhang
Peng-Fei Zhang
ZCZhen-Duo Chen
Zhen-Duo Chen
XXXinshun Xu
Xinshun Xu
With the continuous generation of massive amounts of multimedia data nowadays, hashing has demonstrated significant potentials for large-scale search. To handle the emerging needs for streaming data retrieval, online hashing is drawing more and more attention. For online scenario, data distribution may change and concept drifts may occur as new data is continuously added to the database. Inevitably, hashing models may lose or disrupt the previously obtained knowledge when learning from new information, which is called the problem of catastrophic forgetting. In this paper, we propose a new online hashing method called Self-distillation Dual-memory Online Hashing with Hash Centers, which is abbreviated to SDOH-HC, to overcome this challenge. Specifically, SDOH-HC contains replay and distillation modules. For replay, a dual-memory mechanism is proposed which involves hash centers and exemplars. For knowledge distillation, we let hash centers distill information from themselves, i.e., the version of last round. Additionally, a new objective function is further built on above modules and is solved discretely to learn hash codes. Extensive experiments on three benchmark datasets demonstrate the effectiveness of our method.

21 August 2025 in Expert Systems with Applications
Verified
Journal Article
Closed access
Xin LuoXin Luo
Xin Luo
FLFang-Yi Liang
Fang-Yi Liang
JLJiale Liu
Jiale Liu
YZYu-Wei Zhan
Yu-Wei Zhan
ZCZhen-Duo Chen
Zhen-Duo Chen
XXXinshun Xu
Xinshun Xu

12 March 2025 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
XXXiao-Dong Xie
Xiao-Dong Xie
YZYu-Wei Zhan
Yu-Wei Zhan
ZMZhen-Xiang Ma
Zhen-Xiang Ma
HLHong-Mei Liu
Hong-Mei Liu
ZCZhen-Duo Chen
Zhen-Duo Chen
XXXinshun Xu
Xinshun Xu
Semi-supervised video anomaly detection (SS-VAD) is essential for intelligent monitoring. However, collecting large-scale surveillance videos from various organizations raises significant privacy concerns regarding sensitive information. Federated learning offers a promising solution by enabling distributed learning among multiple participants while safeguarding privacy. Despite its potential, research on applying federated learning to SS-VAD remains unexplored due to the inherent challenges of this task. In this paper, we solve this task via proposing DLPP, a novel distributed learning framework for privacy-preserving SS-VAD. It addresses the issue of statistical heterogeneity among data from different participants in real-world federated SS-VAD applications, particularly focusing on non-independent and identically distributed (non-IID) data and imbalanced data volumes. In specific, it addresses these challenges in two key innovations: (1) For the non-IID data challenge, it dynamically updates the client model based on the overall gradient at the client of the previous training round and the degree of divergence between the server model and the client model. In this way, it can better adapt the server model to each client and promote convergence. (2) For the imbalanced data volumes challenge, it adaptively allocates client aggregation weights by comprehensively considering the data volumes, model quality, and learning efficiency of clients. This means a more robust server model can be obtained, and model bias reduced. We conduct extensive experiments to evaluate the performance of DLPP on benchmark datasets by partitioning data to simulate various degrees of non-IID environments. The results show that DLPP significantly outperforms both Baseline and SOTA methods, achieving up to a 3.89% improvement, and its communication efficiency is 3x better than FedAvg.

28 October 2024
Verified
Conference Paper
Open access
TFTing Fu
Ting Fu
YZYu-Wei Zhan
Yu-Wei Zhan
CZChong-Yu Zhang
Chong-Yu Zhang
Xin LuoXin Luo
Xin Luo
ZCZhen-Duo Chen
Zhen-Duo Chen
XXXinshun Xu
Xinshun Xu
Deep Cross-Modal Hashing (CMH) has become one of the most popular solutions for cross-modal retrieval. Existing methods need to first collect data and then be trained with these accumulated data. However, in real world, data may be generated and possessed by different owners. Considering the concerns about privacy, data may not be shared or transmitted, leading to the failure of sufficient training of CMH. To solve the problem, we propose a new framework called Federated Cross-modal Hashing with Adaptive Feature Enhancement (FedCAFE). FedCAFE is a federated method which could use distributed data to train existing CMH methods under the privacy protection. To overcome the data heterogeneity challenge of distributed data and improve the generalization ability of global model, FedCAFE is endowed with a novel adaptive feature enhancement module and a new weighted aggregation strategy. Besides, it could fully utilize the rich global information carried in the global model to constrain the model during the local training process. We have conducted extensive experiments on four widely-used datasets in CMH domain with both IID and non-IID settings. The reported results demonstrate that the proposed FedCAFE achieves better performance than several state-of-the-art baselines.