Learn More
Submittal of an algorithm for consideration for publication in Communications of the ACM implies unrestricted use of the algorithm within a computer is permissible. General permission to republish, but not for profit, all or part of this material is granted provided that ACM's copyright notice is given and that reference is made to the publication, to its(More)
A formulation of the maximum entropy (ME) method is described, where the data constraints are expressed in the form of fixed bounds on the elements of an orthogonal transform of the model. The bounds are set on the basis of both the observed data and an estimate of the noise statistics in the transform domain; prior knowledge, if available, can also be(More)
DESCRIPTION The algorithm calculates a Chebyshev (or l~) solution to an m X n overdetermined system of linear equations Ax = b, i.e. given equations the subroutine determines a vector x* = ['xl*, x~*,..., x,,*'] r which minimizes the maximum absolute value of the residuals (1) The algorithm can be used to solve the linear Chebyshev data fitting problem.(More)
The development of reliable software tools to aid human interpretation of complex digital images is of increasing importance. In particular, change detection requires that two or more images be carefully overlaid (registered) using digital techniques that compensate for picture distortions caused by sensor motion, ambient conditions, etc. We are primarily(More)
When analyzing linear systems of equations, the most important indicator of potential instability is the condition number of the matrix. For a convolution matrix W formed from a series w (where Wij defines the stabirity of the deconvolution process. For the larger con-volution matrices commonly encountered in practice, direct computation of the condition(More)