Learning Point Spread Function Invertibility Assessment for Image Deconvolution
Deep-learning (DL)-based image deconvolution (ID) has exhibited remarkable recovery performance, surpassing traditional linear methods. However, unlike traditional ID approaches that rely on analytical properties of the point spread function (PSF) to achieve high recovery performance - such as specific spectrum properties or small conditional numbers in the convolution matrix - DL techniques lack quantifiable metrics for evaluating PSF suitability for DL-assisted recovery. Aiming to enhance deconvolution quality, we propose a metric that employs a non-linear approach to learn the invertibility of an arbitrary PSF using a neural network by mapping it to a unit impulse. A lower discrepancy between the mapped PSF and a unit impulse indicates a higher likelihood of successful inversion by a DL network. Our findings reveal that this metric correlates with high recovery performance in DL and traditional methods, thereby serving as an effective regularizer in deconvolution tasks. This approach reduces the computational complexity over conventional condition number assessments and is a differentiable process. These useful properties allow its application in designing diffractive optical elements through end-to-end (E2E) optimization, achieving invertible PSFs, and outperforming the E2E baseline framework.
Code (0)
등록된 구현이 없습니다.
Tasks
Image DeconvolutionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Point Spread Function Modelling for Wide Field Small Aperture Telescopes with a Denoising Autoencoder
The point spread function reflects the state of an optical telescope and it is important for data post-processing methods design. For wide field small aperture telescopes, the point spread function is hard to model, beca…
DenoisingProduction Function Estimation without Invertibility: Imperfectly Competitive Environments and Demand Shocks
We advance the proxy variable approach to production function estimation. We show that the invertibility assumption at its heart is testable. We characterize what goes wrong if invertibility fails and what can still be d…
A Class of DCT Approximations Based on the Feig-Winograd Algorithm
A new class of matrices based on a parametrization of the Feig-Winograd factorization of 8-point DCT is proposed. Such parametrization induces a matrix subspace, which unifies a number of existing methods for DCT approxi…
Image CompressionSQAD: Automatic Smartphone Camera Quality Assessment and Benchmarking
Smartphone photography is becoming increasingly popular, but fitting high-performing camera systems within the given space limitations remains a challenge for manufacturers. As a result, powerful mobile camera system…
BenchmarkingNeural Networks Preserve Invertibility Across Iterations: A Possible Source of Implicit Data Augmentation
Determining what kind of representations neural networks learn, and how this may relate to generalization, remains a challenging problem. Previous work has utilized a rich set of methods to invert layer representations o…
Data Augmentation