A fast algorithm for the restoration of blurred binary images

Author

Carey, Jo-Anne ; De Jager, Gerhard

Author_Institution

Dept. of Electr. & Electron. Eng., Cape Town Univ., South Africa

fYear

1989

fDate

32682

Firstpage

91

Lastpage

92

Abstract

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

Keywords

digital filters; iterative methods; picture processing; Bracewell algorithm; blurred binary images; complex thresholding method; homomorphic-like filter; image restoration; iterations number reduction; Convolution; Filters; Frequency domain analysis; Image converters; Image restoration; Iterative algorithms; Machine vision; Noise reduction; Nonlinear optics; Transfer functions;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Signal Processing, 1989. COMSIG 1989. Proceedings., Southern African Conference on

Conference_Location

Stellenbosch

Print_ISBN

0-87942-713-2

Type

conf

DOI

10.1109/COMSIG.1989.129023

Filename

129023