The Sylvester and Bézout resultant matrices for blind image deconvolution

Blind image deconvolution (BID) is one of the most important problems in image processing and it requires the determination of an exact image F from a degraded form of it G when little or no information about F and the point spread function (PSF) H is known. Several methods have been developed for the solution of this problem, and one class of methods considers F; G and H to be bivariate polynomials in which the polynomial computations are implemented by the Sylvester or B ezout resultant matrices. This paper compares these matrices for the solution of the problem of BID, and it is shown that it reduces to a comparison of their e ectiveness for greatest common divisor (GCD) computations. This is a di cult problem because the determination of the degree of the GCD of two polynomials requires the calculation of the rank of a matrix, and this rank determines the size of the PSF. It is shown that although the B ezout matrix is symmetric (unlike the Sylvester matrix) and it is smaller than the Sylvester matrix, which have computational advantages, it yields consistently worse results than the Sylvester matrix for the size and coe cients of the PSF. Computational examples of blurred and deblurred images obtained with the Sylvester and B ezout matrices are shown and the superior results obtained with the Sylvester matrix are evident.