Algorithms for Structured Total Least Squares Problems with Applications to Blind Image Deblurring

dc.contributor.authorKalsi, Anoopen_US
dc.contributor.authorO'Leary, Dianneen_US
dc.date.accessioned2004-05-31T23:20:22Z
dc.date.available2004-05-31T23:20:22Z
dc.date.created2002-08en_US
dc.date.issued2002-08-30en_US
dc.description.abstractMastronardi, 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.extent1340280 bytes
dc.format.mimetypeapplication/postscript
dc.identifier.urihttp://hdl.handle.net/1903/1217
dc.language.isoen_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-4390en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-2002-70en_US
dc.titleAlgorithms for Structured Total Least Squares Problems with Applications to Blind Image Deblurringen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 2 of 2
No Thumbnail Available
Name:
CS-TR-4390.ps
Size:
1.28 MB
Format:
Postscript Files
Loading...
Thumbnail Image
Name:
CS-TR-4390.pdf
Size:
370.4 KB
Format:
Adobe Portable Document Format
Description:
Auto-generated copy of CS-TR-4390.ps