EDBT 2026 Demo / reviewers in the wild / expert
Muyao Peng
dblp:376/9746
· DBLP profile ↗
4ranked-venue papers
1as first author
4since 2021 · last 2025
0009-0004-9825-5307ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Security and privacy · 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.
| Artificial intelligence
3 papers |
3D vision · 100% | |
| Computer graphics and multimedia
1 paper |
Image and video processing · 100% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision › image registration › multimodal registration
image-to-point cloud registration |
2.6 | 3 | 2025 | Enhance Image-to-Point-Cloud Registration with Beltrami Flow · Int. J. Comput. Vis. 2025 Top-I2P: Explore Open-Domain Image-to-Point Cloud Registration Using Topology Relationship · IJCAI 2025 MinCD-PnP: Learning 2D-3D Correspondences with Approximate Blind PnP · ICCV 2025 |
Computer vision › 3D vision › camera pose estimation
perspective-n-point |
0.9 | 1 | 2025 | MinCD-PnP: Learning 2D-3D Correspondences with Approximate Blind PnP · ICCV 2025 |
Computer vision › 3D vision
point cloud registration |
0.9 | 1 | 2025 | Top-I2P: Explore Open-Domain Image-to-Point Cloud Registration Using Topology Relationship · IJCAI 2025 |
Computer vision › 3D vision
pose estimation |
0.9 | 1 | 2025 | MinCD-PnP: Learning 2D-3D Correspondences with Approximate Blind PnP · ICCV 2025 |
Computer vision › 3D vision › geometric estimation
registration |
0.9 | 1 | 2025 | MinCD-PnP: Learning 2D-3D Correspondences with Approximate Blind PnP · ICCV 2025 |
Computer vision › 3D vision › feature matching › 3d correspondence
2d-3d correspondence |
0.3 | 1 | 2025 | MinCD-PnP: Learning 2D-3D Correspondences with Approximate Blind PnP · ICCV 2025 |
Computer vision › 3D vision › feature matching
correspondence learning |
0.3 | 1 | 2025 | MinCD-PnP: Learning 2D-3D Correspondences with Approximate Blind PnP · ICCV 2025 |
Computer vision › 3D vision › image registration
cross-modal registration |
0.3 | 1 | 2025 | Top-I2P: Explore Open-Domain Image-to-Point Cloud Registration Using Topology Relationship · IJCAI 2025 |
Image and video processing › mathematical imaging › partial differential equations for image processing
beltrami flow |
0.3 | 1 | 2025 | Enhance Image-to-Point-Cloud Registration with Beltrami Flow · Int. J. Comput. Vis. 2025 |
Methods — techniques the papers use, named apart from their topics
beltrami flow · 1.7topology reasoning · 0.9topology feature interaction · 0.9multi-task learning · 0.9chamfer distance minimization · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | MinCD-PnP: Learning 2D-3D Correspondences with Approximate Blind PnPabstractImage-to-point-cloud (I2P) registration is a fundamental problem in computer vision, focusing on establishing 2D-3D correspondences between an image and a point cloud. The differential perspective-n-point (PnP) has been widely used to supervise I2P registration networks by enforcing the projective constraints on 2D-3D correspondences. However, differential PnP is highly sensitive to noise and outliers in the predicted correspondences. This issue hinders the effectiveness of correspondence learning. Inspired by the robustness of blind PnP against noise and outliers in correspondences, we propose an approximated blind PnP based correspondence learning approach. To mitigate the high computational cost of blind PnP, we simplify blind PnP to an amenable task of minimizing Chamfer distance between learned 2D and 3D keypoints, called MinCD-PnP. To effectively solve MinCD-PnP, we design a lightweight multi-task learning module, named as MinCD-Net, which can be easily integrated into the existing I2P registration architectures. Extensive experiments on 7-Scenes, RGBD-V2, ScanNet, and self-collected datasets demonstrate that MinCD-Net outperforms state-of-the-art methods and achieves a higher inlier ratio (IR) and registration recall (RR) in both cross-scene and cross-dataset settings. Pei An, Jiaqi Yang 0002, Muyao Peng, You Yang 0002, Qiong Liu 0001, Liangliang Nan |
ICCV | 3 |
| 2025 | Top-I2P: Explore Open-Domain Image-to-Point Cloud Registration Using Topology RelationshipabstractImage-to-point cloud (I2P) registration is a fundamental task in computer vision, which aims to align pixels in 2D images with corresponding points in 3D point clouds. While deep learning based methods dominate this field, they often fail to generalize to the open domain. In this paper, we address open-domain I2P registration from the topology relationships perspective. Firstly, we find that topology relationships reflect sparse connections between pixels and points, which shows the significant potential in enhancing cross-modality feature interaction in the open domain. Building on this insight, we develop an I2P registration framework using topology relationships. After that, to construct and leverage the topology relationships between the heterogeneous 2D and 3D spaces, we design a registration network, Top-I2P, with correction-based topology reasoning and fast topology feature interaction modules. Extensive experiments on 7-Scenes, RGBD-V2, ScanNet, and self-collected I2P datasets demonstrate that Top-I2P achieves superior registration performance in open-domain scenarios. Pei An, Jiaqi Yang 0002, Muyao Peng, You Yang 0002, Qiong Liu 0001, Jie Ma 0003, Liangliang Nan |
IJCAI | 3 |
| 2025 | Enhance Image-to-Point-Cloud Registration with Beltrami Flow
Pei An, You Yang 0002, Jiaqi Yang 0002, Muyao Peng, Qiong Liu 0001, Liangliang Nan |
Int. J. Comput. Vis. | 4 |
| 2023 | Pollutant Concentration Prediction Based on the Optimization of Long-Short Distance in SpaceabstractAs air pollution continues to pose a growing threat to human health and environmental well-being, accurate forecasting of pollutant concentration has become increasingly important. Existing prediction models can be divided into two categories: non-machine learning models and machine learning models. Nonmachine learning models excessively rely on historical data, while machine learning models have high time complexity and require large amounts of data. To solve the above problems, this paper proposes a spatial distance optimization-based model for predicting pollutant concentration. The proposed model uses a neural network for predicting pollutant concentration, with the nonlinear activation increasing the model's ability to fit nonlinear data. Additionally, it proposes a spatial distance optimization strategy that divides the surrounding monitoring stations based on their distance from the target station. As the neural network model deepens, the influence of more distant monitoring stations on the predicted values gradually reduces. The proposed model adapts the weights based on training errors, implicitly learning the distribution of the relationship between station distances and concentration values and fully exploiting the intrinsic information of the data. Simulation results show that the proposed model can achieve a prediction accuracy up to 6.38% higher than traditional methods. Muyao Peng, Yueli Wen |
TrustCom | 1 |