Related papers: Accurate Kappa Reconstruction Algorithm for masked…

This paper presents a new method for the reconstruction of weak lensing mass maps. It uses the multiscale entropy concept, which is based on wavelets, and the False Discovery Rate which allows us to derive robust detection levels in wavelet…

Robust PCA is a widely used statistical procedure to recover a underlying low-rank matrix with grossly corrupted observations. This work considers the problem of robust PCA as a nonconvex optimization problem on the manifold of low-rank…

Cosmological weak lensing has been a highly successful and rapidly developing research field since the first detection of cosmic shear in 2000. However, it has recently been pointed out in Yoo et al. that the standard weak lensing formalism…

Current deep image super-resolution (SR) approaches aim to restore high-resolution images from down-sampled images or by assuming degradation from simple Gaussian kernels and additive noises. However, these techniques only assume crude…

We present a survey of the cosmological applications of the next generation of weak lensing surveys, paying special attention to the computational challenges presented by the number of galaxies, $N_{gal} ~$ 10$^{5}$. We focus on optimal…

We propose a new model-based algorithm solving the inverse rig problem in facial animation retargeting, exhibiting higher accuracy of the fit and sparser, more interpretable weight vector compared to SOTA. The proposed method targets a…

One of the primary goals of next-generation gravitational lensing surveys is to measure the large-scale distribution of dark matter, which requires accurate mass inversion to convert weak-lensing shear maps into convergence (kappa) fields.…

We present a Bayesian graph neural network (BGNN) that can estimate the weak lensing convergence ($\kappa$) from photometric measurements of galaxies along a given line of sight. The method is of particular interest in strong gravitational…

Weak lensing provides a direct way of mapping the density distribution in the universe. To reconstruct the density field from the shear catalog, an important step is to build the shear field from the shear catalog, which can be quite…

We study the accuracy with which weak lensing measurements could be made from a future space-based survey, predicting the subsequent precisions of 3-dimensional dark matter maps, projected 2-dimensional dark matter maps, and mass-selected…

We improve the ERA(Ellipticity of Re-smeared Artificial image) method of PSF(Point Spread Function) correction in weak lensing shear analysis in order to treat realistic shape of galaxies and PSF. This is done by re-smearing PSF and the…

We present a new method to extract cosmological constraints from weak lensing (WL) peak counts, which we denote as `the hierarchical algorithm'. The idea of this method is to combine information from WL maps sequentially smoothed with a…

We use the modified Richardson-Lucy deconvolution algorithm to reconstruct the Primordial Power Spectrum from the Weak Lensing Power spectrum reconstructed from the CMB anisotropies. This provides an independent window to observe and…

Multiple rotation averaging (MRA) is a fundamental optimization problem in 3D vision and robotics that aims to recover globally consistent absolute rotations from noisy relative measurements. Established classical methods, such as L1-IRLS…

In recent work, robust Principal Components Analysis (PCA) has been posed as a problem of recovering a low-rank matrix $\mathbf{L}$ and a sparse matrix $\mathbf{S}$ from their sum, $\mathbf{M}:= \mathbf{L} + \mathbf{S}$ and a provably exact…

Reconstruction of images from noisy linear measurements is a core problem in image processing, for which convex optimization methods based on total variation (TV) minimization have been the long-standing state-of-the-art. We present an…

We introduce a novel framework for an approxi- mate recovery of data matrices which are low-rank on graphs, from sampled measurements. The rows and columns of such matrices belong to the span of the first few eigenvectors of the graphs…

We propose a novel method to reconstruct high-resolution three-dimensional mass maps using data from photometric weak-lensing surveys. We apply an adaptive LASSO algorithm to perform a sparsity-based reconstruction on the assumption that…

We provide a complete characterization of the randomized Kaczmarz algorithm (RKA) for inconsistent linear systems. The Kaczmarz algorithm, known in some fields as the algebraic reconstruction technique, is a classical method for solving…

We explore a variety of statistics of clusters selected with cosmic shear measurement by utilizing both analytic models and large numerical simulations. We first develop a halo model to predict the abundance and the clustering of weak…