Constraint matrix factorization for space variant PSFs field restoration
From MaRDI portal
Publication:2957528
DOI10.1088/0266-5611/32/12/124001zbMath1354.94006arXiv1608.08104OpenAlexW3099740719WikidataQ113091910 ScholiaQ113091910MaRDI QIDQ2957528
No author found.
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
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computational methods for problems pertaining to astronomy and astrophysics (85-08)
Related Items
Point Spread Function Field Learning Based on Optimal Transport Distances, Rethinking data-driven point spread function modeling with a differentiable optical model
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Multi-scale geometric methods for data sets. II: Geometric multi-resolution analysis
- Wavelets on graphs via spectral graph theory
- Iterative thresholding for sparse approximations
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Treelets -- an adaptive multi-scale basis for sparse unordered data
- Sparse Wavelet Representations of Spatially Varying Blurring Operators
- A New and Improved Quantitative Recovery Analysis for Iterative Hard Thresholding Algorithms in Compressed Sensing
- Point spread function calibration requirements for dark energy from cosmic shear
- Eigenvalues of the Laplacian of a graph∗
- Homotopy Based Algorithms for $\ell _{\scriptscriptstyle 0}$-Regularized Least-Squares
- Starlet Transform in Astronomical Data Processing
- Fast Multidimensional Convolution in Low-Rank Tensor Formats via Cross Approximation
- Sparse Image and Signal Processing
