Demo Data from VLDB 2026 / reviewers in the wild / expert
Xianhe Jiao
dblp:355/7975
· DBLP profile ↗
3ranked-venue papers
3as first author
3since 2021 · last 2025
0009-0006-8742-2258ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 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.
| Computer graphics and multimedia
2 papers |
Geometric modeling and processing · 100% | |
| Artificial intelligence
1 paper |
3D vision · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing
point cloud processing |
1.6 | 2 | 2025 | Weighted Poisson-disk Resampling on Large-Scale Point Clouds · AAAI 2025 MSL-Net: Sharp Feature Detection Network for 3D Point Clouds · IEEE Trans. Vis. Comput. Graph. 2024 |
Geometric modeling and processing › point cloud processing
point cloud resampling |
0.9 | 1 | 2025 | Weighted Poisson-disk Resampling on Large-Scale Point Clouds · AAAI 2025 |
Computer vision › 3D vision
point cloud analysis |
0.8 | 1 | 2024 | MSL-Net: Sharp Feature Detection Network for 3D Point Clouds · IEEE Trans. Vis. Comput. Graph. 2024 |
Geometric modeling and processing
shape analysis |
0.2 | 1 | 2024 | MSL-Net: Sharp Feature Detection Network for 3D Point Clouds · IEEE Trans. Vis. Comput. Graph. 2024 |
Methods — techniques the papers use, named apart from their topics
laplacian graph · 1.5intrinsic shape descriptor · 1.5deep learning · 1.5voxel-based estimation · 0.9voronoi diagram · 0.9tangent smoothing · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Weighted Poisson-disk Resampling on Large-Scale Point CloudsabstractFor large-scale point cloud processing, resampling takes the important role of controlling the point number and density while keeping the geometric consistency. However, current methods cannot balance such different requirements. Particularly with large-scale point clouds, classical methods often struggle with decreased efficiency and accuracy. To address such issues, we propose a weighted Poisson-disk (WPD) resampling method to improve the usability and efficiency for the processing. We first design an initial Poisson resampling with a voxel-based estimation strategy. It is able to estimate a more accurate radius of the Poisson-disk while maintaining high efficiency. Then, we design a weighted tangent smoothing step to further optimize the Voronoi diagram for each point. At the same time, sharp features are detected and kept in the optimized results with isotropic property. Finally, we achieve a resampling copy from the original point cloud with the specified point number, uniform density, and high-quality geometric consistency. Experiments show that our method significantly improves the performance of large-scale point cloud resampling for different applications, and provides a highly practical solution. Xianhe Jiao, Chenlei Lv, Junli Zhao, Ran Yi 0002, Yu-Hui Wen, Zhenkuan Pan 0001, Zhongke Wu, Yong-Jin Liu 0001 |
AAAI | 1 |
| 2024 | MSL-Net: Sharp Feature Detection Network for 3D Point CloudsabstractAs a significant geometric feature of 3D point clouds, sharp features play an important role in shape analysis, 3D reconstruction, registration, localization, etc. Current sharp feature detection methods are still sensitive to the quality of the input point cloud, and the detection performance is affected by random noisy points and non-uniform densities. In this paper, using the prior knowledge of geometric features, we propose a Multi-scale Laplace Network (MSL-Net), a new deep-learning-based method based on an intrinsic neighbor shape descriptor, to detect sharp features from 3D point clouds. First, we establish a discrete intrinsic neighborhood of the point cloud based on the Laplacian graph, which reduces the error of local implicit surface estimation. Then, we design a new intrinsic shape descriptor based on the intrinsic neighborhood, combined with enhanced normal extraction and cosine-based field estimation function. Finally, we present the backbone of MSL-Net based on the intrinsic shape descriptor. Benefiting from the intrinsic neighborhood and shape descriptor, our MSL-Net has simple architecture and is capable of establishing accurate feature prediction that satisfies the manifold distribution while avoiding complex intrinsic metric calculations. Extensive experimental results demonstrate that with the multi-scale structure, MSL-Net has a strong analytical ability for local perturbations of point clouds. Compared with state-of-the-art methods, our MSL-Net is more robust and accurate. Xianhe Jiao, Chenlei Lv, Ran Yi 0002, Junli Zhao, Zhenkuan Pan 0001, Zhongke Wu, Yong-Jin Liu 0001 |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2023 | Robust 3D Craniofacial Landmarks Localization by An End-to-End Regression NetworkabstractLandmark localization plays a significant role in craniofacial registration, reconstruction, and authentication. The key challenges for localizing landmarks on point cloud craniofacial models include irregular structures, non-uniform densities, and uncertain local regions. In this paper, we propose an end-to-end regression network that can directly estimate craniofacial landmarks on point cloud models. The proposed network utilizes edge convolution to extract local features and pooling layers to aggregate global features. It realizes the end-to-end regression for landmark localization. Experimental results demonstrate that our method is robust on point clouds with sparse and unevenly distributed sampling. It can produce accurate, controllable, and efficient 3D landmarks. Xianhe Jiao, Junli Zhao, Chenlei Lv, Fuqing Duan, Zhenkuan Pan 0001, Xin Li 0003 |
ICME | 1 |