By Topic

On the use of Lyapunov criteria to analyze the convergence of blind deconvolution algorithms

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)
D. Kundur ; Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada ; D. Hatzinakos

We present an approach to determine sufficient conditions for the global convergence of iterative blind deconvolution algorithms using finite impulse response (FIR) deconvolution filters. The novel technique, which incorporates Lyapunov's direct method, is general, flexible, and can be easily adapted to analyze the behavior of many types of nonlinear iterative signal processing algorithms. Specifically, we find sufficient conditions to guarantee a unique solution for the NAS-RIF algorithm used for blind image restoration. We determine that in many cases, there exists a tradeoff between the quality of the deconvolution result and the uniqueness of the solution. A procedure to determine the length of the deconvolution filter to guarantee a unique solution is established

Published in:

IEEE Transactions on Signal Processing  (Volume:46 ,  Issue: 11 )