CONFERENCE PROCEEDINGS
Advanced Search
Home > Proceedings > Volume 8133 > Article
Paper
14 September 2011 Completely localized and parallel iterative algorithms for shift-variant image deblurring
Shekhar B. Sastry, Murali Subbarao
Author Affiliations +
Proceedings Volume 8133, Dimensional Optical Metrology and Inspection for Practical Applications; 81330N (2011) https://doi.org/10.1117/12.892409
Event: SPIE Optical Engineering + Applications, 2011, San Diego, California, United States
Abstract
Two completely localized algorithms for deblurring shift-variant defocused images are presented. The algorithms exploit limited support domain of 2D shift-variant point spread functions (PSFs) to localize the deblurring process. Focused image at each pixel is modeled by a truncated Taylor-series polynomial and a localized equation is obtained which expresses the blurred image as a function of the focused image and its derivatives. This localized equation forms the basis of the two algorithms. The first algorithm iteratively improves the estimated focused image by directly evaluating the localized equation for a given blurred image. The second algorithm uses the localized equation in a gradient descent method to improve the focused image estimate. The algorithms use spatial derivatives of the estimate and hence exploit smoothness to reduce computation. However, no assumptions about the blurring PSFs such as circular symmetry or separability are required for computational efficiency. Due to complete localization, the algorithms are fully parallel, that is, focused image estimates at each pixel can be computed independently. Performance of the algorithms is compared quantitatively with other shift-variant image restoration techniques, both for computational efficiency and for robustness against noise. The new algorithms are found to be faster and do not produce any blocking artifacts that are present in sectioning methods for image restoration. Further, the algorithms are stable and work satisfactorily even in the presence of large blur. Simulation results of the algorithms are presented for both Cylindrical and Gaussian PSFs. The performance of the algorithms on real data is discussed.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Citation Download Citation
Shekhar B. Sastry and Murali Subbarao "Completely localized and parallel iterative algorithms for shift-variant image deblurring", Proc. SPIE 8133, Dimensional Optical Metrology and Inspection for Practical Applications, 81330N (14 September 2011); https://doi.org/10.1117/12.892409
ACCESS THE FULL ARTICLE
ORGANIZATIONAL
Sign in with credentials provided by your organization.
INSTITUTIONAL
Select your institution to access the SPIE Digital Library.
SELECT YOUR INSTITUTION
PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.
PERSONAL SIGN IN
No SPIE Account? Create one
PURCHASE THIS CONTENT
SUBSCRIBE TO DIGITAL LIBRARY
50 downloads per 1-year subscription
Members: $195
Non-members: $335 ADD TO CART
25 downloads per 1 - year subscription
Members: $145
Non-members: $250 ADD TO CART
PURCHASE SINGLE ARTICLE
Includes PDF, HTML & Video, when available
Members: $17.00
Non-members: $21.00 ADD TO CART
PROCEEDINGS
 11 PAGES
DOWNLOAD PAPER SAVE TO MY LIBRARY
GET CITATION
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Point spread functions
Image analysis
Image restoration
Signal to noise ratio
Iterative methods
Algorithm development
Image processing
RELATED CONTENT
Subscribe to Digital Library
Receive Erratum Email Alert
Back to Top