Abstract
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
Full Article | PDF ArticleMore Like This
Yitzhak Yitzhaky, Ruslan Milberg, Sergei Yohaev, and Norman S. Kopeika
Appl. Opt. 38(20) 4325-4332 (1999)
Hu Zhu, Lizhen Deng, Xiaodong Bai, Meng Li, and Zhao Cheng
Appl. Opt. 54(14) 4337-4344 (2015)
Joanne Markham and José-Angel Conchello
J. Opt. Soc. Am. A 16(10) 2377-2391 (1999)