Efficient Global Point Cloud Alignment using Bayesian Nonparametric Mixtures
원문 초록
Point cloud alignment is a common problem in computer vision and robotics, with applications ranging from 3D object recognition to reconstruction. We propose a novel approach to the alignment problem that utilizes Bayesian nonparametrics to describe the point cloud and surface normal densities, and branch and bound (BB) optimization to recover the relative transformation. BB uses a novel, refinable, near-uniform tessellation of rotation space using 4D tetrahedra, leading to more efficient optimization compared to the common axis-angle tessellation. We provide objective function bounds for pruning given the proposed tessellation, and prove that BB converges to the optimum of the cost function along with providing its computational complexity. Finally, we empirically demonstrate the efficiency of the proposed approach as well as its robustness to real-world conditions such as missing data and partial overlap.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
SASep: Saliency-Aware Structured Separation of Geometry and Feature for Open Set Learning on Point Clouds
Topology-Guided Knowledge Distillation for Efficient Point Cloud Processing
One Noise to Rule Them All: Multi-View Adversarial Attacks with Universal Perturbation
Aligning Text, Images, and 3D Structure Token-by-Token
LM-MCVT: A Lightweight Multi-modal Multi-view Convolutional-Vision Transformer Approach for 3D Object Recognition
Occlusion-aware Text-Image-Point Cloud Pretraining for Open-World 3D Object Recognition
토론
이 논문과 연결된 포럼 글이 아직 없습니다.