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

Xuyi He

dblp:368/5603 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
0009-0001-9058-8172ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 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
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing › image restoration
artifact removal
0.912025
A Universal Scale-Adaptive Deformable Transformer for Image Restoration across Diverse Artifacts · CVPR 2025
Image and video processing › image restoration
image deraining
0.912025
A Universal Scale-Adaptive Deformable Transformer for Image Restoration across Diverse Artifacts · CVPR 2025
Image and video processing
image restoration
0.912025
A Universal Scale-Adaptive Deformable Transformer for Image Restoration across Diverse Artifacts · CVPR 2025
Image and video processing › image restoration › artifact removal
demoiréing
0.312025
A Universal Scale-Adaptive Deformable Transformer for Image Restoration across Diverse Artifacts · CVPR 2025

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

transformer · 0.9deformable convolution · 0.9deformable attention · 0.9
YearPublicationVenuePosition
2025 A Universal Scale-Adaptive Deformable Transformer for Image Restoration across Diverse Artifacts
abstract
Structured artifacts are semi-regular, repetitive patterns that closely intertwine with genuine image content, making their removal highly challenging. In this paper, we introduce the Scale-Adaptive Deformable Transformer, an network architecture specifically designed to eliminate such artifacts from images. The proposed network features two key components: a scale-enhanced deformable convolution module for modeling scale-varying patterns with abundant orientations and potential distortions, and a scale-adaptive deformable attention mechanism for capturing long-range relationships among repetitive patterns with different sizes and non-uniform spatial distributions. Extensive experiments show that our network consistently outperforms state-of-the-art methods in diverse artifact removal tasks, including image deraining, image demoiréing, and image debanding.
Xuyi He, Yuhui Quan, Ruotao Xu, Hui Ji 0002
CVPR1
2025 Image debanding using cross-scale invertible networks with banded deformable convolutions
Yuhui Quan, Xuyi He, Ruotao Xu, Yong Xu 0007, Hui Ji 0002
Neural Networks2
2024 Image Smoothing via Multiscale Global Perception
abstract
Image smoothing provides a fundamental operation for image processing, with a broad spectrum of applications. It is a challenging task which requires global analysis on image patterns with scale awareness. Existing deep models for image smoothing are insufficiently efficient in global perception and multi-scale processing. This paper proposes a deep model with an efficient multi-scale fusion architecture and a series of global processing blocks. The architecture enhances multi-scale feature flow by incorporating features of different scales into both the encoder and decoder blocks of a U-shape network, with multi-scale feature fusion modules inserted between the encoder and the decoder. The global processing blocks leverage the multi-axis processing mechanism to achieve joint local and global perception. Benefiting from these two key designs, our proposed model enjoys superiority in both smoothing performance and computational complexity, as demonstrated in the experiments on two benchmark datasets.
Xuyi He, Yuhui Quan, Yong Xu 0007, Ruotao Xu
IEEE Signal Process. Lett.1