Share Email Print
cover

Proceedings Paper

Practical configurations to recover the regularized least-squares solution
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Several engineering applications are concerned with the accurate and efficient identification of the least-squares (LS) solution. The computational and storage requirements to determine the LS solution become prohibitively large as the dimensions of the problem grow. This paper develops an algorithm which receives the least squares solution based on a steepest descent formulation. Among the advantages of this approach are improvements in computational and resource management, and ease of hardware implementation. The gradient matrix is evaluated using 2-D linear convolutions and an in- place update strategy. An iterative procedure is outlined and the regularized and unregularized LS solutions can be recovered. The extent of regularization is suitably controlled and imposes some constraints on the step size for steepest descent. The proposed approach is examined in the context of digital image restoration from spatially invariant linear blur degradation and compared with alternate strategies performing LS recovery.

Paper Details

Date Published: 18 October 1999
PDF: 11 pages
Proc. SPIE 3808, Applications of Digital Image Processing XXII, (18 October 1999); doi: 10.1117/12.365855
Show Author Affiliations
Ramakrishnan Sundaram, Information Systems, Inc. (United States)


Published in SPIE Proceedings Vol. 3808:
Applications of Digital Image Processing XXII
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top