Paper
13 November 2000 Regularized solution of block-banded block Toeplitz systems
Dario Andrea Bini, A. Farusi, G. Fiorentino, Beatrice Meini
Author Affiliations +
Abstract
Given two n X n Toeplitz matrices T1 and T2, and a vector b (epsilon) Rn(2), consider the linear system Ax equals b - (eta) , where (eta) (epsilon) Rn(2) is an unknown vector representing the noise and A equals T1 (direct product) T2. Recovering approximations of x, given A and b, is encountered in image restoration problems. We propose a method for the approximation of the solution x that has good regularization properties. The algorithm is based on a modified version of Newton's iteration for matrix inversion and relies on the concept of approximate displacement rank. We provide a formal description of the regularization properties of Newton's iteration in terms of filters and determine bounds to the number of iterations that guarantee regularization. The method is extended to deal with more general systems where A equals (summation)i equals 1h T1(i) (direct product) T2(i). The cost of computing regularized inverses is O(n log n) operations (ops), the cost of solving the system Ax equals b is O(n2 log n) ops. Numerical experiments which show the effectiveness of our algorithm are presented.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Dario Andrea Bini, A. Farusi, G. Fiorentino, and Beatrice Meini "Regularized solution of block-banded block Toeplitz systems", Proc. SPIE 4116, Advanced Signal Processing Algorithms, Architectures, and Implementations X, (13 November 2000); https://doi.org/10.1117/12.406490
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Matrices

Point spread functions

Image restoration

Computing systems

Distance measurement

Radon

Computer architecture

Back to Top