An efficient exact algorithm for the ''least squares'' image registration problems

Technical Report · Mon May 01 04:00:00 EDT 1989

DOI:https://doi.org/10.2172/6125034· OSTI ID:6125034

Zikan, K.

Image registration involves estimating how one set of n-dimensional points is rotated, scaled, and translates into a second set of n- dimensional points. In practice, n is usually 2 or 3. We give an exact algorithm to solve the ''least-squares'' formulation of the two-dimensional registration problem. The algorithm, which is based on parametric linear programming, can be viewed as a refinement of the O(k/sup 3/) approximation method proposed by Zikan and Silberburg. The approach can be extended to handle registration of images of different cardinalities. 13 refs., 1 fig.

• Research Organization: Stanford Univ., CA (USA). Systems Optimization Lab.
• DOE Contract Number: FG03-87ER25028
• OSTI ID: 6125034
• Report Number(s): SOL-89-5; ON: DE89013116
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990230* -- Mathematics & Mathematical Models-- (1987-1989)
ALGORITHMS
ANALYTICAL SOLUTION
DATA
INFORMATION
LEAST SQUARE FIT
LINEAR PROGRAMMING
MATHEMATICAL LOGIC
MAXIMUM-LIKELIHOOD FIT
NUMERICAL SOLUTION
PROGRAMMING
TRANSFORMATIONS
TWO-DIMENSIONAL CALCULATIONS