A Coprime Blurred Pair (CBP) is constructed by blurring the same latent image
with two unknown kernels, where the two kernels are coprime when mapped to bivariate polynomials under the z-
transform.the blurred contents in a CBP
are difficult to restore using conventional blind deconvolution methods based on sparsity priors. We therefore introduce a new coprime prior for recovering the latent image in
a CBP. Our solution maps the CBP to bivariate polynomials
and sample them on the unit circle in both dimension. We
show that coprimality can be derived in terms of the rank of
the B¨¦zout Matrix formed by the sampled polynomials
and we present an efficient algorithm to factor the B¨¦zout
Matrix for recovering the latent image.
|