Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPoint Spread Function Engineering for 3D Imaging of Space Debris using a Continuous Exact l0 Penalty (CEL0) Based Algorithm
47
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We consider three-dimensional (3D) localization and imaging of space debris from only one two-dimensional (2D) snapshot image. The technique involves an optical imager that exploits off-center image rotation to encode both the lateral and depth coordinates of point sources, with the latter being encoded in the angle of rotation of the PSF. We formulate 3D localization into a large-scale sparse 3D inverse problem in the discretized form. A recently developed penalty called continuous exact l0 (CEL0) is applied in this problem for the Gaussian noise model. Numerical experiments and comparisons illustrate the efficiency of the algorithm.
rate research
Read More
We present a virtual image refocusing method over an extended depth of field (DOF) enabled by cascaded neural networks and a double-helix point-spread function (DH-PSF). This network model, referred to as W-Net, is composed of two cascaded generator and discriminator network pairs. The first generator network learns to virtually refocus an input image onto a user-defined plane, while the second generator learns to perform a cross-modality image transformation, improving the lateral resolution of the output image. Using this W-Net model with DH-PSF engineering, we extend the DOF of a fluorescence microscope by ~20-fold. This approach can be applied to develop deep learning-enabled image reconstruction methods for localization microscopy techniques that utilize engineered PSFs to improve their imaging performance, including spatial resolution and volumetric imaging throughput.
A new method is presented for determining the Point Spread Function (PSF) of images that lack bright and isolated stars. It is based on the same principles as the MCS (Magain, Courbin, Sohy, 1998) image deconvolution algorithm. It uses the information contained in all stellar images to achieve the double task of reconstructing the PSFs for single or multiple exposures of the same field and to extract the photometry of all point sources in the field of view. The use of the full information available allows to construct an accurate PSF. The possibility to simultaneously consider several exposures makes it very well suited to the measurement of the light curves of blended point sources from data that would be very difficult or even impossible to analyse with traditional PSF fitting techniques. The potential of the method for the analysis of ground-based and space-based data is tested on artificial images and illustrated by several examples, including HST/NICMOS images of a lensed quasar and VLT/ISAAC images of a faint blended Mira star in the halo of the giant elliptical galaxy NGC5128 (Cen A).
Optimization-based samplers such as randomize-then-optimize (RTO) [2] provide an efficient and parallellizable approach to solving large-scale Bayesian inverse problems. These methods solve randomly perturbed optimization problems to draw samples from an approximate posterior distribution. Correcting these samples, either by Metropolization or importance sampling, enables characterization of the original posterior distribution. This paper focuses on the scalability of RTO to problems with high- or infinite-dimensional parameters. We introduce a new subspace acceleration strategy that makes the computational complexity of RTO scale linearly with the parameter dimension. This subspace perspective suggests a natural extension of RTO to a function space setting. We thus formalize a function space version of RTO and establish sufficient conditions for it to produce a valid Metropolis-Hastings proposal, yielding dimension-independent sampling performance. Numerical examples corroborate the dimension-independence of RTO and demonstrate sampling performance that is also robust to small observational noise.
The recent application of Fourier Based Iterative Reconstruction Method (FIRM) has made it possible to achieve high-quality 2D images from a fan beam Computed Tomography (CT) scan with a limited number of projections in a fast manner. The proposed methodology in this article is designed to provide 3D Radon space in linogram fashion to facilitate the use of FIRM with cone beam projections (CBP) for the reconstruction of 3D images in a low dose Cone Beam CT (CBCT).
We consider a finite element method with symmetric stabilisation for the discretisation of the transient convection--diffusion equation. For the time-discretisation we consider either the second order backwards differentiation formula or the Crank-Nicolson method. Both the convection term and the associated stabilisation are treated explicitly using an extrapolated approximate solution. We prove stability of the method and the $tau^2 + h^{p+{frac12}}$ error estimates for the $L^2$-norm under either the standard hyperbolic CFL condition, when piecewise affine ($p=1$) approximation is used, or in the case of finite element approximation of order $p ge 1$, a stronger, so-called $4/3$-CFL, i.e. $tau leq C h^{4/3}$. The theory is illustrated with some numerical examples.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
