System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

A fast Kalman filter for images degraded by both blur and noise

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Biemond, J. ; Delft University of Technology, Delft, The Netherlands

An optimal line-by-line recursive Kalman filter is derived for restoring images which are degraded in a deterministic way by linear blur and in a stochastic way by additive white noise. To reduce the computational and storage burden imposed by this line-by-line recursive Kalman filter circulant matrix approximations are made in order to diagonalize - by means of the fast Fourier transform (FFT) - both the model matrices and the distortion matrix in the dynamical model of the total image-recording system. Then the dynamical model reduces to a set of N decoupled equations and the line-by-line recursive Kalman filter based on this model reduces to a set of N scalar Kalman filters suitable for parallel processing of the data in the Fourier domain. Finally, via an inverse FFT the filtered data is presented in the data domain. The total number of computations for an N×N image reduces from the order of 0(N4) to 0(N^{2}\log _{2}N) .

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '82.  (Volume:7 )

Date of Conference:

May 1982