相关论文: Edge effect removal in Fourier ptychographic micro…

We report on the observation and correction of an imaging artifact attributed to the Talbot effect in the context of acousto-optic imaging using structured acoustic waves. When ultrasound waves are emitted with a periodic structure, the…

The Discrete Fourier Transform (DFT) is essential for various applications ranging from signal processing to convolution and polynomial multiplication. The groundbreaking Fast Fourier Transform (FFT) algorithm reduces DFT time complexity…

The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a…

An approach reported recently by Alexandrov et al. on optical scatter imaging, termed digital Fourier microscopy (DFM), represents an adaptation of digital Fourier holography to selective imaging of biological matter. Holographic mode of…

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…

Recent improvements to spatial resolution in angle-resolved photo-emission spectroscopy (ARPES) have made it common to perform measurements with a very brief dwell time, for the purpose of mapping the spectral function over large surface…

A low complexity frequency offset estimation algorithm based on all-phase FFT for M-QAM is proposed. Compared with two-stage algorithms such as FFT+CZT and FFT+ZoomFFT, our algorithm can lower computational complexity by 73% and 30%…

Accurate quantification in positron emission tomography (PET) is essential for accurate diagnostic results and effective treatment tracking. A major issue encountered in PET imaging is attenuation. Attenuation refers to the diminution of…

Ultrasound (US) image segmentation is an active research area that requires real-time and highly accurate analysis in many scenarios. The detect-to-segment (DTS) frameworks have been recently proposed to balance accuracy and efficiency.…

State-of-the-art (SoTA) models have improved the accuracy of object detection with a large margin via a FP (feature pyramid). FP is a top-down aggregation to collect semantically strong features to improve scale invariance in both two-stage…

In the era of AIGC, the fast development of visual content generation technologies, such as diffusion models, bring potential security risks to our society. Existing generated image detection methods suffer from performance drop when faced…

Frequency estimation is a fundamental problem in many areas. The well-known A&M and its variant estimators have established an estimation framework by iteratively interpolating the discrete Fourier transform (DFT) coefficients. In general,…

We report a novel generalized optical measurement system and computational approach to determine and correct aberrations in optical systems. We developed a computational imaging method capable of reconstructing an optical system's…

Fast convolution algorithms, including Winograd and FFT, can efficiently accelerate convolution operations in deep models. However, these algorithms depend on high-precision arithmetic to maintain inference accuracy, which conflicts with…

The fast Fourier transform, FFT, is a useful and prevalent algorithm in signal processing. It characterizes the spectral components of a signal, or is used in combination with other operations to perform more complex computations such as…

In this paper phase of a signal has been viewed from a different angle. According to this view a signal can have countably infinitely many phases, one associated with each Fourier component. In other words each frequency has a phase…

A novel biologically motivated face recognition algorithm based on polar frequency is presented. Polar frequency descriptors are extracted from face images by Fourier-Bessel transform (FBT). Next, the Euclidean distance between all images…

In this paper, we study the mathematical imaging problem of optical diffraction tomography (ODT) for the scenario of a microscopic rigid particle rotating in a trap created, for instance, by acoustic or optical forces. Under the influence…

In this work, we present the \emph{twiddless fast Fourier transform (TFFT)}, a novel algorithm for computing the $N$-point discrete Fourier transform (DFT). The TFFT's divide strategy builds on recent results that decimate an $N$-point…

The Fast Fourier Transform (FFT), as a core computation in a wide range of scientific applications, is increasingly threatened by reliability issues. In this paper, we introduce TurboFFT, a high-performance FFT implementation equipped with…