Related papers: Strong Basin of Attraction for Unmixing Kernels Wi…
Point spread function (PSF) reconstruction (PSF-R) is a well established technique to determine reliably and accurately the PSF from Adaptive Optics (AO) control loop data. We have successfully applied this technique to improve the…
Multi-channel sparse blind deconvolution, or convolutional sparse coding, refers to the problem of learning an unknown filter by observing its circulant convolutions with multiple input signals that are sparse. This problem finds numerous…
We propose a first-order fast algorithm for the weighted max-min fair (MMF) multi-group multicast beamforming problem in large-scale systems. Utilizing the optimal multicast beamforming structure obtained recently, we convert the nonconvex…
In this work we derive analytic expressions and numerical recipes for finding the effective observed position of sources close enough on sky that their Point Spread Functions (PSF), modelled as Gaussian profiles, overlap. In particularly we…
Reconstruction of the point spread function (PSF) is a critical process in weak lensing measurement. We develop a real-data based and galaxy-oriented pipeline to compare the performances of various PSF reconstruction schemes. Making use of…
The filtering of a Markov diffusion process on a manifold from counting process observations leads to `large' changes in the conditional distribution upon an observed event, corresponding to a multiplication of the density by the intensity…
Consider the problem of inverse scattering of time-harmonic point sources from an infinite, penetrable rough interface with bounded obstacles buried in the lower half-space, where the interface is assumed to be a local perturbation of a…
A lighting-based multispectral imaging system using an RGB camera and a projector is one of the most practical and low-cost systems to acquire multispectral observations for estimating the scene's spectral reflectance information. However,…
Spectral unmixing (SU) is a data processing problem in hyperspectral remote sensing. The significant challenge in the SU problem is how to identify endmembers and their weights, accurately. For estimation of signature and fractional…
This paper describes a new algorithm for hyperspectral image unmixing. Most of the unmixing algorithms proposed in the literature do not take into account the possible spatial correlations between the pixels. In this work, a Bayesian model…
In this paper, we propose a successive pseudo-convex approximation algorithm to efficiently compute stationary points for a large class of possibly nonconvex optimization problems. The stationary points are obtained by solving a sequence of…
Magnetic Particle Imaging is an emerging imaging modality through which it is possible to detect tracers containing superparamagnetic nanoparticles. The exposure of the particles to dynamic magnetic fields generates a non-linear response…
We propose a new approach to linear ill-posed inverse problems. Our algorithm alternates between enforcing two constraints: the measurements and the statistical correlation structure in some transformed space. We use a non-linear multiscale…
We describe a rapid and direct method for regularizing, post-facto, the point-spread function (PSF) of a telescope or other imaging instrument, across its entire field of view. Imaging instruments in general blur point sources of light by…
Stein variational gradient descent (SVGD) is a non-parametric inference algorithm that evolves a set of particles to fit a given distribution of interest. We analyze the non-asymptotic properties of SVGD, showing that there exists a set of…
Statistical inference based on optimal transport offers a different perspective from that of maximum likelihood, and has increasingly gained attention in recent years. In this paper, we study univariate nonparametric shape-constrained…
Forecast reconciliation adjusts independently generated forecasts so that they satisfy some known constraints. While probabilistic forecast reconciliation is well established for linear constraints, some practical forecasting problems…
We propose a general scheme for solving convex and non-convex optimization problems on manifolds. The central idea is that, by adding a multiple of the squared retraction distance to the objective function in question, we "convexify" the…
We present the development of a data-driven, AI-based model of the Point Spread Function (PSF) that achieves higher accuracy than the current state-of-the-art approach, "PSF in the Full Field-of-View'' (PIFF). PIFF is widely used in leading…
Point-spread function of the probe forming optics ($PSF_{optics} $) is reported for the first time in an uncorrected (without multipole correctors) scanning electron microscope (SEM). In an SEM, the electron probe information is lost as the…