The improvement of images obtained with annular apertures

Albrecht, Philipp; Bouchachia, Imane; Goebels, Norbert; Henke, Nadine; Hofstetter, Harald H.; Issberner, Andrea; Kovacs, Zsuzsa; Lewerenz, Jan; Lisak, Dmitrij; Maher, Pamela; Mausberg, Anne K.; Quasthoff, Kim; Zimmermann, Corinna; Hartung, Hans‐Peter; Methner, Axel

doi:10.1098/rspa.1961.0179

Cited by 8 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All the aperture patterns we consider in this work (top row) and their calibrated PSFs for two different blur scales (second and bottom row). (a) and (b) aperture masks used in both [13] and [43]; (c) annular mask used in [17]; (d) pattern proposed by [5]; (e) pattern proposed by [4]; (f) and (g) aperture masks used in [15]; (h) MURA pattern used in [10]. Fig.…”

Section: Coded Aperture Selectionmentioning

confidence: 99%

See 1 more Smart Citation

Single Image Blind Deconvolution with Higher-Order Texture Statistics

Martinello

Favaro

2011

Video Processing and Computational Video

View full text Add to dashboard Cite

Abstract. We present a novel method for solving blind deconvolution, i.e., the task of recovering a sharp image given a blurry one. We focus on blurry images obtained from a coded aperture camera, where both the camera and the scene are static, and allow blur to vary across the image domain. As most methods for blind deconvolution, we solve the problem in two steps: First, we estimate the coded blur scale at each pixel; second, we deconvolve the blurry image given the estimated blur. Our approach is to use linear high-order priors for texture and second-order priors for the blur scale map, i.e., constraints involving two pixels at a time. We show that by incorporating the texture priors in a least-squares energy minimization we can transform the initial blind deconvolution task in a simpler optimization problem. One of the striking features of the simplified optimization problem is that the parameters that define the functional can be learned offline directly from natural images via singular value decomposition. We also show a geometrical interpretation of image blurring and explain our method from this viewpoint. In doing so we devise a novel technique to design optimally coded apertures. Finally, our coded blur identification results in computing convolutions, rather than deconvolutions, which are stable operations. We will demonstrate in several experiments that this additional stability allows the method to deal with large blur. We also compare our method to existing algorithms in the literature and show that we achieve state-of-the-art performance with both synthetic and real data.

show abstract

Section: Coded Aperture Selectionmentioning

confidence: 99%

“…4. All the patterns have been proposed and used by other researchers [4,5,10,13,15,17]. For each mask and a given blur scale map d, we simulate a coded image by using eq.…”

Section: Performance Comparisonmentioning

confidence: 99%