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

Runsong Zhu

dblp:299/7703 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
5since 2021 · last 2025
0009-0007-0220-3273ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 4 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 4 first-author · 4 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
3D vision · 92% Segmentation and scene understanding · 8%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
3d scene reconstruction
1.622025
Rethinking End-to-End 2D to 3D Scene Segmentation in Gaussian Splatting · CVPR 2025
PCF-Lift: Panoptic Lifting by Probabilistic Contrastive Fusion · ECCV (2) 2024
Computer vision › 3D vision › neural rendering
3d gaussian splatting
0.912025
Rethinking End-to-End 2D to 3D Scene Segmentation in Gaussian Splatting · CVPR 2025
Computer vision › 3D vision › 3d scene understanding
3d instance segmentation
0.912025
Rethinking End-to-End 2D to 3D Scene Segmentation in Gaussian Splatting · CVPR 2025
Computer vision › 3D vision
3d scene understanding
0.912025
Rethinking End-to-End 2D to 3D Scene Segmentation in Gaussian Splatting · CVPR 2025
Computer vision › 3D vision
point cloud processing
0.512021
AdaFit: Rethinking Learning-based Normal Estimation on Point Clouds · ICCV 2021
Computer vision › 3D vision › geometric estimation › geometric model fitting
surface fitting
0.512021
AdaFit: Rethinking Learning-based Normal Estimation on Point Clouds · ICCV 2021
Computer vision › 3D vision
surface normal estimation
0.512021
AdaFit: Rethinking Learning-based Normal Estimation on Point Clouds · ICCV 2021
Computer vision › Segmentation and scene understanding
panoptic segmentation
0.212024
PCF-Lift: Panoptic Lifting by Probabilistic Contrastive Fusion · ECCV (2) 2024

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

object-level codebook · 0.9noisy label filtering · 0.9contrastive loss · 0.9probabilistic contrastive fusion · 0.8weighted least squares · 0.5cascaded scale aggregation · 0.5
YearPublicationVenuePosition
2025 Rethinking End-to-End 2D to 3D Scene Segmentation in Gaussian Splatting
abstract
Lifting multi-view 2D instance segmentation to a radiance field has proven effective to enhance 3D understanding. Existing works rely on direct matching for end-to-end lifting, yielding inferior results, or employ a two-stage solution constrained by complex preor post-processing. In this work, we design Unified-Lift, a new end-to-end object-aware lifting approach that aims for high-quality 3D segmentation based on our object-aware 3D Gaussian representation. To start, we augment each Gaussian point with a Gaussian-level feature learned using a contrastive loss to encode instance information. Importantly, we introduce a learnable object-level codebook to account for individual objects in the scene for an explicit object-level understanding and associate the encoded object-level features with the Gaussian-level point features for segmentation predictions. While promising, achieving effective codebook learning is nontrivial and a naive solution leads to degraded performance. Hence, we formulate the association learning module and the noisy label filtering module for effective and robust codebook learning. We conduct experiments on three benchmarks LERF-Masked, Replica, and Messy Rooms. Both qualitative and quantitative results manifest that our Unified-Lift clearly outperforms existing methods in terms of segmentation quality and time efficiency.
Runsong Zhu, Shi Qiu 0001, Zhengzhe Liu, Ka-Hei Hui, Qianyi Wu, Pheng-Ann Heng, Chi-Wing Fu
CVPR1
2025 COS3D: Collaborative Open-Vocabulary 3D Segmentation
abstract
Open-vocabulary 3D segmentation is a fundamental yet challenging task, requiring a mutual understanding of both segmentation and language. However, existing Gaussian-splatting-based methods rely either on a single 3D language field, leading to inferior segmentation, or on pre-computed class-agnostic segmentations, suffering from error accumulation. To address these limitations, we present COS3D, a new collaborative prompt-segmentation framework that contributes to effectively integrating complementary language and segmentation cues throughout its entire pipeline. We first introduce the new concept of collaborative field, comprising an instance field and a language field, as the cornerstone for collaboration. During training, to effectively construct the collaborative field, our key idea is to capture the intrinsic relationship between the instance field and language field, through a novel instance-to-language feature mapping and designing an efficient two-stage training strategy. During inference, to bridge distinct characteristics of the two fields, we further design an adaptive language-to-instance prompt refinement, promoting high-quality prompt-segmentation inference. Extensive experiments not only demonstrate COS3D's leading performance over existing methods on two widely-used benchmarks but also show its high potential to various applications,~\ie, novel image-based 3D segmentation, hierarchical segmentation, and robotics.
Runsong Zhu, Ka-Hei Hui, Zhengzhe Liu, Qianyi Wu, Weiliang Tang, Shi Qiu 0001, Pheng-Ann Heng, Chi-Wing Fu
NeurIPS1
2024 PCF-Lift: Panoptic Lifting by Probabilistic Contrastive Fusion
Runsong Zhu, Shi Qiu 0001, Qianyi Wu, Ka-Hei Hui, Pheng-Ann Heng, Chi-Wing Fu
ECCV (2)1
2024 SSP: Semi-signed prioritized neural fitting for surface reconstruction from unoriented point clouds
abstract
Reconstructing 3D geometry from unoriented point clouds can benefit many downstream tasks. Recent shape modeling methods mostly adopt implicit neural representation to fit a signed distance field (SDF) and optimize the network by unsigned supervision. However, these methods occasionally have difficulty in finding the coarse shape for complicated objects, especially suffering from the "ghost" surfaces (i.e., fake surfaces that should not exist). To guide the network quickly fit the coarse shape, we propose to utilize the signed supervision in regions that are obviously outside the object and can be easily determined, resulting in our semi-signed supervision. To better recover high-fidelity details, a novel loss-based region sampling strategy and a progressive positional encoding (PE) method are applied to prioritize the optimization towards underfitting and complicated regions. Specifically, we voxelize and partition the object space into sign-known and sign-uncertain regions, in which different supervisions are applied. Besides, we adaptively adjust the sampling rate of each voxel according to the tracked reconstruction loss, so that the network can focus more on the complicated under-fitting regions. We conduct extensive experiments to demonstrate that our method achieves state-of-the-art performance compared to the existing fitting-based methods and comparable performance to learning-based methods on multiple datasets. The code is publicly available at https://github.com/Runsong123/SSP.
Runsong Zhu, Ka-Hei Hui, Shi Qiu 0001, Linchao Bao, Pheng-Ann Heng, Chi-Wing Fu
WACV1
2021 AdaFit: Rethinking Learning-based Normal Estimation on Point Clouds
abstract
This paper presents a neural network for robust normal estimation on point clouds, named AdaFit, that can deal with point clouds with noise and density variations. Existing works use a network to learn point-wise weights for weighted least squares surface fitting to estimate the normals, which has difficulty in finding accurate normals in complex regions or containing noisy points. By analyzing the step of weighted least squares surface fitting, we find that it is hard to determine the polynomial order of the fitting surface and the fitting surface is sensitive to outliers. To address these problems, we propose a simple yet effective solution that adds an additional offset prediction to improve the quality of normal estimation. Furthermore, in order to take advantage of points from different neighborhood sizes, a novel Cascaded Scale Aggregation layer is proposed to help the network predict more accurate point-wise offsets and weights. Extensive experiments demonstrate that AdaFit achieves state-of-the-art performance on both the synthetic PCPNet dataset and the real-word SceneNN dataset. The code is publicly available at https://github.com/Runsong123/AdaFit.
Runsong Zhu, Yuan Liu 0025, Zhen Dong 0005, Yuan Wang 0035, Tengping Jiang, Wenping Wang 0001, Bisheng Yang
ICCV1