Related papers: Numerical Analysis for Iterative Filtering with Ne…
An accelerated class of adaptive scheme of iterative thresholding algorithms is studied analytically and empirically. They are based on the feedback mechanism of the null space tuning techniques (NST+HT+FB). The main contribution of this…
The short-time Fourier transform (STFT) is widely used for analyzing non-stationary signals. However, its performance is highly sensitive to its parameters, and manual or heuristic tuning often yields suboptimal results. To overcome this…
The graph Fourier transform (GFT) is a fundamental tool in graph signal processing and has recently been extended to the graph fractional Fourier transform (GFRFT). Existing sampling methods in the GFRFT domain are primarily designed to…
An iterative algorithm is adopted to construct approximate representations of matrices describing the scattering properties of arbitrary objects. The method is based on the implicit evaluation of scattering responses from iteratively…
Computational micromechanics and homogenization require the solution of the mechanical equilibrium of a periodic cell that comprises a (generally complex) microstructure. Techniques that apply the Fast Fourier Transform have attracted much…
In this work, we present a new technique for the decomposition of multivariate data, which we call Multivariate Fast Iterative Filtering (MvFIF) algorithm. We study its properties, proving rigorously that it converges in finite time when…
The defects of the traditional strapdown inertial navigation algorithms become well acknowledged and the corresponding enhanced algorithms have been quite recently proposed trying to mitigate both theoretical and algorithmic defects. In…
The fundamentals of Fourier Transform are presented, with analytical solutions derived for Continuous Fourier Transform (CFT) of truncated signals, to benchmark against Fast Fourier Transform (FFT). Certain artifacts from FFT were…
This paper revisits the design and optimization of parallel fast finite impulse response (FIR) filters using polyphase decomposition and iterated fast FIR algorithms (FFAs). Parallel FIR filtering enhances computational efficiency and…
The fractional Fourier transform (FrFT), a fundamental operation in physics that corresponds to a rotation of phase space by any angle, is also an indispensable tool employed in digital signal processing for noise reduction. Processing of…
In the digital world, signals are discrete and finite. The Fourier representation of discrete and finite signals is FT convolution of the finite sampling function and the continuous signal. Conventionally, finite sampling is treated as a…
This paper details the purpose, difficulties, theory, implementation, and results of developing a Fast Fourier Transform (FFT) using the prime factor algorithm on an embedded system. Many applications analyze the frequency content of…
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…
In this paper, a novel decomposition method for non-stationary and nonlinear signals is proposed. This method is inspired by the adaptive wavelet filter bank of the empirical wavelet transform (EWT) and Fourier intrinsic band functions…
Non-linear image reconstruction and signal analysis deal with complex inverse problems. To tackle such problems in a systematic way, I present information field theory (IFT) as a means of Bayesian, data based inference on spatially…
As neural networks are increasingly being applied to real-world applications, mechanisms to address distributional shift and sequential task learning without forgetting are critical. Methods incorporating network expansion have shown…
The nonlinear Fourier transform (NFT) decomposes waveforms propagating through optical fiber into nonlinear degrees of freedom, which are preserved during transmission. By encoding information on the nonlinear spectrum, a transmission…
This summary of the doctoral thesis provides a comprehensive formulation of the Extended Discrete Fourier Transform (EDFT), derived directly from the Fourier integral and its orthogonality properties. The method is obtained by solving…
Although supervised finetuning (SFT) has emerged as an essential technique to align large language models with humans, it is considered superficial, with style learning being its nature. At the same time, recent works indicate the…
The dynamic environment in the real world calls for the adaptive techniques for information filtering, namely to provide real-time responses to the changes of system data. Where many incremental algorithms are designed for this purpose,…