Demo Data from VLDB 2026 / reviewers in the wild / expert
Shuling Wang 0002
dblp:97/4633-2
· DBLP profile ↗
4ranked-venue papers
1as first author
4since 2021 · last 2024
0000-0002-3405-7473ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 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
2 papers |
Segmentation and scene understanding · 45% 3D vision · 44% Efficient and distributed learning · 7% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Segmentation and scene understanding
dense prediction |
0.8 | 1 | 2024 | Task-Conditional Adapter for Multi-Task Dense Prediction · ACM Multimedia 2024 |
Computer vision › Segmentation and scene understanding › dense prediction
multi-task dense prediction |
0.8 | 1 | 2024 | Task-Conditional Adapter for Multi-Task Dense Prediction · ACM Multimedia 2024 |
Computer vision › 3D vision › depth estimation
depth completion |
0.5 | 1 | 2021 | PENet: Towards Precise and Efficient Image Guided Depth Completion · ICRA 2021 |
Computer vision › 3D vision
depth estimation |
0.5 | 1 | 2021 | PENet: Towards Precise and Efficient Image Guided Depth Completion · ICRA 2021 |
Computer vision › 3D vision › depth estimation › depth completion
sparse-to-dense depth |
0.5 | 1 | 2021 | PENet: Towards Precise and Efficient Image Guided Depth Completion · ICRA 2021 |
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning |
0.2 | 1 | 2024 | Task-Conditional Adapter for Multi-Task Dense Prediction · ACM Multimedia 2024 |
Computer vision › Vision and language
multimodal fusion |
0.1 | 1 | 2021 | PENet: Towards Precise and Efficient Image Guided Depth Completion · ICRA 2021 |
Methods — techniques the papers use, named apart from their topics
task prompts · 0.8adapter tuning · 0.8two-branch network · 0.5geometric convolutional layer · 0.5CSPN++ · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Task-Conditional Adapter for Multi-Task Dense PredictionabstractMulti-task dense prediction plays an important role in the field of computer vision and has an abundant array of applications. Its main purpose is to reduce the amount of network training parameters by sharing network parameters while using the correlation between tasks to improve overall performance. We propose a task-conditional network that handles one task at a time and shares most network parameters to achieve these goals. Inspired by adapter tuning, we propose an adapter module that focuses on both spatial- and channel-wise information to extract features from the frozen encoder backbone. This approach not only reduces the number of training parameters, but also saves training time and memory resources by attaching a parallel adapter pathway to the encoder. We additionally use learnable task prompts to model different tasks and use these prompts to adjust some parameters of adapters to fit the network to diverse tasks. These task-conditional adapters are also applied to the decoder, which enables the entire network to switch between various tasks, producing better task-specific features and achieving excellent performance. Extensive experiments on two challenging multi-task benchmarks, NYUD-v2 and PASCAL-Context, show that our approach achieves state-of-the-art performance with excellent parameter, time, and memory efficiency. The code is available at https://github.com/jfzleo/Task-Conditional-Adapter. Fengze Jiang, Shuling Wang 0002, Xiaojin Gong |
ACM Multimedia | 2 |
| 2022 | Self-Paced Knowledge Distillation for Real-Time Image Guided Depth CompletionabstractImage guided depth completion aims to generate a dense depth map from a sparse one with the guidance of a color image. Previous high-accuracy methods often rely on complex networks that are large in size and expensive in computational cost, making them inapplicable to real-time platforms. In this letter, we propose a self-paced knowledge distillation method, which obtains a lightweight but accurate depth completion model via distilling knowledge from a complex teacher network. Specifically, by taking advantage of the easy-to-hard learning curriculum in deep networks, we first design a groundtruth-free hard-pixel mining module to tell hard and noisy pixels in the teacher’s output. Then, we design two self-paced distillation losses, which gradually introduce hard pixels to distill the depth and structure knowledge from the teacher to the compact student network. Experiments on the KITTI benchmark show that the proposed method can improve the original student model by a considerable margin. The distilled compact and real-time student model outperforms all previous lightweight networks, mitigating the performance gap with state-of-the-art high-accuracy but complex models. Shuling Wang 0002, Mu Hu, Bin Li 0038, Xiaojin Gong |
IEEE Signal Process. Lett. | 1 |
| 2021 | PENet: Towards Precise and Efficient Image Guided Depth CompletionabstractImage guided depth completion is the task of generating a dense depth map from a sparse depth map and a high quality image. In this task, how to fuse the color and depth modalities plays an important role in achieving good performance. This paper proposes a two-branch backbone that consists of a color-dominant branch and a depth-dominant branch to exploit and fuse two modalities thoroughly. More specifically, one branch inputs a color image and a sparse depth map to predict a dense depth map. The other branch takes as inputs the sparse depth map and the previously predicted depth map, and outputs a dense depth map as well. The depth maps predicted from two branches are complimentary to each other and therefore they are adaptively fused. In addition, we also propose a simple geometric convolutional layer to encode 3D geometric cues. The geometric encoded backbone conducts the fusion of different modalities at multiple stages, leading to good depth completion results. We further implement a dilated and accelerated CSPN++ to refine the fused depth map efficiently. The proposed full model ranks 1st in the KITTI depth completion online leaderboard at the time of submission. It also infers much faster than most of the top ranked methods. The code of this work is available at https://github.com/JUGGHM/PENet_ICRA2021. Mu Hu, Shuling Wang 0002, Bin Li 0038, Shiyu Ning, Xiaojin Gong |
ICRA | 2 |
| 2021 | Self-supervised Visual-LiDAR Odometry with Flip ConsistencyabstractMost learning-based methods estimate ego-motion by utilizing visual sensors, which suffer from dramatic lighting variations and textureless scenarios. In this paper, we incorporate sparse but accurate depth measurements obtained from lidars to overcome the limitation of visual methods. To this end, we design a self-supervised visual-lidar odometry (Self-VLO) framework. It takes both monocular images and sparse depth maps projected from 3D lidar points as input, and produces pose and depth estimations in an end-to-end learning manner, without using any ground truth labels. To effectively fuse two modalities, we design a two-pathway encoder to extract features from visual and depth images and fuse the encoded features with those in decoders at multiple scales by our fusion module. We also adopt a siamese architecture and design an adaptively weighted flip consistency loss to facilitate the self-supervised learning of our VLO. Experiments on the KITTI odometry benchmark show that the proposed approach out-performs all self-supervised visual or lidar odometries. It also performs better than fully supervised VOs, demonstrating the power of fusion. Bin Li 0038, Mu Hu, Shuling Wang 0002, Lianghao Wang, Xiaojin Gong |
WACV | 3 |