A fast algorithm for the restoration of blurred binary images
J.-A. Carey, Gerhard De Jager · 2003
R.N. Bracewell (1985) has proposed an iterative algorithm for the restoration of blurred binary images. The authors investigate the operation proposed by Bracewell and describe a method by which it can be speeded up. It is shown that the restoration of binary images as proposed by Bracewell can be implemented through the use of a homomorphic-like filter and speeded up by means of a more complex thresholding method. It is possible to reduce the number of iterations required to restore an image by choosing a better threshold than half the maximum value, the value used by Bracewell. Some results of the modified method are compared with those of the original one. It is clear that the modification achieves a more rapid response, but overshoot may limit its usefulness.>