A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In this paper, we propose a method to find the best Kronecker product approximation of the blurring operator which arises in three dimensional image restoration problems. We show that this problem can be reduced to a well known rank-1 approximation of the scaled three dimensional point spread function (PSF) array, which is much smaller. This approximation can be used as a preconditioner in solving image restoration problems with iterative methods. The comparison of the approximation by the newdoi:10.1137/130917260 fatcat:bymfktq7kvdahmjmzgm6topwn4