Cart (Loading....) | Create Account
Close category search window
 

Research on a novel restoration algorithm of turbulence-degraded images with alternant iterations

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 $31
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

3 Author(s)
Chunsheng, Liu ; Inst. for Pattern Recognition and AI, State Key Laboratory of Image Processing and Intelligent Control, Huazhong Univ. of Science and Technology, Wuhan 430074, P. R. China ; Hanyu, Hong ; Tianxu, Zhang

A new restoration algorithm based on double loops and alternant iterations is proposed to restore the object image effectively from a few frames of turbulence-degraded images. Based on the double loops, the iterative relations for estimating the turbulent point spread function PSF and object image alternately are derived. The restoration experiments have been made on computers, showing that the proposed algorithm can obtain the optimal estimations of the object and the point spread function, with the feasibility and practicality of the proposed algorithm being convincing.

Published in:

Systems Engineering and Electronics, Journal of  (Volume:17 ,  Issue: 3 )

Date of Publication:

Sept. 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.