Wavelet domain Bayesian denoising of string signal in the cosmic microwave background

An algorithm is proposed for denoising the signal induced by cosmic strings in the cosmic microwave background (CMB). A Bayesian approach is taken, based on modeling the string signal in the wavelet domain with generalized Gaussian distributions. Good performance of the algorithm is demonstrated by simulated experiments at arcminute resolution under noise conditions including primary and secondary CMB anisotropies, as well as instrumental noise.Comment: 16 pages, 11 figures. Version 2 matches version accepted for publication in MNRAS. Changes include substantial clarifications on our approach and a significant reduction of manuscript lengt

Exact reconstruction with directional wavelets on the sphere

A new formalism is derived for the analysis and exact reconstruction of band-limited signals on the sphere with directional wavelets. It represents an evolution of the wavelet formalism developed by Antoine & Vandergheynst (1999) and Wiaux et al. (2005). The translations of the wavelets at any point on the sphere and their proper rotations are still defined through the continuous three-dimensional rotations. The dilations of the wavelets are directly defined in harmonic space through a new kernel dilation, which is a modification of an existing harmonic dilation. A family of factorized steerable functions with compact harmonic support which are suitable for this kernel dilation is firstly identified. A scale discretized wavelet formalism is then derived, relying on this dilation. The discrete nature of the analysis scales allows the exact reconstruction of band-limited signals. A corresponding exact multi-resolution algorithm is finally described and an implementation is tested. The formalism is of interest notably for the denoising or the deconvolution of signals on the sphere with a sparse expansion in wavelets. In astrophysics, it finds a particular application for the identification of localized directional features in the cosmic microwave background (CMB) data, such as the imprint of topological defects, in particular cosmic strings, and for their reconstruction after separation from the other signal components.Comment: 22 pages, 2 figures. Version 2 matches version accepted for publication in MNRAS. Version 3 (identical to version 2) posted for code release announcement - "Steerable scale discretised wavelets on the sphere" - S2DW code available for download at http://www.mrao.cam.ac.uk/~jdm57/software.htm

End-to-end Interpretable Learning of Non-blind Image Deblurring

Non-blind image deblurring is typically formulated as a linear least-squares problem regularized by natural priors on the corresponding sharp picture's gradients, which can be solved, for example, using a half-quadratic splitting method with Richardson fixed-point iterations for its least-squares updates and a proximal operator for the auxiliary variable updates. We propose to precondition the Richardson solver using approximate inverse filters of the (known) blur and natural image prior kernels. Using convolutions instead of a generic linear preconditioner allows extremely efficient parameter sharing across the image, and leads to significant gains in accuracy and/or speed compared to classical FFT and conjugate-gradient methods. More importantly, the proposed architecture is easily adapted to learning both the preconditioner and the proximal operator using CNN embeddings. This yields a simple and efficient algorithm for non-blind image deblurring which is fully interpretable, can be learned end to end, and whose accuracy matches or exceeds the state of the art, quite significantly, in the non-uniform case.Comment: Accepted at ECCV2020 (poster

End-to-end Interpretable Learning of Non-blind Image Deblurring

International audienceNon-blind image deblurring is typically formulated as a linear least-squares problem regularized by natural priors on the corresponding sharp picture's gradients, which can be solved, for example, using a half-quadratic splitting method with Richardson fixed-point iterations for its least-squares updates and a proximal operator for the auxiliary variable updates. We propose to precondition the Richardson solver using approximate inverse filters of the (known) blur and natural image prior kernels. Using convolutions instead of a generic linear preconditioner allows extremely efficient parameter sharing across the image, and leads to significant gains in accuracy and/or speed compared to classical FFT and conjugate-gradient methods. More importantly, the proposed architecture is easily adapted to learning both the preconditioner and the proximal operator using CNN embeddings. This yields a simple and efficient algorithm for non-blind image deblurring which is fully interpretable, can be learned end to end, and whose accuracy matches or exceeds the state of the art, quite significantly, in the non-uniform case