Image restoration through subimages and confidence images. (English) Zbl 1058.94003

Authors’ summary: Some very effective but expensive image reconstruction algorithms cannot be applied to large images because of their cost. In this work, we first show how to apply such algorithms to subimages, giving improved reconstruction of regions of interest. Our second, contribution is to construct confidence intervals for pixel value by generalizing a theorem of D. O’Leary and B. Rust [SIAM J. Sci. Stat. Comput. 7, 473–489 (1986; Zbl 0593.65092)] to allow both upper and lower bounds on variables. All current algorithms for image deblurring or deconvolution output an image. This provides an estimated value for each pixel in the image. What is lacking is an estimate of the statistical confidence that we can have in those pixel values or in the features they form in the image. There are two obstacles in determining confidence intervals for pixel values: first, the process is computationally quite intensive, and second, there has been no proposal for providing the results in a visually useful way. In this work we overcome the first of those limitations and develop an algorithm called Twinkle to overcome the second. We demonstrate the usefulness of these techniques on astronomical and motion-blurred images.


94A08 Image processing (compression, reconstruction, etc.) in information and communication theory
65F10 Iterative numerical methods for linear systems
65F20 Numerical solutions to overdetermined systems, pseudoinverses
65F30 Other matrix algorithms (MSC2010)
68U10 Computing methodologies for image processing


Zbl 0593.65092
Full Text: EuDML EMIS