Demo Data from VLDB 2026 / reviewers in the wild / expert
Chufeng Tang
dblp:250/9561
· DBLP profile ↗
10ranked-venue papers
4as first author
9since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 9 · 4 first-author · 8 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 4 first-author · 4 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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
6 papers |
Segmentation and scene understanding · 80% Image recognition and object detection · 15% Face, body and person analysis · 5% |
Topics — the 12 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Segmentation and scene understanding
instance segmentation |
1.1 | 2 | 2022 | Active Pointly-Supervised Instance Segmentation · ECCV (28) 2022 Look Closer To Segment Better: Boundary Patch Refinement for Instance Segmentation · CVPR 2021 |
Computer vision › Segmentation and scene understanding › segmentation network design
query-based segmentation |
0.9 | 1 | 2025 | Efficient Neuron Segmentation in Electron Microscopy by Affinity-Guided Queries · ICLR 2025 |
Computer vision › Segmentation and scene understanding › image segmentation
semantic and instance segmentation |
0.7 | 1 | 2023 | Visual Recognition by Request · CVPR 2023 |
Computer vision › Image recognition and object detection
visual recognition |
0.7 | 1 | 2023 | Visual Recognition by Request · CVPR 2023 |
Computer vision › Segmentation and scene understanding › semantic segmentation › segmentation refinement
boundary refinement |
0.6 | 1 | 2022 | Improving Image Segmentation with Boundary Patch Refinement · Int. J. Comput. Vis. 2022 |
Computer vision › Segmentation and scene understanding
image segmentation |
0.6 | 1 | 2022 | Improving Image Segmentation with Boundary Patch Refinement · Int. J. Comput. Vis. 2022 |
Computer vision › Segmentation and scene understanding › instance segmentation
pointly supervised instance segmentation |
0.6 | 1 | 2022 | Active Pointly-Supervised Instance Segmentation · ECCV (28) 2022 |
Computer vision › Segmentation and scene understanding › instance segmentation
mask boundary refinement |
0.5 | 1 | 2021 | Look Closer To Segment Better: Boundary Patch Refinement for Instance Segmentation · CVPR 2021 |
Computer vision › Face, body and person analysis
pedestrian attribute recognition |
0.4 | 1 | 2019 | Improving Pedestrian Attribute Recognition With Weakly-Supervised Multi-Scale Attribute-Specific Localization · ICCV 2019 |
Computer vision › Image recognition and object detection › object detection
weakly supervised object detection |
0.2 | 1 | 2022 | Active Pointly-Supervised Instance Segmentation · ECCV (28) 2022 |
Computer vision › Image recognition and object detection
object detection |
0.1 | 1 | 2019 | Improving Pedestrian Attribute Recognition With Weakly-Supervised Multi-Scale Attribute-Specific Localization · ICCV 2019 |
Computer vision › Image recognition and object detection › object localization
weakly supervised object localization |
0.1 | 1 | 2019 | Improving Pedestrian Attribute Recognition With Weakly-Supervised Multi-Scale Attribute-Specific Localization · ICCV 2019 |
Methods — techniques the papers use, named apart from their topics
transformer-based query segmentation · 0.9affinity prediction · 0.9language-driven recognition · 0.7knowledge base · 0.7point supervision · 0.6boundary patch refinement · 0.6active learning · 0.6post-processing · 0.5boundary patch refinement network · 0.5attention · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Efficient Neuron Segmentation in Electron Microscopy by Affinity-Guided QueriesabstractAccurate segmentation of neurons in electron microscopy (EM) images plays a crucial role in understanding the intricate wiring patterns of the brain. Existing automatic neuron segmentation methods rely on traditional clustering algorithms, where affinities are predicted first, and then watershed and post-processing algorithms are applied to yield segmentation results. Due to the nature of watershed algorithm, this paradigm has deficiency in both prediction quality and speed. Inspired by recent advances in natural image segmentation, we propose to use query-based methods to address the problem because they do not necessitate watershed algorithms. However, we find that directly applying existing query-based methods faces great challenges due to the large memory requirement of the 3D data and considerably different morphology of neurons. To tackle these challenges, we introduce affinity-guided queries and integrate them into a lightweight query-based framework. Specifically, we first predict affinities with a lightweight branch, which provides coarse neuron structure information. The affinities are then used to construct affinity-guided queries, facilitating segmentation with bottom-up cues. These queries, along with additional learnable queries, interact with the image features to directly predict the final segmentation results. Experiments on benchmark datasets demonstrated that our method achieved better results over state-of-the-art methods with a 2$\sim$3$\times$ speedup in inference. Code is available at https://github.com/chenhang98/AGQ. Hang Chen 0004, Chufeng Tang, Xiao Li 0028, Xiaolin Hu 0001 |
ICLR | 2 |
| 2025 | CEDNet: A cascade encoder-decoder network for dense prediction
Chufeng Tang, Jianmin Li 0001, Xiaolin Hu 0001 |
Pattern Recognit. | 3 |
| 2024 | DHS-DETR: Efficient DETRs with dynamic head switching
Hang Chen 0004, Chufeng Tang, Xiaolin Hu 0001 |
Comput. Vis. Image Underst. | 2 |
| 2023 | Visual Recognition by RequestabstractHumans have the ability of recognizing visual semantics in an unlimited granularity, but existing visual recognition algorithms cannot achieve this goal. In this paper, we establish a new paradigm named visual recognition by request (ViRReq11We recommend the readers to pronounce ViRReqas/virik/.) to bridge the gap. The key lies in decomposing visual recognition into atomic tasks named requests and leveraging a knowledge base, a hierarchical and text-based dictionary, to assist task definition. ViRReq allows for (i) learning complicated whole-part hierarchies from highly incomplete annotations and (ii) inserting new concepts with minimal efforts. We also establish a solid baseline by integrating language-driven recognition into recent semantic and instance segmentation methods, and demonstrate its flexible recognition ability on CPP and ADE20K, two datasets with hierarchical whole-part annotations. Chufeng Tang, Lingxi Xie, Xiaopeng Zhang 0008, Xiaolin Hu 0001, Qi Tian 0001 |
CVPR | 1 |
| 2023 | Focal Distillation From High-Resolution Data to Low-Resolution Data for 3D Object DetectionabstractLiDAR-based 3D object detection plays an essential role in autonomous driving. Although the detector trained on high-resolution data has much better performance than the same detector trained on low-resolution data, the high-resolution LiDAR cannot be widely used due to its high price. In this work, we propose a new distillation method called Focal Distillation to bridge the gap between high-resolution detector (teacher model) and low-resolution detector (student model). It consists of three essential components: focal classification distillation (FCD), focal regression distillation (FRD) and focal feature distillation (FFD). Taking the low-resolution data as input, the student model can learn discriminative features and produce more accurate results with the assistance of the teacher model trained on high-resolution data. We conducted extensive experiments to validate the effectiveness of Focal Distillation. Evaluated on the KITTI validation set, a typical SECOND model trained with Focal Distillation outperformed its non-distilled counterpart by 3.37%, 7.52%, 11.35% mAP on the category Car, Pedestrian, and Cyclist of moderate level, respectively. Moreover, the remarkable improvements observed on different models and different datasets further demonstrate the generalization ability of our proposed method. Jiawei Shan, Chufeng Tang, Hujie Pan, Qiankun Yu, Guanhao Wu, Xiaolin Hu 0001 |
IEEE Trans. Intell. Transp. Syst. | 3 |
| 2022 | Dense Contrastive Loss for Instance Segmentation
Hang Chen 0004, Chufeng Tang, Xiaolin Hu 0001 |
BMVC | 2 |
| 2022 | Active Pointly-Supervised Instance Segmentation
Chufeng Tang, Lingxi Xie, Xiaopeng Zhang 0008, Qi Tian 0001, Xiaolin Hu 0001 |
ECCV (28) | 1 |
| 2022 | Improving Image Segmentation with Boundary Patch Refinement
Xiaolin Hu 0001, Chufeng Tang, Hang Chen 0004, Xiao Li 0028, Jianmin Li 0001, Zhaoxiang Zhang 0001 |
Int. J. Comput. Vis. | 2 |
| 2021 | Look Closer To Segment Better: Boundary Patch Refinement for Instance SegmentationabstractTremendous efforts have been made on instance segmentation but the mask quality is still not satisfactory. The boundaries of predicted instance masks are usually imprecise due to the low spatial resolution of feature maps and the imbalance problem caused by the extremely low proportion of boundary pixels. To address these issues, we propose a conceptually simple yet effective post-processing refinement framework to improve the boundary quality based on the results of any instance segmentation model, termed BPR. Following the idea of looking closer to segment boundaries better, we extract and refine a series of small boundary patches along the predicted instance boundaries. The refinement is accomplished by a boundary patch refinement network at higher resolution. The proposed BPR framework yields significant improvements over the Mask R-CNN baseline on Cityscapes benchmark, especially on the boundary-aware metrics. Moreover, by applying the BPR framework to the "PolyTransform + SegFix" baseline, we reached 1stplace on the Cityscapes leaderboard. Code is available at https://github.com/tinyalpha/BPR. Chufeng Tang, Hang Chen 0004, Xiao Li 0028, Jianmin Li 0001, Zhaoxiang Zhang 0001, Xiaolin Hu 0001 |
CVPR | 1 |
| 2019 | Improving Pedestrian Attribute Recognition With Weakly-Supervised Multi-Scale Attribute-Specific LocalizationabstractPedestrian attribute recognition has been an emerging research topic in the area of video surveillance. To predict the existence of a particular attribute, it is demanded to localize the regions related to the attribute. However, in this task, the region annotations are not available. How to carve out these attribute-related regions remains challenging. Existing methods applied attribute-agnostic visual attention or heuristic body-part localization mechanisms to enhance the local feature representations, while neglecting to employ attributes to define local feature areas. We propose a flexible Attribute Localization Module (ALM) to adaptively discover the most discriminative regions and learns the regional features for each attribute at multiple levels. Moreover, a feature pyramid architecture is also introduced to enhance the attribute-specific localization at low-levels with high-level semantic guidance. The proposed framework does not require additional region annotations and can be trained end-to-end with multi-level deep supervision. Extensive experiments show that the proposed method achieves state-of-the-art results on three pedestrian attribute datasets, including PETA, RAP, and PA-100K. Chufeng Tang, Lu Sheng, Zhaoxiang Zhang 0001, Xiaolin Hu 0001 |
ICCV | 1 |