Constraint matrix factorization for space variant PSFs field restoration

DOI10.1088/0266-5611/32/12/124001MaRDI QIDQ2957528zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 26 January 2017

Published in Inverse Problems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1608.08104

zbMATH Keywords

dimension reductionmatrix factorizationsparsityspatial analysissuper-resolution

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computational methods for problems pertaining to astronomy and astrophysics (85-08) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Abstract: Context: in large-scale spatial surveys, the Point Spread Function (PSF) varies across the instrument field of view (FOV). Local measurements of the PSFs are given by the isolated stars images. Yet, these estimates may not be directly usable for post-processings because of the observational noise and potentially the aliasing. Aims: given a set of aliased and noisy stars images from a telescope, we want to estimate well-resolved and noise-free PSFs at the observed stars positions, in particular, exploiting the spatial correlation of the PSFs across the FOV. Contributions: we introduce RCA (Resolved Components Analysis) which is a noise-robust dimension reduction and super-resolution method based on matrix factorization. We propose an original way of using the PSFs spatial correlation in the restoration process through sparsity. The introduced formalism can be applied to correlated data sets with respect to any euclidean parametric space. Results: we tested our method on simulated monochromatic PSFs of Euclid telescope (launch planned for 2020). The proposed method outperforms existing PSFs restoration and dimension reduction methods. We show that a coupled sparsity constraint on individual PSFs and their spatial distribution yields a significant improvement on both the restored PSFs shapes and the PSFs subspace identification, in presence of aliasing. Perspectives: RCA can be naturally extended to account for the wavelength dependency of the PSFs.

Recommendations

• Point spread function field learning based on optimal transport distances
• Space Variant Blind Image Restoration
• Galaxy image restoration with shape constraint
• Point-spread function identification in an image restoration problem
• A convergent blind deconvolution method for post-adaptive-optics astronomical imaging

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A New and Improved Quantitative Recovery Analysis for Iterative Hard Thresholding Algorithms in Compressed Sensing
• Eigenvalues of the Laplacian of a graph^∗
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Fast multidimensional convolution in low-rank tensor formats via cross approximation
• Homotopy Based Algorithms for $\ell _{\scriptscriptstyle 0}$-Regularized Least-Squares
• Iterative thresholding for sparse approximations
• Multi-scale geometric methods for data sets. II: Geometric multi-resolution analysis
• Point spread function calibration requirements for dark energy from cosmic shear
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Sparse image and signal processing. Wavelets, curvelets, morphological diversity
• Sparse wavelet representations of spatially varying blurring operators
• Starlet Transform in Astronomical Data Processing
• Treelets -- an adaptive multi-scale basis for sparse unordered data
• Wavelets on graphs via spectral graph theory

Cited in

(2)

• Point spread function field learning based on optimal transport distances
• Rethinking data-driven point spread function modeling with a differentiable optical model

This page was built for publication: Constraint matrix factorization for space variant PSFs field restoration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957528)