Related papers: A fast numerical method for photomultiplier calibr…
We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…
Fourier ptychography captures intensity images with varying source patterns (illumination angles) in order to computationally reconstruct large space-bandwidth-product images. Accurate knowledge of the illumination angles is necessary for…
The Fast Fourier Transform (FFT) is one of the most widely used algorithms in high performance computing, with critical applications in spectral analysis for both signal processing and the numerical solution of partial differential…
Background: Windowed Fourier decompositions (WFD) are widely used in measuring stationary and non-stationary spectral phenomena and in describing pairwise relationships among multiple signals. Although a variety of WFDs see frequent…
Fourier ptychographic microscopy (FPM) is a powerful computational imaging modality that achieves high space-bandwidth product imaging for biomedical samples. However, its adoption is limited by slow data acquisition due to the need for…
The hemispherical 10" photomultiplier tube (PMT) R7081 from Hamamatsu Photonics K.K. (HPK) is used in various experiments in particle and astroparticle physics. We describe the test and calibration of 474 PMTs for the reactor antineutrino…
Discrete Fourier Transform (DFT) is widely used in signal processing to analyze the frequencies in a discrete signal. However, DFT fails to recover the exact Fourier spectrum, when the signal contains frequencies that do not correspond to…
A new Digital Pulse Processing (DPP) module has been developed, based on a domino ring sampler version 4 chip (DRS4), with good time resolution for LaBr3 detectors, and different digital timing analysis methods for processing the raw…
Fourier ptychography (FP), as a computational imaging method, is a powerful tool to improve imaging resolution. Camera-scanning Fourier ptychography extends the application of FP from micro to macro creatively. Due to the non-ideal scanning…
A Discrete Fourier Transform Method (DFTM) for discrimination between the signal of neutrons and gamma rays in organic scintillation detectors is presented. The method is based on the transformation of signals into the frequency domain…
In this paper, we extend our method [1] for FMCW radar mutual interference mitigation (IM) based on the discrete fractional Fourier transform (DFrFT). Firstly, we propose a radar signal processing chain including our DFrFT-based IM for…
We consider the Fast Fourier Transform (FFT) based numerical method for thin film magnetization problems [Vestg{\aa}rden and Johansen, SuST, 25 (2012) 104001], compare it with the finite element methods, and evaluate its accuracy. Proposed…
The Fast Fourier Transform (FFT) is a computationally intensive digital signal processing (DSP) function widely used in applications such as imaging, software-defined radio, wireless communication, instrumentation. In this paper, a…
Optoacoustic imaging technologies require fast and accurate signal pre-processing algorithms to enable widespread deployment in clinical and home-care settings. However, they still rely on the Discrete Fourier Transform (DFT) as the default…
Deployment of machine learning algorithms into real-world practice is still a difficult task. One of the challenges lies in the unpredictable variability of input data, which may differ significantly among individual users, institutions,…
The well-known discrete Fourier transform (DFT) can easily be generalized to arbitrary nodes in the spatial domain. The fast procedure for this generalization is referred to as nonequispaced fast Fourier transform (NFFT). Various…
Two-Dimensional (2D) Discrete Fourier Transform (DFT) is a basic and computationally intensive algorithm, with a vast variety of applications. 2D images are, in general, non-periodic, but are assumed to be periodic while calculating their…
For any finite group $G$, we give an arithmetic algorithm to compute generalized Discrete Fourier Transforms (DFTs) with respect to $G$, using $O(|G|^{\omega/2 + \epsilon})$ operations, for any $\epsilon > 0$. Here, $\omega$ is the exponent…
The number of phase wraps in 2D wrapped phase map can be completely eliminated, or greatly reduced by frequency shifting. But the wraps usually cannot be optimally reduced using the conventional fast Fourier transform (FFT) because the…
The Palomar Transient Factory (PTF) provides multiple epoch imaging for a large fraction of the sky. Here we describe the photometric calibration of the PTF data products that relates the PTF magnitudes to other mag systems. The calibration…