skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

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

Abstract

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.

Authors:
Publication Date:
Research Org.:
Stanford Univ., CA (USA). Systems Optimization Lab.
OSTI Identifier:
6125034
Report Number(s):
SOL-89-5
ON: DE89013116
DOE Contract Number:
FG03-87ER25028
Resource Type:
Technical Report
Resource Relation:
Other Information: Portions of this document are illegible in microfiche products
Country of Publication:
United States
Language:
English
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; DATA; TRANSFORMATIONS; ANALYTICAL SOLUTION; ALGORITHMS; LEAST SQUARE FIT; LINEAR PROGRAMMING; TWO-DIMENSIONAL CALCULATIONS; INFORMATION; MATHEMATICAL LOGIC; MAXIMUM-LIKELIHOOD FIT; NUMERICAL SOLUTION; PROGRAMMING; 990230* - Mathematics & Mathematical Models- (1987-1989)

Citation Formats

Zikan, K. An efficient exact algorithm for the ''least squares'' image registration problems. United States: N. p., 1989. Web.
Zikan, K. An efficient exact algorithm for the ''least squares'' image registration problems. United States.
Zikan, K. 1989. "An efficient exact algorithm for the ''least squares'' image registration problems". United States. doi:.
@article{osti_6125034,
title = {An efficient exact algorithm for the ''least squares'' image registration problems},
author = {Zikan, K.},
abstractNote = {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.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = 1989,
month = 5
}

Technical Report:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that may hold this item. Keep in mind that many technical reports are not cataloged in WorldCat.

Save / Share:
  • This report describes the implementation of an algorithm of Stoer and Schittkowski for solving linearly constrained linear least-squares problems. These problems arise in many areas, particularly in data fitting where a model is provided and parameters in the model are selected to be a best least-squares fit to known experimental observations. By adding constraints to the least-squares fit, one can force user-specified properties on the parameters selected. The algorithm used applies a numerically stable implementation of the Gram-Schmidt orthogonalization procedure to deal with a factorization approach for solving the constrained least-squares problem. The software developed allows for either a user-suppliedmore » feasible starting point or the automatic generation of a feasible starting point, redecomposition after solving the problem to improve numerical accuracy, and diagnostic printout to follow the computations in the algorithm. In addition to a description of the actual method used to solve the problem, a description of the software structure and the user interfaces is provided, along with a numerical example. 3 figures, 1 table.« less
  • In this paper several algorithms are developed which extend the method of George and Heath for sparse linear least squares problems to include rank deficient problems, linear equality constrained problems, and updating of solutions. An application of these methods to the solution of sparse square nonsymmetric linear systems is also presented.
  • A new Gauss-Newton algorithm is presented for solving nonlinear least squares problems. The problem statement may include simple bounds or more general constraints on the unknowns. The algorithm uses a trust region that allows the objective function to increase with logic for retreating to best values. The computations for the linear problem are done using a least squares system solver that allows for simple bounds and linear constraints. The trust region limits are defined by a box around the current point. In its current form the algorithm is effective only for problems with small residuals, linear constraints and dense Jacobianmore » matrices. Results on a set of test problems are encouraging.« less
  • A new algorithm for solving a linear least-squares problem with linear constraints is presented. The constraints can be equality constraint equations and nonnegativity constraints on selected variables. This problem, while appearing to be quite special, is the core problem arising in the solution of the general linearly constrained linear least-squares problem. The reduction process of the general problem to the core problem can be done in many ways. Three such techniques are discussed. The method employed for solving the core problem is based on combining the equality constraints with differentially weighted least-squares equations to form an augmented least-squares system. Thismore » weighted least-squares system is solved with nonnegativity constraints on selected variables. Seven small examples, including a constrained least-squares curve fitting example, are presented. A reference to user instructions for subprograms to compute solutions of constrained least-squares problems is included. 3 figures, 9 tables.« less