Abstract

The problem of removing or minimizing degradations in a blurred and noisy image is known as image restoration. The computational kernel of many image restoration problems is the solution of the following inverse problem: Hf=g+/spl eta/ where where the n/sup 2/-vectors f and g represent the real and the observed image, respectively. The n/sup 2/ vector /spl eta/ is an additive noise which is usually unknown. The n/sup 2//spl times/ n/sup 2/-matrix H is the point spread function matrix and it represents the blurring process. The inverse problem consists in the computation of an approximation to the original image vector f, from known values of g and H. In such cases the restoration problem typically leads to a discrete ill-posed inverse problem. The classical way to compute a reasonable solution is to regularize the discrete problem. We explore the possible use of the fast wavelet transform-based preconditioners for the efficient solution of image restoration problems.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call