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

Chenyi Zhang 0004

dblp:78/918-4 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
0009-0005-8675-6320ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 1 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
2 papers
Image and video processing · 100%
Artificial intelligence
2 papers
Segmentation and scene understanding · 87% Efficient and distributed learning · 13%
Human-computer interaction and pervasive computing
1 paper
Interaction techniques and input · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing
image matting
1.722025
Learning Trimaps via Clicks for Image Matting · IEEE Trans. Multim. 2025
Memory Efficient Matting with Adaptive Token Routing · AAAI 2025
Computer vision › Segmentation and scene understanding › interactive segmentation
click-based interactive segmentation
0.912025
NTClick: Achieving Precise Interactive Segmentation With Noise-tolerant Clicks · CVPR 2025
Computer vision › Segmentation and scene understanding
interactive segmentation
0.912025
NTClick: Achieving Precise Interactive Segmentation With Noise-tolerant Clicks · CVPR 2025
Image and video processing › image matting
alpha matting
0.912025
Learning Trimaps via Clicks for Image Matting · IEEE Trans. Multim. 2025
Machine learning › Efficient and distributed learning
model compression
0.312025
Memory Efficient Matting with Adaptive Token Routing · AAAI 2025

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

transformer · 1.7token routing · 1.7simulation function · 1.7iterative three-class training · 1.7adaptive computation · 1.7two-stage refinement network · 0.9noise-tolerant click · 0.9
YearPublicationVenuePosition
2025 Memory Efficient Matting with Adaptive Token Routing
abstract
Transformer-based models have recently achieved outstanding performance in image matting. However, their application to high-resolution images remains challenging due to the quadratic complexity of global self-attention. To address this issue, we propose MEMatte, a memory-efficient matting framework for processing high-resolution images. MEMatte incorporates a router before each global attention block, directing informative tokens to the global attention while routing other tokens to a Lightweight Token Refinement Module (LTRM). Specifically, the router employs a local-global strategy to predict the routing probability of each token, and the LTRM utilizes efficient modules to simulate global attention. Additionally, we introduce a Batch-constrained Adaptive Token Routing (BATR) mechanism, which allows each router to dynamically route tokens based on image content and the stages of attention block in the network. Furthermore, we construct an ultra high-resolution image matting dataset, UHR-395, comprising 35,500 training images and 1,000 test images, with an average resolution of 4872 × 6017. This dataset is created by compositing 395 different alpha mattes across 11 categories onto various backgrounds, all with high-quality manual annotation. Extensive experiments demonstrate that MEMatte outperforms existing methods on both high-resolution and real-world datasets, significantly reducing memory usage by approximately 88% and latency by 50% on the Composition-1K benchmark.
Yiheng Lin 0002, Yihan Hu 0004, Chenyi Zhang 0004, Ting Liu 0018, Xiaochao Qu, Luoqi Liu, Yao Zhao 0001, Yunchao Wei
AAAI3
2025 NTClick: Achieving Precise Interactive Segmentation With Noise-tolerant Clicks
abstract
Interactive segmentation is a pivotal task in computer vision, focused on predicting precise masks with minimal user input. Although the click has recently become the most prevalent form of interaction due to its flexibility and efficiency, its advantages diminish as the complexity and details of target objects increase because it’s time-consuming and user-unfriendly to precisely locate and click on narrow, fine regions. To tackle this problem, we propose NTClick, a powerful click-based interactive segmentation method capable of predicting accurate masks even with imprecise user clicks when dealing with intricate targets. We first introduce a novel interaction form called noise-tolerant click, a type of click that does not require user’s precise localization when selecting fine regions. Then, we design a two-stage workflow, consisting of an Explicit Coarse Perception network for initial estimation and a High Resolution Refinement network for final classification. Quantitative results across extensive datasets demonstrate that NTClick not only maintains an efficient and user-friendly interaction mode but also significantly outperforms existing methods in segmentation accuracy.
Chenyi Zhang 0004, Ting Liu 0018, Xiaochao Qu, Luoqi Liu, Yao Zhao 0001, Yunchao Wei
CVPR1
2025 Learning Trimaps via Clicks for Image Matting
abstract
Despite the significant advancements achieved in image matting, the existing models heavily depend on manually drawn trimaps to produce accurate results in natural image scenarios. However, the process of obtaining trimaps is time-consuming and lacks user-friendliness and device compatibility. This greatly limits the practical applicability of all trimap-based matting methods. To address this issue, we introduceClick2Trimap, an interactive model that is capable of predicting high-quality trimaps and alpha mattes with minimal user click inputs. By analyzing real users’ behavioral logic and the characteristics of trimaps, we successfully propose a powerful iterative three-class training strategy and a dedicated simulation function, making Click2Trimap exhibit versatility across various scenarios. Compared with all existing trimap-free matting methods, Click2Trimap achieves superior performance in quantitative and qualitative assessments conducted on synthetic and real-world matting datasets. In particular, in a user study, Click2Trimap yields high-quality trimap and matting predictions in just 5 seconds per image on average, demonstrating its substantial practical value for use in real-world applications.
Chenyi Zhang 0004, Yihan Hu 0004, Henghui Ding, Humphrey Shi, Yao Zhao 0001, Yunchao Wei
IEEE Trans. Multim.1