An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm
An unsupervised, iterative point-set registration algorithm for an unlabeled (i.e. correspondence between points is unknown) N-dimensional Euclidean point-cloud is proposed. It is based on linear least squares, and considers all possible point pairings and iteratively aligns the two sets until the number of point pairs does not exceed the maximum number of allowable one-to-one pairings.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Sampling Network Guided Cross-Entropy Method for Unsupervised Point Cloud Registration
In this paper, by modeling the point cloud registration task as a Markov decision process, we propose an end-to-end deep model embedded with the cross-entropy method (CEM) for unsupervised 3D registration. Our model cons…
Point Cloud RegistrationIterative Feedback Network for Unsupervised Point Cloud Registration
As a fundamental problem in computer vision, point cloud registration aims to seek the optimal transformation for aligning a pair of point clouds. In most existing methods, the information flows are usually forward trans…
Point Cloud RegistrationCoherent Point Drift Networks: Unsupervised Learning of Non-Rigid Point Set Registration
Given new pairs of source and target point sets, standard point set registration methods often repeatedly conduct the independent iterative search of desired geometric transformation to align the source point set with th…
Planning with Learned Dynamic Model for Unsupervised Point Cloud Registration
Point cloud registration is a fundamental problem in 3D computer vision. In this paper, we cast point cloud registration into a planning problem in reinforcement learning, which can seek the transformation between the so…
Point Cloud RegistrationArticulated Shape Matching Using Laplacian Eigenfunctions and Unsupervised Point Registration
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to map these graphs onto lower dimensional …
ClusteringGraph Matching