Demo Data from EDBT 2026 / reviewers in the wild / expert
Yue Zhang 0040
dblp:47/722-40
· DBLP profile ↗
5ranked-venue papers
1as first author
5since 2021 · last 2025
0000-0002-6563-5168ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 4 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 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
2 papers |
3D vision · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision › point cloud registration
partial point cloud registration |
1.7 | 2 | 2025 | Pseudo Label Learning for Partial Point Cloud Registration · IEEE Trans. Vis. Comput. Graph. 2025 Partial Point Cloud Registration with Multi-view 2D Image Learning · AAAI 2025 |
Computer vision › 3D vision
point cloud registration |
1.7 | 2 | 2025 | Pseudo Label Learning for Partial Point Cloud Registration · IEEE Trans. Vis. Comput. Graph. 2025 Partial Point Cloud Registration with Multi-view 2D Image Learning · AAAI 2025 |
Computer vision › 3D vision › point cloud registration
unsupervised point cloud registration |
0.9 | 1 | 2025 | Pseudo Label Learning for Partial Point Cloud Registration · IEEE Trans. Vis. Comput. Graph. 2025 |
Computer vision › 3D vision
correspondence estimation |
0.3 | 1 | 2025 | Pseudo Label Learning for Partial Point Cloud Registration · IEEE Trans. Vis. Comput. Graph. 2025 |
Methods — techniques the papers use, named apart from their topics
weighted SVD · 0.9pseudo-label learning · 0.9overlap estimation · 0.9multi-view depth projection · 0.9inter-modality fusion · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Partial Point Cloud Registration with Multi-view 2D Image LearningabstractLearning representations from numerous 2D image data has shown promising performance, yet very few works apply this representations to point cloud registration. In this paper, we explore how to leverage the 2D information to assist the point cloud registration, and propose IAPReg, an Image-Assisted Partial 3D point cloud Registration framework with the multi-view images generated by the input point cloud. It is expected to enrich 3D information with 2D knowledge, and leverage 2D knowledge to assist with point cloud registration. Specifically, we create multi-view depth maps by projecting the input point cloud from several specific views, and then extract 2D and 3D features using some well-established models. To fuse the information learned from 2D and 3D modalities, inter-modality multi-view learning module is proposed to enhance geometric information and complement semantic information. Weighted SVD is a common method to reduce the impact of inaccurate correspondences on registration. However, determining the correspondence weights is not trivial. Therefore, we design a 2D-weighted SVD method, where the 2D knowledge is employed to provide weight information of correspondences. Extensive experiments perform that our method outperform the state-of-the-art method without additional 2D training data. Yue Zhang 0040, Yue Wu 0004, Wenping Ma 0001, Maoguo Gong, Hao Li 0009, Biao Hou |
AAAI | 1 |
| 2025 | Pseudo Label Learning for Partial Point Cloud RegistrationabstractPartial point cloud registration plays a crucial role in computer vision and has widespread applications in 3D map construction, pose estimation, and high-precision localization. However, the collected point clouds often contain missing data due to hardware limitations and complex environments. Various partial registration algorithms have been proposed, most of which rely on estimating overlap regions. However, a significant proportion of these algorithms rely heavily on ground truth labels. Manual labeling is both time-consuming and labor-intensive, whereas algorithmic automatic labeling lacks sufficient accuracy. To tackle this issue, we present PSEudo Label learning for unsupervised partial point cloud registration (PSEL). This method utilizes complementary tasks to learn reliable pseudo labels for overlap regions and correspondences without depending on ground truth labels. The key idea is to use the complementarity between overlap estimation and registration to generate two types of pseudo labels based on the nearest points in pairs of aligned point clouds. These pseudo labels are then employed to supervise the learning of overlap regions and correspondences, gradually enhancing their accuracy throughout the learning process and ultimately establishing an unsupervised learning framework. PSEL consists of an overlap estimation module and a correspondence filtering module. The pseudo labels generated after registration are used to supervise both modules. Notably, the correspondence filtering module has two pipelines. The similarity and difference of the corresponding point features are used to eliminate false correspondences during the training and inference stages, respectively, with only the latter being optimized with pseudo labels. To validate the effectiveness of our registration method, we conducted experiments using the synthetic dataset ModelNet40, the indoor dataset 3DMatch, and the outdoor dataset KITTI. Wenping Ma 0001, Yue Wu 0004, Yue Zhang 0040, Hao Zhu 0009, Biao Hou, Licheng Jiao |
IEEE Trans. Vis. Comput. Graph. | 4 |
| 2024 | RORNet: Partial-to-Partial Registration Network With Reliable Overlapping RepresentationsabstractThree-dimensional point cloud registration is an important field in computer vision. Recently, due to the increasingly complex scenes and incomplete observations, many partial-overlap registration methods based on overlap estimation have been proposed. These methods heavily rely on the extracted overlapping regions with their performances greatly degraded when the overlapping region extraction underperforms. To solve this problem, we propose a partial-to-partial registration network (RORNet) to find reliable overlapping representations from the partially overlapping point clouds and use these representations for registration. The idea is to select a small number of key points called reliable overlapping representations from the estimated overlapping points, reducing the side effect of overlap estimation errors on registration. Although it may filter out some inliers, the inclusion of outliers has a much bigger influence than the omission of inliers on the registration task. The RORNet is composed of overlapping points' estimation module and representations' generation module. Different from the previous methods of direct registration after extraction of overlapping areas, RORNet adds the step of extracting reliable representations before registration, where the proposed similarity matrix downsampling method is used to filter out the points with low similarity and retain reliable representations, and thus reduce the side effects of overlap estimation errors on the registration. Besides, compared with previous similarity-based and score-based overlap estimation methods, we use the dual-branch structure to combine the benefits of both, which is less sensitive to noise. We perform overlap estimation experiments and registration experiments on the ModelNet40 dataset, outdoor large scene dataset KITTI, and natural data Stanford Bunny dataset. The experimental results demonstrate that our method is superior to other partial registration methods. Our code is available at https://github.com/superYuezhang/RORNet. Yue Wu 0004, Yue Zhang 0040, Wenping Ma 0001, Maoguo Gong, Xiaolong Fan, Mingyang Zhang 0002, A. K. Qin 0001, Qiguang Miao |
IEEE Trans. Neural Networks Learn. Syst. | 2 |
| 2023 | SACF-Net: Skip-Attention Based Correspondence Filtering Network for Point Cloud RegistrationabstractRigid registration is a transformation estimation problem between two point clouds. The two point clouds captured may partially overlap owing to different viewpoints and acquisition times. Some previous correspondence matching based methods utilize an encoder-decoder network to carry out partial-to-partial registration task and adopt a skip-connection structure to convey information between the encoder and decoder. However, equally revisiting them with skip-connection may introduce the information redundancy, and limit the feature learning ability of the entire network. To address these problems, we propose a skip-attention based correspondence filtering network (SACF-Net) for point cloud registration. A novel feature interaction mechanism is designed to utilize both low-level geometric information and high-level context-aware information to enhance the original pointwise matching map. Additionally, a skip-attention based correspondence filtering method is proposed to selectively revisits features in the encoder at different resolutions, allowing the decoder to extract high-quality correspondences within overlapping regions. We conduct comprehensive experiments on indoor and outdoor scene datasets, and the results show that the proposed SACF-Net yields unprecedented performance improvements. Yue Wu 0004, Xidao Hu, Yue Zhang 0040, Maoguo Gong, Wenping Ma 0001, Qiguang Miao |
IEEE Trans. Circuits Syst. Video Technol. | 3 |
| 2023 | INENet: Inliers Estimation Network With Similarity Learning for Partial Overlapping RegistrationabstractPoint cloud registration is a key problem in the application of computer vision to robotics, autopilot and other fields. However, because the object is partially covered up or the resolution of 3D scanners is different, point clouds collected by the same sense may be inconsistent and even incomplete. Inspired by the recently proposed learning-based approaches, we propose Inliers Estimation Network (INENet) which includes a self-designed threshold prediction network and a probability estimation network with adaptive similarity mutual attention to help to find the overlapping area of the point clouds. In order to solve the above problems, we divide the partially overlapping point cloud registration task into two sub-tasks: overlapping areas detection and registration. The threshold prediction network can automatically calculate the threshold according to the input point clouds, and then the probability estimation network estimates the overlapping points by using threshold. The advantages of the proposed approach include: (1) threshold prediction network avoids bias and the complexity of manually adjusting the threshold. (2) Probability estimation network with similarity matrix can deeply fuse the information between a pair of point clouds, which is helpful to improve the accuracy. (3) INENet can be easily integrated into other overlapping region sensitive algorithms and without adjusting parameters. We conduct experiments on the ModelNet40, S3DIS and 3DMatch data sets. Specifically, the rotation error of the registration algorithm integrated with INENet is improved by at least 25% compared with direct partial overlap registration, our method improves the$F_{1} $score by 5% and has better anti-noise ability compared with the existing overlap detection methods, showing the effectiveness of the proposed method. Yue Wu 0004, Yue Zhang 0040, Xiaolong Fan, Maoguo Gong, Qiguang Miao, Wenping Ma 0001 |
IEEE Trans. Circuits Syst. Video Technol. | 2 |