An iterative, all-pairs least-squares registration algorithm for unlabeled N-dimensional point sets, extending the authors' earlier 2D method, with closed-form updates and threshold-based pruning.
Least-squares fitting of t wo 3- D point sets,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CV 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm
An iterative, all-pairs least-squares registration algorithm for unlabeled N-dimensional point sets, extending the authors' earlier 2D method, with closed-form updates and threshold-based pruning.