Related papers: Adaptive Frequency Bin Interval in FFT via Dense S…
In this paper a sublinear time algorithm is presented for the reconstruction of functions that can be represented by just few out of a potentially large candidate set of Fourier basis functions in high spatial dimensions, a so-called…
Visible-infrared object detection has gained sufficient attention due to its detection performance in low light, fog, and rain conditions. However, visible and infrared modalities captured by different sensors exist the information…
The special affine Fourier transform (SAFT) is a promising tool for analyzing non-stationary signals with more degrees of freedom. However, the SAFT fails in obtaining the local features of non-transient signals due to its global kernel and…
The nonlinear Fourier transform (NFT) has recently gained significant attention in fiber optic communications and other engineering fields. Although several numerical algorithms for computing the NFT have been published, the design of…
We develop the basic building blocks of a frequency domain framework for drawing statistical inferences on the second-order structure of a stationary sequence of functional data. The key element in such a context is the spectral density…
Accurate calibration of internal parameters is a crucial yet challenging prerequisite for 3D reconstruction using light field cameras. In this paper, we propose a linear fractional transformation(LFT) parameter $\alpha$ to decoupled the…
Synchrosqueezing transform (SST) is a useful tool for vibration signal analysis due to its high time-frequency (TF) concentration and reconstruction properties. However, existing SST requires much processing time for large-scale data. In…
Numerical simulation of Fresnel diffraction with fast Fourier transform (FFT) is widely used in optics, especially computer holography. Fresnel diffraction with FFT cannot set different sampling rates between source and destination planes,…
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…
The problem of approximately computing the $k$ dominant Fourier coefficients of a vector $X$ quickly, and using few samples in time domain, is known as the Sparse Fourier Transform (sparse FFT) problem. A long line of work on the sparse FFT…
A simple least-squares optimisation enables the determination of the spectrum for irregularly sampled data that is readily reconstructed using an adjoint transformation of the Non-Uniform Fast Fourier Transform (NFFT). This is an…
The Fourier spectrum at a fractional period is often examined when extracting features from biological sequences and time series. It reflects the inner information structure of the sequences. A fractional period is not uncommon in time…
Detrend fluctuation analysis (DFA) has become a choice method for effective analysis of a broad variety of nonstationary signals. We show in the present article that, provided the nonstationary fluctuations occur at a large enough time…
In this paper, we describe the principle of a multi-aperture interferometer that uses a phase-shifting technique and is suitable for quick, snapshot imaging of astrophysical objects at extreme angular resolution through Fourier inversion. A…
In recent years there has been a growing interest in the fractional Fourier transform driven by its large number of applications. The literature in this field follows two main routes. On the one hand, the areas where the ordinary Fourier…
The standing waves existed in radio telescope data are primarily due to reflections among the instruments, which significantly impact the spectrum quality of the Five-hundred-meter Aperture Spherical radio Telescope (FAST). Eliminating…
Optical spectrum analysis is the cornerstone of spectroscopic sensing, optical network performance monitoring, and hyperspectral imaging. While conventional high-performance spectrometers used to perform such analysis are often large…
In this paper we explain how to use the Fast Fourier Transform (FFT) to solve partial differential equations (PDEs). We start by defining appropriate discrete domains in coordinate and frequency domains. Then describe the main limitation of…
Radio Frequency Interference (RFI) increasingly contaminates the radio astronomy spectrum, often exceeding astronomical signal amplitudes by 50-70 dB. Reliable detection and mitigation are therefore essential for studies of faint transient…
Methods based on implicit neural representation have demonstrated remarkable capabilities in arbitrary-scale super-resolution (ASSR) tasks, but they neglect the potential value of the frequency domain, leading to sub-optimal performance. We…