5 October 2006 Parallelization of a blind deconvolution algorithm
Author Affiliations +
Abstract
Often it is of interest to deblur imagery in order to obtain higher-resolution images. Deblurring requires knowledge of the blurring function - information that is often not available separately from the blurred imagery. Blind deconvolution algorithms overcome this problem by jointly estimating both the high-resolution image and the blurring function from the blurred imagery. Because blind deconvolution algorithms are iterative in nature, they can take minutes to days to deblur an image depending how many frames of data are used for the deblurring and the platforms on which the algorithms are executed. Here we present our progress in parallelizing a blind deconvolution algorithm to increase its execution speed. This progress includes sub-frame parallelization and a code structure that is not specialized to a specific computer hardware architecture.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Charles L. Matson, Charles L. Matson, Kathy J. Borelli, Kathy J. Borelli, } "Parallelization of a blind deconvolution algorithm", Proc. SPIE 6394, Unmanned/Unattended Sensors and Sensor Networks III, 63940G (5 October 2006); doi: 10.1117/12.680843; https://doi.org/10.1117/12.680843
PROCEEDINGS
8 PAGES


SHARE
Back to Top