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

Yuda Zou

dblp:364/1064 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2026
0009-0006-6967-5323ORCID · corroborated

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 · 2 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 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.

Artificial intelligence
3 papers
Image recognition and object detection · 40% Autonomous driving · 17% Segmentation and scene understanding · 15%

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

TopicWeightPapersLastEvidence papers
Computer vision › Image recognition and object detection
object counting
1.822026
Decoupling What to Count and Where to See for Referring Expression Counting · AAAI 2026
Shifted Autoencoders for Point Annotation Restoration in Object Counting · ECCV (25) 2024
Computer vision › Image recognition and object detection › object counting
referring expression counting
1.012026
Decoupling What to Count and Where to See for Referring Expression Counting · AAAI 2026
Robotics › Autonomous driving
driving scene understanding
0.912025
Beyond Pixel Uncertainty: Bounding the OoD Objects in Road Scenes · ICCV 2025
Machine learning › Trustworthy machine learning › robustness
out-of-distribution detection
0.912025
Beyond Pixel Uncertainty: Bounding the OoD Objects in Road Scenes · ICCV 2025
Machine learning › Deep learning architectures and training
autoencoder
0.812024
Shifted Autoencoders for Point Annotation Restoration in Object Counting · ECCV (25) 2024
Computer vision › Vision and language › visual grounding
referring expression comprehension
0.312026
Decoupling What to Count and Where to See for Referring Expression Counting · AAAI 2026
Robotics › Autonomous driving
perception
0.312025
Beyond Pixel Uncertainty: Bounding the OoD Objects in Road Scenes · ICCV 2025

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

subclass separable matching · 1.0dual-query mechanism · 1.0uncertainty estimation · 0.9
YearPublicationVenuePosition
2026 Decoupling What to Count and Where to See for Referring Expression Counting
abstract
Referring Expression Counting (REC) extends class-level object counting to the fine-grained subclass-level, aiming to enumerate objects matching a textual expression that specifies both the class and distinguishing attribute. A fundamental challenge, however, has been overlooked: annotation points are typically placed on class-representative locations (e.g., heads), forcing models to focus on class-level features while neglecting attribute information from other visual regions (e.g., legs for ''walking''). To address this, we propose W2-Net, a novel framework that explicitly decouples the problem into ''what to count'' and ''where to see'' via a dual-query mechanism. Specifically, alongside the standard what-to-count (w2c) queries that localize the object, we introduce dedicated where-to-see (w2s) queries. The w2s queries are guided to seek and extract features from attribute-specific visual regions, enabling precise subclass discrimination. Furthermore, we introduce Subclass Separable Matching (SSM), a novel matching strategy that incorporates a repulsive force to enhance inter-subclass separability during label assignment. W2-Net significantly outperforms the state-of-the-art on the REC-8K dataset, reducing counting error by 22.5% (validation) and 18.0% (test), and improving localization F1 by 7% and 8%, respectively.
Yuda Zou, Yongchao Xu
AAAI1
2025 Beyond Pixel Uncertainty: Bounding the OoD Objects in Road Scenes
Huachao Zhu, Zelong Liu, Zhichao Sun 0004, Yuda Zou, Gui-Song Xia, Yongchao Xu
ICCV4
2025 Neighborhood-Consistent Binary Transformation for Domain-Invariant Chest X-Ray Diagnosis
Zelong Liu, Huachao Zhu, Zhichao Sun 0004, Yuda Zou, Yuliang Gu, Bo Du 0001, Yongchao Xu
MICCAI (5)4
2024 Shifted Autoencoders for Point Annotation Restoration in Object Counting
Yuda Zou, Xin Xiao 0010, Peilin Zhou, Zhichao Sun 0004, Bo Du 0001, Yongchao Xu
ECCV (25)1
2024 WASPSYN: A Challenge for Domain Adaptive Synapse Detection in Microwasp Brain Connectomes
abstract
The size of image volumes in connectomics studies now reaches terabyte and often petabyte scales with a great diversity of appearance due to different sample preparation procedures. However, manual annotation of neuronal structures (e.g., synapses) in these huge image volumes is time-consuming, leading to limited labeled training data often smaller than 0.001% of the large-scale image volumes in application. Methods that can utilize in-domain labeled data and generalize to out-of-domain unlabeled data are in urgent need. Although many domain adaptation approaches are proposed to address such issues in the natural image domain, few of them have been evaluated on connectomics data due to a lack of domain adaptation benchmarks. Therefore, to enable developments of domain adaptive synapse detection methods for large-scale connectomics applications, we annotated 14 image volumes from a biologically diverse set of Megaphragma viggianii brain regions originating from three different whole-brain datasets and organized the WASPSYN challenge at ISBI 2023. The annotations include coordinates of pre-synapses and post-synapses in the 3D space, together with their one-to-many connectivity information. This paper describes the dataset, the tasks, the proposed baseline, the evaluation method, and the results of the challenge. Limitations of the challenge and the impact on neuroscience research are also discussed. The challenge is and will continue to be available at https://codalab.lisn.upsaclay.fr/competitions/9169. Successful algorithms that emerge from our challenge may potentially revolutionize real-world connectomics research and further the cause that aims to unravel the complexity of brain structure and function.
Yicong Li 0002, Wanhua Li 0001, Qi Chen 0014, Wei Huang 0036, Yuda Zou, Kazunori Shinomiya, Pat Gunn, Nishika Gupta, Alexey Polilov, Yongchao Xu, Yueyi Zhang 0001, Zhiwei Xiong, Hanspeter Pfister, Donglai Wei 0001, Jingpeng Wu
IEEE Trans. Medical Imaging5