Results 21 to 30 of about 2,113,812 (291)
New Algorithm for Real-Valued Fourier Transform
Tikrit Journal of Engineering Sciences, 2023 This paper presents a direct algorithm for fast real discrete Fourier transform (RDFT) computing, using the discrete Fourier transform (DFT) conjugate symmetric property to reduce redundancies.
Sukaina K. Salih, Mounir T. Hamood
doaj +1 more source
Single Image Raindrop Removal Using a Non-Local Operator and Feature Maps in the Frequency Domain
IEEE Access, 2022 Taking a photo on a rainy day may result in a photo with raindrops. Images containing raindrops have a significant impact on the visual impression and accuracy when applied to image recognition systems.
Shinya Ezumi, Masaaki Ikehara
doaj +1 more source
FFT-based simulation using a reduced set of frequencies adapted to the underlying microstructure [PDF]
Computer Methods in Materials Science, 2021 Instead of the classical finite element (FE) based microstructure simulation, a Fast Fourier transform (FFT) based microstructure simulation, introduced by Moulinec and Suquet (1994, 1998), also enables the computation of highly resolved microstructural ...
Christian Gierden +3 more
doaj +1 more source
IET Computers & Digital Techniques, 2021 Fast Fourier transform (FFT) is the most common low‐complexity implementation of the discrete Fourier transform, intensively employed to process real‐world signals in smart sensors for the internet of things.
Guilherme Ferreira +6 more
doaj +1 more source
Polar Formed Histogram of Fast Fourier Transform Feature for Time-series Classification Problems [PDF]
Journal of Electrical and Computer Engineering Innovations, 2022 Background and Objectives: Time series classification (TSC) means classifying the data over time and based on their behavior. TSC is one of the main machine learning tasks related to time series.
K. Kiaei, H. Omranpour
doaj +1 more source
Fast Computation of Singular Oscillatory Fourier Transforms
Abstract and Applied Analysis, 2014 We consider the problem of the numerical evaluation of singular oscillatory Fourier transforms ∫abx-aαb-xβf(x)eiωxdx, where α>-1 and β>-1. Based on substituting the original interval of integration by the paths of steepest descent, if f is analytic ...
Hongchao Kang, Xinping Shao
doaj +1 more source
A novel secondary code acquisition algorithm for the BDS‐3 B1C signal
IET Radar, Sonar & Navigation, 2021 The BDS‐3 recently started broadcasting a new civil B1C signal to provide open services for global users, which brings benefits to GNSS‐based applications.
Tongsheng Qiu +4 more
doaj +1 more source
Fast Partial Fourier Transform
CoRR, 2020 Given a time series vector, how can we efficiently compute a specified part of Fourier coefficients? Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications. Despite its pervasive use, all known FFT algorithms do not provide a fine-tuning option for the user to specify ...
Yong-chan Park, Jun-Gi Jang, U Kang
openaire +2 more sources
A Fast Mellin and Scale Transform
EURASIP Journal on Advances in Signal Processing, 2007 A fast algorithm for the discrete-scale (and β-Mellin) transform is proposed. It performs a discrete-time discrete-scale approximation of the continuous-time transform, with subquadratic asymptotic complexity.
Davide Rocchesso, Antonio De Sena
doaj +2 more sources
An Improved Antenna Array Pattern Synthesis Method Using Fast Fourier Transforms
International Journal of Antennas and Propagation, 2015 An improved antenna array pattern synthesis method using fast Fourier transform is proposed, which can be effectively applied to the synthesis of large planar arrays with periodic structure.
Xucun Wang, Yiguo Zhou, Yanfei Wang
doaj +1 more source