Related papers: Fast PSF Synthesis with Defocused and Spherical Ab…
In this article, we develop comprehensive frequency domain methods for estimating and inferring the second-order structure of spatial point processes. The main element here is on utilizing the discrete Fourier transform (DFT) of the point…
We present here a real-time analysis of diffraction images acquired at high frame-rate (925 Hz) and its application to macromolecular serial crystallography. The software uses a new signal separation algorithm, able to distinguish the…
The standard particle-in-cell algorithm suffers from grid heating. There exists a gridless alternative which bypasses the deposition step and calculates each Fourier mode of the charge density directly from the particle positions. We show…
Bayesian inference, while foundational to probabilistic reasoning, is often hampered by the computational intractability of posterior distributions, particularly through the challenging evidence integral. Conventional approaches like Markov…
The Fast Fourier Transform (FFT) is a fundamental tool for signal analysis, widely used across various fields. However, traditional FFT methods encounter challenges in adjusting the frequency bin interval, which may impede accurate spectral…
We propose a scheme for imaging periodic surfaces using a superlens. By employing an inverse scattering model and the transformed field expansion method, we derive an approximate reconstruction formula for the surface profile, assuming…
Context. Solar wavefront sensing has been a challenge for astrophysical instrumentalists, due to the low contrast between the Sun and the sky background compared to night-time observations, which limits the performance of adaptive optics…
Astrophysical images issued from different instruments and/or spectral bands often require to be processed together, either for fitting or comparison purposes. However each image is affected by an instrumental response, also known as PSF,…
Deconvolution is the most commonly used image processing method to remove the blur caused by the point-spread-function (PSF) in optical imaging systems. While this method has been successful in deblurring, it suffers from several…
Point Spread Function (PSF) engineering is used in single emitter localization to measure the emitter position in 3D and possibly other parameters such as the emission color or dipole orientation as well. Advanced PSF models such as spline…
Wide-field imaging has become a major challenge for modern radio astronomy, which uses high sensitivity acquisition systems that deal with huge amounts of data. In this paper we investigate a fast wide-field imaging solution based on the…
We present a new method for the generation of atmospheric turbulence phase screens based on the frequency shift property of the Fourier transform. This method produces low spatial frequency distortions without additional computation time…
We consider the problem of reconstructing a HxWx31 hyperspectral image from a HxW grayscale snapshot measurement that is captured using only a single diffractive optic and a filterless panchromatic photosensor. This problem is severely…
The inherent non-linearity of intensity correlation functions can be used to spatially distinguish identical emitters beyond the diffraction limit, as achieved, for example, in Super-Resolution Optical Fluctuation Imaging (SOFI). Here, we…
Resolving sources beyond the diffraction limit is important in imaging, communications, and metrology. Current image-based methods of super-resolution require phase information (either of the source points or an added filter) and perfect…
Fluorescence imaging is an essential diagnostic tool in many fields, but diffraction-limited optical imaging at depth is limited by scattering. Here, we present a method based on multiple random illuminations, combined with a computational…
This paper presents a new approach on stretch processing for a fine range estimation using MPM (Matrix Pencil Method). The conventional method utilizes FFT (Fast Fourier Transform) with limited range resolution with its fixed number of…
The Fast Fourier Transform (FFT) is a numerical operation that transforms a function into a form comprised of its constituent frequencies and is an integral part of scientific computation and data analysis. The objective of our work is to…
We present numerical methods based on the fast Fourier transform (FFT) to solve convolution integral equations on a semi-infinite interval (Wiener-Hopf equation) or on a finite interval (Fredholm equation). We extend and improve a FFT-based…
A non iterative direct blind deconvolution procedure, previously used successfully to sharpen Hubble Space Telescope imagery, is now found useful in sharpening nanoscale scanning electron microscope (SEM) and helium ion microscope (HIM)…