DocumentCode
330010
Title
Digital signal processing solutions to 2-D finite support blind deconvolution problems
Author
Yagle, Andrew E.
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
fYear
1998
fDate
4-7 Oct 1998
Firstpage
746
Abstract
The 2-D discrete blind deconvolution problem is to reconstruct an image defined at integer coordinates and having known finite spatial extent from its 2-D convolution with a similar and also-unknown point-spread function. This is significantly more difficult than the typical image restoration problem of deconvolving a known blurring function. Many methods for solving this problem are iterative and alternate between the spatial and wavenumber domains. These algorithms are not POCS and they tend to stagnate. We present a completely novel approach that uses a battery of digital signal processing algorithms to produce an algorithm that comes close to expressing the solution in closed form. The only requirement on the image and point-spread functions are that they each have finite spatial extent and be roughly bandlimited, so that a fractional spatial shift also has finite spatial extent (this requirement is almost always met in practice)
Keywords
deconvolution; discrete Fourier transforms; image reconstruction; multidimensional signal processing; 2-D discrete blind deconvolution problem; 2-D finite support blind deconvolution problems; bandlimited case; closed form solution; digital signal processing solutions; integer coordinates; point-spread function; reconstruction; spatial extent; spatial shift; Batteries; Convolution; Deconvolution; Digital signal processing; Frequency; Image reconstruction; Image restoration; Iterative algorithms; Iterative methods; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Image Processing, 1998. ICIP 98. Proceedings. 1998 International Conference on
Conference_Location
Chicago, IL
Print_ISBN
0-8186-8821-1
Type
conf
DOI
10.1109/ICIP.1998.727365
Filename
727365
Link To Document