By Topic

An efficient two-dimensional Chandrasekhar filter for restoration of images degraded by spatial 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
$33 $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

2 Author(s)
A. Mahalanabis ; Pennsylvania State University, University Park, PA ; Kefu Xue

In this paper, a new fast recursive filtering algorithm is proposed for the restoration of two-dimensional (2-D) images degraded by both spatial blur and additive white noise. It is assumed that the image is represented by a nonsymmetric half-plane (NSHP) model and the spatial blur is modeled by a finite extent spatially invariant, discrete, point spread function (PSF). A 2-D version of the Chandrasekhar filtering (CF) algorithm, which possesses better numerical properties and computational efficiency than the Kalman filtering (KF) algorithm, is developed. The computational requirements of the new algorithm are evaluated and compared to those of the 2-D KF algorithm. It is shown that for a 256 × 256 image, the 2-D CF algorithm requires less than 2.5 percent of the computational effort involved in the 2-D KF algorithm, and less than 12 percent of that involved in the 2-D reduced update Kalman filtering (RUKF) algorithm. Some experimental results based on a simulated image and a real image that demonstrate the filtering effectiveness and numerical stability of the new algorithm are also included.

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:35 ,  Issue: 11 )