|
|
Absolute Orientation - Horn's method 1.0 File ID: 80766 |
|---|
|
| Absolute Orientation - Horn's method 1.0 License: Shareware File Size: 20.5 KB Downloads: 12
| Submit Rating: |
|
|
|
Absolute Orientation - Horn's method 1.0 Description |
|---|
Description:
As input data, one has
A: a 2xN or 3xN matrix whos columns are the coordinates of N source points.
B: a 2xN or 3xN matrix whos columns are the coordinates of N target points.
The syntax
[regParams,Bfit,ErrorStats]=absor(A,B)
solves the unweighted/unscaled registration problem
min. sum_i ||R*A(:,i) + t - B(:,i)||^2
for unknown rotation matrix R and unknown translation vector t.
This is a special case of the more general problem
min. sum_i w(i)*||s*R*A(:,i) + t - B(:,i)||^2
where s>=0 is an unknown global scale factor, to be estimated along with R and t,
and w is a user-supplied length N vector of weights. One can include either
s or w or both in the problem formulation using the syntax,
[regParams,Bfit,ErrorStats]=absor(A,B,'param1',value1,'param2',value2,...)
with parameter/value pair options
'doScale' - Boolean flag. If TRUE, the global scale factor, s, is included.
Default=FALSE.
'weights' - the length N vector of weights, w. Default, no weighting.
OUTPUT:
regParams: structure output with estimated registration parameters,
regParams.R: The estimated rotation matrix, R
regParams.t: The estimated translation vector, t
regParams.s: The estimated scale factor (set to 1 if doScale=false).
regParams.M: Homogenous coordinate transform matrix [s*R,t;[0 0 ... 1]].
For 3D problems, the structure includes
regParams.q: A unit quaternion [q0 qx qy qz] corresponding to R and
signed to satisfy max(q)=max(abs(q))>0
For 2D problems, it includes
regParams.theta: the counter-clockwise rotation angle about the
2D origin
Bfit: The rotation, translation, and scaling (as applicable) of A that
best matches B.
ErrorStats: structure output with error statistics. In particular,
defining err(i)=sqrt(w(i))*norm( Bfit(:,i)-B(:,i) ),
it contains
ErrorStats.errlsq = norm(err)
ErrorStats.errmax = max(err) License: Shareware Related: output, parameters, Structure, regparams, regparamsr, regparamst, homogenous, coordinate, regparamsm O/S:BSD, Linux, Solaris, Mac OS X File Size: 20.5 KB Downloads: 12
|
|
| More Similar Code |
|---|
This script is capable of solving a convex quadratic programming problem by Wolf's method. For the convergence of the algorithm it is necessary that either Hessian of the objective function be positive definite or positive semidefinite Hessian with linear term zero. For theory of Wolf method and QPP one may see "Numerical Optimization with Applications, Chandra S., Jayadeva, Mehra A., Alpha Science Internatinal Ltd, 2009."
One of several approaches to outlier rejection, Peirce's method is more general than Chauvenet's method.
As constructed this works on univariate data only.
Newton's Method for Divided Differences.
The following formula is solved:
Pn(x) = f(x0) + f[x0,x1](x-x0) + f[x0,x1,x2](x-x0)(x-x1) + ... + f[x0,x1,..,xn](x-x0)(x-x1)..(x-x[n-1])
Where:
f[x0,x1] = (f(x1-f(x0))/(x1-x0)
Halley's method for solving equations of type f(x)=0.
Newton's method for solving a system of nonlinear equations, see http://en.wikipedia.org/wiki/Newton's_method
Newton(X,F,X0) solves nonlinear system F(x)=0 by Newton's method, using the given initial approximation X0. The derivative...
Raible's Method Rev.02
This script is used to compute the Raible table for any characteristics polynomial of f(Z) of any order (which saves alot of computing efforts.), accordingly the stability of discrete systems can be easily deduced, also...
A problem from Dynamics of Structures - Anil K. Chopra is picked and code written to solve the problem.The problem is to get the dynamic response of a structure using Newmark's method. System is a linear system.
% Program that use the Steffensen's method
% for calculate the wavelength of the ocean
% wave, when we know the period and the depth
% of the ocean.
This script implements Mandelbrot's method for generating realistic stock price graphs based on a simple fractal rule. It keeps subdividing the graph by three and adding a "generator" to create fractal behavior.
Reference:
Fast, fully vectorised version of the Simpson's method for 3D domains. This code avoids the use of any for loops etc. For a given level of accuracy it can be an order of magnitude or more faster than triplequad.
Examples are provided... |
| User Review for Absolute Orientation - Horn's method |
|
