Point Set Voting for Partial Point Cloud Analysis
원문 초록
The continual improvement of 3D sensors has driven the development of algorithms to perform point cloud analysis. In fact, techniques for point cloud classification and segmentation have in recent years achieved incredible performance driven in part by leveraging large synthetic datasets. Unfortunately these same state-of-the-art approaches perform poorly when applied to incomplete point clouds. This limitation of existing algorithms is particularly concerning since point clouds generated by 3D sensors in the real world are usually incomplete due to perspective view or occlusion by other objects. This paper proposes a general model for partial point clouds analysis wherein the latent feature encoding a complete point clouds is inferred by applying a local point set voting strategy. In particular, each local point set constructs a vote that corresponds to a distribution in the latent space, and the optimal latent feature is the one with the highest probability. This approach ensures that any subsequent point cloud analysis is robust to partial observation while simultaneously guaranteeing that the proposed model is able to output multiple possible results. This paper illustrates that this proposed method achieves state-of-the-art performance on shape classification, part segmentation and point cloud completion.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
DDEQs: Distributional Deep Equilibrium Models through Wasserstein Gradient Flows
PointCA: Evaluating the Robustness of 3D Point Cloud Completion Models Against Adversarial Examples
3D Point Cloud Completion with Geometric-Aware Adversarial Augmentation
SMART-PC: Skeletal Model Adaptation for Robust Test-Time Training in Point Clouds
Hybrid-Emba3D: Geometry-Aware and Cross-Path Feature Hybrid Enhanced State Space Model for Point Cloud Classification
Streaming Sliced Optimal Transport
토론
이 논문과 연결된 포럼 글이 아직 없습니다.