Algorithms for Structured Total Least Squares Problems with Applications to Blind Image Deblurring
| dc.contributor.author | Kalsi, Anoop | en_US |
| dc.contributor.author | O'Leary, Dianne | en_US |
| dc.date.accessioned | 2004-05-31T23:20:22Z | |
| dc.date.available | 2004-05-31T23:20:22Z | |
| dc.date.created | 2002-08 | en_US |
| dc.date.issued | 2002-08-30 | en_US |
| dc.description.abstract | Mastronardi, Lemmerling, and van Huffel presented an algorithm for solving a total least squares problem when the matrix and its perturbations are Toeplitz. A Toeplitz matrix is a special kind of matrix with small displacement rank. Here we generalize the fast algorithm to any matrix with small displacement rank. In particular, we show how to efficiently construct the generators whenever M has small displacement rank and show that in many important cases the Cholesky factorization of the matrix M^TM can also be determined fast. We further extend this problem to Tikhonov regularization of ill-posed problems and illustrate the use of the algorithm on an image deblurring problem. (Also UMIACS-TR-2002-70) | en_US |
| dc.format.extent | 1340280 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/1217 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-4390 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-2002-70 | en_US |
| dc.title | Algorithms for Structured Total Least Squares Problems with Applications to Blind Image Deblurring | en_US |
| dc.type | Technical Report | en_US |