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.

Tuo Chen

dblp:125/7619 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
6since 2021 · last 2026
—ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 4 since 2021Artificial intelligence and machine learning · 3 · 1 first-author · 3 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.

Computer graphics and multimedia
1 paper
Rendering · 100%
Artificial intelligence
4 papers
Representation and self-supervised learning · 65% 3D vision · 35%
Network and information security
1 paper
Security and privacy of machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
contrastive learning
1.622025
Backdooring Self-Supervised Contrastive Learning by Noisy Alignment · ICCV 2025
A Survey on Self-Supervised Learning: Algorithms, Applications, and Future Trends · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Rendering
global illumination
1.012026
Spatial Multiple Importance Sampling for Real-Time Irradiance Probes · IEEE Trans. Vis. Comput. Graph. 2026
Rendering › monte carlo rendering
importance sampling
1.012026
Spatial Multiple Importance Sampling for Real-Time Irradiance Probes · IEEE Trans. Vis. Comput. Graph. 2026
Rendering
monte carlo rendering
1.012026
Spatial Multiple Importance Sampling for Real-Time Irradiance Probes · IEEE Trans. Vis. Comput. Graph. 2026
Rendering › sampling
multiple importance sampling
1.012026
Spatial Multiple Importance Sampling for Real-Time Irradiance Probes · IEEE Trans. Vis. Comput. Graph. 2026
Rendering
real-time rendering
1.012026
Spatial Multiple Importance Sampling for Real-Time Irradiance Probes · IEEE Trans. Vis. Comput. Graph. 2026
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning › masked modeling
masked image modeling
0.912025
Exploring the Coordination of Frequency and Attention in Masked Image Modeling · IEEE Trans. Image Process. 2025
Security and privacy of machine learning › adversarial attack
backdoor attack
0.912025
Backdooring Self-Supervised Contrastive Learning by Noisy Alignment · ICCV 2025
Security and privacy of machine learning › adversarial attack › backdoor attack
backdoor poisoning attacks
0.912025
Backdooring Self-Supervised Contrastive Learning by Noisy Alignment · ICCV 2025
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning
generative self-supervised learning
0.812024
A Survey on Self-Supervised Learning: Algorithms, Applications, and Future Trends · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Computer vision › 3D vision › geometric deep learning
mesh neural network
0.812024
Mesh Neural Networks Based on Dual Graph Pyramids · IEEE Trans. Vis. Comput. Graph. 2024
Computer vision › 3D vision
3d scene understanding
0.212024
Mesh Neural Networks Based on Dual Graph Pyramids · IEEE Trans. Vis. Comput. Graph. 2024

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

random cropping manipulation · 1.7noisy alignment · 1.7image layout optimization · 1.7visibility estimation · 1.0spatial reuse · 1.0self-attention · 0.9patch throwing strategy · 0.9frequency domain masking · 0.9survey · 0.8hierarchical feature propagation · 0.8graph convolution · 0.8
YearPublicationVenuePosition
2026 Spatial Multiple Importance Sampling for Real-Time Irradiance Probes
abstract
Real-time global illumination rendered with low variance remains a persistent challenge. Many engines employ irradiance probes as a relatively cheap technique, but constrained computational budgets often lead to flickering artifacts in rendered images. In this paper, we propose spatial multiple importance sampling, which reuses ray-surface intersection data among real-time irradiance probes to significantly reduce flicker caused by variance, enabling efficient computation in complex scenes under limited ray tracing budgets. Moreover, our approach incorporates a probe selection mechanism to enhance reuse efficiency and a visibility estimation method to mitigate bias. Experimental results demonstrate that our method significantly reduces variance at a fixed ray tracing cost, delivering high-quality, stable outputs in real-time scenarios.
Tuo Chen, Zi-Heng Zhou, Lingqi Yan 0001, Shi-Min Hu 0001
IEEE Trans. Vis. Comput. Graph.1
2025 Backdooring Self-Supervised Contrastive Learning by Noisy Alignment
abstract
Self-supervised contrastive learning (CL) effectively learns transferable representations from unlabeled data containing images or image-text pairs but suffers vulnerability to data poisoning backdoor attacks (DPCLs). An adversary can inject poisoned images into pretraining datasets, causing compromised CL encoders to exhibit targeted misbehavior in downstream tasks. Existing DPCLs, however, achieve limited efficacy due to their dependence on fragile implicit co-occurrence between backdoor and target object and inadequate suppression of discriminative features in backdoored images. We propose Noisy Alignment (NA), a DPCL method that explicitly suppresses noise components in poisoned images. Inspired by powerful training-controllable CL attacks, we identify and extract the critical objective of noisy alignment, adapting it effectively into data-poisoning scenarios. Our method implements noisy alignment by strategically manipulating contrastive learning's random cropping mechanism, formulating this process as an image layout optimization problem with theoretically derived optimal parameters. The resulting method is simple yet effective, achieving state-of-the-art performance compared to existing DPCLs, while maintaining clean-data accuracy. Furthermore, Noisy Alignment demonstrates robustness against common backdoor defenses. Codes can be found at https://github.com/jsrdcht/Noisy-Alignment.
Tuo Chen, Jie Gui, Minjing Dong, Ju Jia, Lanting Fang
ICCV1
2025 Exploring the Coordination of Frequency and Attention in Masked Image Modeling
abstract
Recently, masked image modeling (MIM), which learns visual representations by reconstructing the masked patches of an image, has become a popular self-supervised paradigm. However, the pre-training of MIM always takes massive time due to the large-scale data and large-size backbones. We mainly attribute it to the random patch masking in previous MIM works, which fails to leverage the crucial semantic information for effective visual representation learning. To tackle this issue, we propose the Frequency & Attention-driven Masking and Throwing Strategy (FAMT), which can detect semantic patches and reduce the number of training patches to boost model performance and training efficiency simultaneously. Specifically, FAMT utilizes the self-attention mechanism to extract semantic information from the image for masking during training in an unsupervised manner. However, attention alone could sometimes focus on inappropriate areas regarding the semantic information. Thus, we are motivated to incorporate the information from the frequency domain into the self-attention mechanism to derive the sampling weights for masking, which captures semantic patches for visual representation learning. Furthermore, we introduce a patch throwing strategy based on the derived sampling weights to reduce the training cost. FAMT can be seamlessly integrated as a plug-and-play module and surpasses previous works, e.g. reducing the training phase time by nearly 50% and improving the linear probing accuracy of MAE by $1.8$ % ~ $ 6.3$ % across various datasets, including CIFAR-10/100, Tiny ImageNet, and ImageNet-1K. FAMT also demonstrates superior performance in downstream detection and segmentation tasks.
Jie Gui, Tuo Chen, Minjing Dong, Zhengqi Liu, Hao Luo 0004, James T. Kwok, Yuan Yan Tang
IEEE Trans. Image Process.2
2024 A Survey on Self-Supervised Learning: Algorithms, Applications, and Future Trends
abstract
Deep supervised learning algorithms typically require a large volume of labeled data to achieve satisfactory performance. However, the process of collecting and labeling such data can be expensive and time-consuming. Self-supervised learning (SSL), a subset of unsupervised learning, aims to learn discriminative features from unlabeled data without relying on human-annotated labels. SSL has garnered significant attention recently, leading to the development of numerous related algorithms. However, there is a dearth of comprehensive studies that elucidate the connections and evolution of different SSL variants. This paper presents a review of diverse SSL methods, encompassing algorithmic aspects, application domains, three key trends, and open research questions. First, we provide a detailed introduction to the motivations behind most SSL algorithms and compare their commonalities and differences. Second, we explore representative applications of SSL in domains such as image processing, computer vision, and natural language processing. Lastly, we discuss the three primary trends observed in SSL research and highlight the open questions that remain.
Jie Gui, Tuo Chen, Jing Zhang 0037, Qiong Cao, Zhenan Sun, Hao Luo 0004, Dacheng Tao
IEEE Trans. Pattern Anal. Mach. Intell.2
2024 Multi-threshold deep metric learning for facial expression recognition
abstract
Feature representations generated through triplet-based deep metric learning offer significant advantages for facial expression recognition (FER). Each threshold in triplet loss inherently shapes a distinct distribution of inter-class variations, leading to unique representations of expression features. Nonetheless, pinpointing the optimal threshold for triplet loss presents a formidable challenge, as the ideal threshold varies not only across different datasets but also among classes within the same dataset. In this paper, we propose a novel multi-threshold deep metric learning approach that bypasses the complex process of threshold validation and markedly improves the effectiveness in creating expression feature representations. Instead of choosing a single optimal threshold from a valid range, we comprehensively sample thresholds throughout this range, which ensures that the representation characteristics exhibited by the thresholds within this spectrum are fully captured and utilized for enhancing FER. Specifically, we segment the embedding layer of the deep metric learning network into multiple slices, with each slice representing a specific threshold sample. We subsequently train these embedding slices in an end-to-end fashion, applying triplet loss at its associated threshold to each slice, which results in a collection of unique expression features corresponding to each embedding slice. Moreover, we identify the issue that the traditional triplet loss may struggle to converge when employing the widely-used Batch Hard strategy for mining informative triplets, and introduce a novel loss termed dual triplet loss to address it. Extensive evaluations demonstrate the superior performance of the proposed approach on both posed and spontaneous facial expression datasets.
Wenwu Yang, Jinyi Yu, Tuo Chen, Zhenguang Liu, Xun Wang 0007, Jianbing Shen
Pattern Recognit.3
2024 Mesh Neural Networks Based on Dual Graph Pyramids
abstract
Deep neural networks (DNNs) have been widely used for mesh processing in recent years. However, current DNNs can not process arbitrary meshes efficiently. On the one hand, most DNNs expect 2-manifold, watertight meshes, but many meshes, whether manually designed or automatically generated, may have gaps, non-manifold geometry, or other defects. On the other hand, the irregular structure of meshes also brings challenges to building hierarchical structures and aggregating local geometric information, which is critical to conduct DNNs. In this paper, we present DGNet, an efficient, effective and generic deep neural mesh processing network based on dual graph pyramids; it can handle arbitrary meshes. First, we construct dual graph pyramids for meshes to guide feature propagation between hierarchical levels for both downsampling and upsampling. Second, we propose a novel convolution to aggregate local features on the proposed hierarchical graphs. By utilizing both geodesic neighbors and euclidean neighbors, the network enables feature aggregation both within local surface patches and between isolated mesh components. Experimental results demonstrate that DGNet can be applied to both shape analysis and large-scale scene understanding. Furthermore, it achieves superior performance on various benchmarks, including ShapeNetCore, HumanBody, ScanNet and Matterport3D. Code and models will be available at https://github.com/li-xl/DGNet.
Xiang-Li Li, Zheng-Ning Liu, Tuo Chen, Tai-Jiang Mu, Ralph R. Martin, Shi-Min Hu 0001
IEEE Trans. Vis. Comput. Graph.3