Demo Data from SIGIR 2026 / reviewers in the wild / expert
Yi Zuo 0003
dblp:17/4313-3
· DBLP profile ↗
4ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0007-8743-1426ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
2 papers |
Generative modeling · 67% Efficient and distributed learning · 33% | |
| Computer graphics and multimedia
1 paper |
Visual content generation and editing · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
1.0 | 1 | 2026 | Edit-Your-Motion: Space-Time Diffusion Decoupling Learning for Video Motion Editing · IEEE Trans. Multim. 2026 |
Machine learning › Generative modeling › diffusion model
video diffusion model |
1.0 | 1 | 2026 | Edit-Your-Motion: Space-Time Diffusion Decoupling Learning for Video Motion Editing · IEEE Trans. Multim. 2026 |
Visual content generation and editing › video editing
video motion editing |
1.0 | 1 | 2026 | Edit-Your-Motion: Space-Time Diffusion Decoupling Learning for Video Motion Editing · IEEE Trans. Multim. 2026 |
Machine learning › Efficient and distributed learning › model compression › knowledge distillation
data-free knowledge distillation |
0.7 | 1 | 2023 | D³K: Dynastic Data-Free Knowledge Distillation · IEEE Trans. Multim. 2023 |
Machine learning › Generative modeling
generative adversarial network |
0.7 | 1 | 2023 | D³K: Dynastic Data-Free Knowledge Distillation · IEEE Trans. Multim. 2023 |
Machine learning › Efficient and distributed learning › model compression
knowledge distillation |
0.7 | 1 | 2023 | D³K: Dynastic Data-Free Knowledge Distillation · IEEE Trans. Multim. 2023 |
Methods — techniques the papers use, named apart from their topics
spatio-temporal learning · 2.0recurrent causal attention · 2.0motion attention · 2.0DDIM inversion · 2.0dynastic supernet generator · 0.7differentiable dhash · 0.7additive constraint · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Edit-Your-Motion: Space-Time Diffusion Decoupling Learning for Video Motion EditingabstractExisting diffusion-based methods have achieved impressive results in human motion editing. However, these methods often exhibit significant ghosting and body distortion in unseen in-the-wild cases. In this paper, we introduce Edit-Your-Motion, a video motion editing method that tackles these challenges through one-shot fine-tuning on unseen cases. Specifically, firstly, we utilized DDIM inversion to initialize the noise, preserving the appearance of the source video and designed a lightweight motion attention adapter module to enhance motion fidelity. DDIM inversion aims to obtain the implicit representations by estimating the prediction noise from the source video, which serves as a starting point for the sampling process, ensuring the appearance consistency between the source and edited videos. The Motion Attention Module (MA) enhances the model's motion editing ability by resolving the conflict between the skeleton features and the appearance features. Secondly, to effectively decouple motion and appearance of source video, we design a spatio-temporal two-stage learning strategy (STL). In the first stage, we focus on learning temporal features of human motion and propose recurrent causal attention (RCA) to ensure consistency between video frames. In the second stage, we shift focus on learning the appearance features of the source video. With Edit-Your-Motion, users can edit the motion of humans in the source video, creating more engaging and diverse content. Extensive qualitative and quantitative experiments, along with user preference studies, show that Edit-Your-Motion outperforms other methods. Yi Zuo 0003, Lingling Li 0002, Licheng Jiao, Fang Liu 0001, Xu Liu 0006, Wenping Ma 0001, Shuyuan Yang 0001, Yuwei Guo 0001 |
IEEE Trans. Multim. | 1 |
| 2024 | Robust Instance-Based Semi-Supervised Learning Change Detection for Remote Sensing ImagesabstractSemi-supervised change detection (SSCD) has experienced rapid development, with numerous semi-supervised methods being proposed to reduce the reliance on labeled data in change detection. Existing approaches typically rely on manually set high-confidence thresholds to select robust pseudo-labels. However, the single-pixel threshold filtering method for pseudo-labels (STFP) lacks context correlation, cannot eliminate high-confidence false positive samples, and leads to erroneously filtering out low-confidence true positive samples. To address this issue, we propose robust instance-based semi-supervised learning change detection (RISL) for remote sensing images. RISL evaluates the reliability of each instance object by linking the semantic information of the context, thereby generating robust pseudo-labels. In RISL, firstly, a simple boundary trimming module (BT) as a preprocessing method for change prediction map is introduced. BT can effectively remove low-confidence false positive samples while avoiding confusion in the category of instance objects, thereby improving the quality of instance objects. Then, we propose a reliable instance evaluation module (RIEM) to evaluate the reliability of each instance object. RIEM combines the semantic information of the entire instance and establishes correlations between sample contexts to determine the reliability of the instance, effectively eliminating high false positive samples. In addition, the consistency regularization (CR) is integrated into RISL, and a new strategy suitable for RIEM is constructed. This strategy enhances the model’s generalization ability by mining and hiding semantic information from different views of unlabeled data. Experimental results on the challenging WHU-CD, LEVIR-CD, and CDD-CD datasets show that the proposed method achieves 89.80%, 90.01%, and 87.56% F1 scores on labeled data with 5% distribution. RISL achieves state-of-the-art performance compared to other methods. Yi Zuo 0003, Lingling Li 0002, Xu Liu 0006, Licheng Jiao, Fang Liu 0001, Shuyuan Yang 0001 |
IEEE Trans. Geosci. Remote. Sens. | 1 |
| 2023 | D³K: Dynastic Data-Free Knowledge DistillationabstractData-free knowledge distillation further broadens the applications of the distillation model. Nevertheless, the problem of providing diverse data with rich expression patterns needs to be further explored. In this paper, a novel dynastic data-free knowledge distillation ($D^{3}K$) model is proposed to alleviate this problem. In this model, a dynastic supernet generator (D-SG) with a flexible network structure is proposed to generate diverse data. The D-SG can adaptively alter architectural configurations and activate different subnet generators in different sequential iteration spaces. The variable network structure increases the complexity and capacity of the generator, and strengthens its ability to generate diversified data. In addition, a novel additive constraint based on the differentiable dhash (D-Dhash) is designed to guide the structure parameter selection of the D-SG. This constraint forces the D-SG to constantly jump out of the fixed generation mode and generate diverse data in semantics and instance. The effectiveness of the proposed model is verified on the experimental benchmark datasets (MNIST, CIFAR-10, CIFAR-100, and SVHN). Xiufang Li, Qigong Sun, Licheng Jiao, Fang Liu 0001, Xu Liu 0006, Lingling Li 0002, Puhua Chen, Yi Zuo 0003 |
IEEE Trans. Multim. | 8 |
| 2014 | A memetic algorithm for solving flexible Job-Shop Scheduling ProblemsabstractThe flexible Job-shop Scheduling Problem (FJSP) is an extension of the classical job-shop scheduling problem (JSP). In this paper, a memetic algorithm (MA) for the FJSP is presented. This MA is a hybrid genetic algorithm which explores the search space and two efficient local searchers to exploit information in the search region. An extensive computational study on 49 benchmark problems shows that the algorithm is effective and robust, with respect to other well-known effective algorithms. Wenping Ma 0001, Yi Zuo 0003, Jiulin Zeng, Licheng Jiao |
IEEE Congress on Evolutionary Computation | 2 |