Related papers: FFT based evaluation of microlensing magnification…
Source extension is a reformulation of inverse problems in wave propagation, that at least in some cases leads to computationally tractable iterative solution methods. The core subproblem in all source extension methods is the solution of a…
In this paper, we propose a new regression-based algorithm to compute Graph Fourier Transform (GFT). Our algorithm allows different regularizations to be included when computing the GFT analysis components, so that the resulting components…
We investigate the extended source size effects on gravitational lensing in which a lens consists of a smooth potential and small mass clumps (``substructure lensing''). We first consider a lens model that consists of a clump modeled as a…
Recent discussion of the effects of finite source size on high magnification microlensing events due to MACHOs motivates a study into the feasibility of observing such effects and extracting the source radius. Simulated observations are…
If an extended source, such as a galaxy, is gravitationally lensed by a massive object in the foreground, the lensing distorts the observed image. It is straightforward to simulate what the observed image would be for a particular lens and…
We present a general surface brightness correction method for compact extended sources imaged in the slow-scan pointed observation mode of the Far-Infrared Surveyor (FIS) aboard the AKARI Infrared Astronomical Satellite. Our method recovers…
In measuring the power spectrum of the distribution of large numbers of dark matter particles in simulations, or galaxies in observations, one has to use Fast Fourier Transforms (FFT) for calculational efficiency. However, because of the…
2D convolution is a staple of digital image processing. The advent of large format imagers makes it possible to literally ``pave'' with silicon the focal plane of an optical sensor, which results in very large images that can require a…
The Fractional Fourier Transform (FRT) corresponds to an arbitrary-angle rotation in the phase space, e.g. the time-frequency (TF) space, and generalizes the fundamentally important Fourier Transform. FRT applications range from classical…
When a luminous source is extended, its distortions by weak gravitational lensing are richer than a mere combination of magnification and shear. In a recent work, we proposed an elegant formalism based on complex analysis to describe and…
Feature Transformation is crucial for classic machine learning that aims to generate feature combinations to enhance the performance of downstream tasks from a data-centric perspective. Current methodologies, such as manual expert-driven…
A new multifocus image fusion approach is presented in this paper. First the contourlet transform is used to decompose the source images into different components. Then, some salient features are extracted from components. In order to…
In this paper, we propose a new trigonometric interpolation algorithm and establish relevant convergent properties. The method adjusts an existing trigonometric interpolation algorithm such that it can better leverage Fast Fourier Transform…
A new method is presented for solving Poisson's equation inside an open-ended rectangular pipe. The method uses Fast Fourier Transforms (FFTs) to perform mixed convolutions and correlations of the charge density with the Green function.…
Filtering of digital signals is accomplished on an Excel spreadsheet using fast Fourier transform (FFT) convolution in which the kernel is either a Gaussian or a cosine modulated Gaussian. Pedagogical examples of low-pass and band-pass…
The realm of classical phase retrieval concerns itself with the arduous task of recovering a signal from its Fourier magnitude measurements, which are fraught with inherent ambiguities. A single-exposure intensity measurement is commonly…
Consider the scattering of a time-harmonic plane wave by heterogeneous media consisting of linear or nonlinear point scatterers and extended obstacles. A generalized Foldy-Lax formulation is developed to take fully into account of the…
We present a spectrally accurate, efficient FFT-based method for the three-dimensional free-space Poisson equation with smooth, compactly supported sources. The method adopts a super-potential formulation: we first compute the convolution…
Unveiling the real appearance of retouched faces to prevent malicious users from deceptive advertising and economic fraud has been an increasing concern in the era of digital economics. This article makes the first attempt to investigate…
This paper proposes to use Fast Fourier Transformation-based U-Net (a refined fully convolutional networks) and perform image convolution in neural networks. Leveraging the Fast Fourier Transformation, it reduces the image convolution costs…