OSA's Digital Library

Applied Optics

Applied Optics


  • Vol. 42, Iss. 32 — Nov. 10, 2003
  • pp: 6488–6494

A method for local deconvolution

Timur E. Gureyev, Yakov I. Nesterets, Andrew W. Stevenson, and Stephen W. Wilkins  »View Author Affiliations

Applied Optics, Vol. 42, Issue 32, pp. 6488-6494 (2003)

View Full Text Article

Enhanced HTML    Acrobat PDF (1572 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools



A new method for deconvolution of one-dimensional and multidimensional data is suggested. The proposed algorithm is local in the sense that the deconvolved data at a given point depend only on the value of the experimental data and their derivatives at the same point. In a regularized version of the algorithm the deconvolution is constructed iteratively with the help of an approximate deconvolution operator that requires only the low-order derivatives of the data and low-order integral moments of the point-spread function. This algorithm is expected to be particularly useful in applications in which only partial knowledge of the point-spread function is available. We tested and compared the proposed method with some of the popular deconvolution algorithms using simulated data with various levels of noise.

© 2003 Optical Society of America

OCIS Codes
(100.1830) Image processing : Deconvolution
(100.2980) Image processing : Image enhancement
(100.3010) Image processing : Image reconstruction techniques
(100.3190) Image processing : Inverse problems
(100.6640) Image processing : Superresolution

Original Manuscript: May 1, 2003
Revised Manuscript: July 15, 2003
Published: November 10, 2003

Timur E. Gureyev, Yakov I. Nesterets, Andrew W. Stevenson, and Stephen W. Wilkins, "A method for local deconvolution," Appl. Opt. 42, 6488-6494 (2003)

Sort:  Author  |  Year  |  Journal  |  Reset  


  1. A. N. Tichonov, V. Arsenin, Solutions of Ill-Posed Problems (Wiley, New York, 1977).
  2. C. R. Vogel, Computational Methods for Inverse Problems (Society for Industrial and Applied Mathematics, Philadelphia, Pa., 2002). [CrossRef]
  3. W. H. Press, S. A. Teukolsky, W. T. Vetterling, B. P. Flannery, Numerical Recipes in C++. The Art of Scientific Computing, 2nd ed. (Cambridge U. Press, Cambridge, UK, 2002).
  4. W. H. Richardson, “Bayesian-based iterative method of image restoration,” J. Opt. Soc. Am. 62, 55–59 (1972). [CrossRef]
  5. R. G. Lane, “Methods for maximum-likelihood deconvolution,” J. Opt. Soc. Am. A 13, 1992–1998 (1996). [CrossRef]
  6. S. Prasad, “Statistical-information-based performance criteria for Richardson-Lucy image deblurring,” J. Opt. Soc. Am. A 19, 1286–1296 (2002). [CrossRef]
  7. S. F. Gull, G. J. Daniel, “Image reconstruction from incomplete and noisy data,” Nature (London) 272, 686–690 (1978). [CrossRef]
  8. J. Skilling, “Probabilistic data analysis: an introductory guide,” J. Microsc. (Oxford) 190, 28–36 (1998). [CrossRef]
  9. H. Graafsma, R. Y. de Vries, “Deconvolution of the two-dimensional point-spread function of area detectors using the maximum-entropy algorithm,” J. Appl. Crystallogr. 32, 683–691 (1999). [CrossRef]
  10. R. C. Puetter, “Pixons and Bayesian image reconstruction,” in Image Reconstruction and Restoration, T. J. Schulz, D. L. Snyder, eds., Proc. SPIE2302, 112–131 (1994). [CrossRef]
  11. For more detailed information on the Pixon method, see http://www.pixon.com .
  12. T. E. Gureyev, R. Evans, “Tomography of objects with a priori known internal geometry,” Inverse Probl. 14, 1469–1480 (1998). [CrossRef]

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited