Paper
23 August 2005 Blind deconvolution: from looking up to looking down
Author Affiliations +
Abstract
Multi-frame iterative blind deconvolution algorithms for image enhancement have been widely used for over ten years. Originally developed for enhancing astronomical images from large ground based telescopes, the algorithms were adapted for ground based satellite observations. Most algorithms involve some type of multi-frame iterative Bayesian optimization assuming either Poisson or Gaussian statistics. Many algorithms use an iterative conjugate gradient search technique, however it has been our experience that an algorithm based on Gaussian statistics, combined with projection onto convex sets adaptation leads to a simple algorithm that quickly converges to a result. Recently our thrust has been to transition these algorithms to the airborne imaging problem. We present a number of examples. First, results from observation of low earth orbit satellites with uncompensated data taken at the focal plane of a large telescope. Finally we move to the problem of air-to-ground imaging. Such scene based imaging scenarios require an algorithm that can operate in the presence of anisoplanatic effects. For this case we have developed an algorithm that calculates a position varying point-spread function.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
David Dayton and John Gonglewski "Blind deconvolution: from looking up to looking down", Proc. SPIE 5896, Unconventional Imaging, 589602 (23 August 2005); https://doi.org/10.1117/12.620089
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Deconvolution

Algorithm development

Point spread functions

Satellites

Optimization (mathematics)

Reconstruction algorithms

Satellite imaging

RELATED CONTENT


Back to Top