scispace - formally typeset
Journal ArticleDOI

Least-squares estimation of transformation parameters between two point patterns

S. Umeyama
- 01 Apr 1991 - 
- Vol. 13, Iss: 4, pp 376-380
Reads0
Chats0
TLDR
The proposed theorem is a strict solution of the problem, and it always gives the correct transformation parameters even when the data is corrupted.
Abstract
In many applications of computer vision, the following problem is encountered. Two point patterns (sets of points) (x/sub i/) and (x/sub i/); i=1, 2, . . ., n are given in m-dimensional space, and the similarity transformation parameters (rotation, translation, and scaling) that give the least mean squared error between these point patterns are needed. Recently, K.S. Arun et al. (1987) and B.K.P. Horn et al. (1987) presented a solution of this problem. Their solution, however, sometimes fails to give a correct rotation matrix and gives a reflection instead when the data is severely corrupted. The proposed theorem is a strict solution of the problem, and it always gives the correct transformation parameters even when the data is corrupted. >

read more

Citations
More filters
Journal ArticleDOI

EPnP: An Accurate O(n) Solution to the PnP Problem

TL;DR: A non-iterative solution to the PnP problem—the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences—whose computational complexity grows linearly with n, which can be done in O(n) time by expressing these coordinates as weighted sum of the eigenvectors of a 12×12 matrix.
Journal ArticleDOI

Point Set Registration: Coherent Point Drift

TL;DR: A probabilistic method, called the Coherent Point Drift (CPD) algorithm, is introduced for both rigid and nonrigid point set registration and a fast algorithm is introduced that reduces the method computation complexity to linear.
Journal ArticleDOI

Medical image registration

TL;DR: Applications of image registration include combining images of the same subject from different modalities, aligning temporal sequences of images to compensate for motion of the subject between scans, image guidance during interventions and aligning images from multiple subjects in cohort studies.
Proceedings ArticleDOI

SVO: Fast semi-direct monocular visual odometry

TL;DR: A semi-direct monocular visual odometry algorithm that is precise, robust, and faster than current state-of-the-art methods and applied to micro-aerial-vehicle state-estimation in GPS-denied environments is proposed.
Book

Markov Random Field Modeling in Image Analysis

TL;DR: This detailed and thoroughly enhanced third edition presents a comprehensive study / reference to theories, methodologies and recent developments in solving computer vision problems based on MRFs, statistics and optimisation.
References
More filters
Journal ArticleDOI

Closed-form solution of absolute orientation using unit quaternions

TL;DR: A closed-form solution to the least-squares problem for three or more paints is presented, simplified by use of unit quaternions to represent rotation.
Journal ArticleDOI

Least-Squares Fitting of Two 3-D Point Sets

TL;DR: An algorithm for finding the least-squares solution of R and T, which is based on the singular value decomposition (SVD) of a 3 × 3 matrix, is presented.
Journal ArticleDOI

Closed-form solution of absolute orientation using orthonormal matrices

TL;DR: In this paper, a closed-form solution to the least square problem for three or more points is presented, which requires the computation of the square root of a symmetric matrix, and the best scale is equal to the ratio of the root-mean-square deviations of the coordinates in the two systems from their respective centroids.
Journal ArticleDOI

The matrix minimum principle

TL;DR: The purpose of this paper is to provide an alternate statement of the Pontryagin maximum principle as applied to systems which are most conveniently and naturally described by matrix, rather than vector, differential or difference equations.
Proceedings ArticleDOI

Polyhedral Object Recognition with Sparse Data - Validation of Interpretations.

TL;DR: In this article, a distributed array processor, AMT DAP, is used for the generation of feasible interpretations of scenes with sparse data, in a process that exploits n × n parallelism.
Related Papers (5)