English
Related papers

Related papers: ATSFFT: A Novel Sparse Fast Fourier Transform Enab…

200 papers

The Fast Fourier Transform (FFT) is a fundamental tool for signal analysis, widely used across various fields. However, traditional FFT methods encounter challenges in adjusting the frequency bin interval, which may impede accurate spectral…

Data Structures and Algorithms · Computer Science 2024-03-27 Haichao Xu

The Fast Fourier Transform (FFT) is an algorithm of paramount importance in signal processing as it allows to apply the Fourier transform in O(n log n) instead of O(n 2) arithmetic operations. Graph Signal Processing (GSP) is a recent…

Numerical Analysis · Computer Science 2017-06-19 Luc Le Magoarou , Rémi Gribonval , Nicolas Tremblay

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…

General Mathematics · Mathematics 2026-05-27 Yu Zhang , Jia-Yin Peng , Bing-Zhao Li

Features based on sparse representation, especially using the synthesis dictionary model, have been heavily exploited in signal processing and computer vision. However, synthesis dictionary learning typically involves NP-hard sparse coding…

Machine Learning · Computer Science 2017-10-17 Bihan Wen , Saiprasad Ravishankar , Yoram Bresler

Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…

Numerical Analysis · Computer Science 2011-10-28 Zhengjun Cao , Xiao Fan

Computing the Sparse Fast Fourier Transform(sFFT) of a K-sparse signal of size N has emerged as a critical topic for a long time. The sFFT algorithms decrease the runtime and sampling complexity by taking advantage of the signal inherent…

Signal Processing · Electrical Eng. & Systems 2020-12-16 Bin Li , Zhikang Jiang , Jie Chen

Wireless OFDM channels can be approximated by a time varying filter with sparse time domain taps. Recent achievements in sparse signal processing such as compressed sensing have facilitated the use of sparsity in estimation, which improves…

Information Theory · Computer Science 2009-01-27 Mahdi Soltanolkotabi , Arash Amini , Farokh Marvasti

Parameter Efficient Fine-Tuning (PEFT) is a key technique for adapting a large pretrained model to downstream tasks by fine-tuning only a small number of parameters. Recent methods based on Fourier transforms have further reduced the…

Computer Vision and Pattern Recognition · Computer Science 2026-05-12 Baoquan Zhang , Zhehao Yu , Lisai Zhang , Kenghong Lin , Tianran Chen , Yuxi Sun , Yunming Ye , Yao He

The discrete Fourier transform (DFT) is widely employed for multi-beam digital beamforming. The DFT can be efficiently implemented through the use of fast Fourier transform (FFT) algorithms, thus reducing chip area, power consumption,…

Signal Processing · Electrical Eng. & Systems 2022-07-14 A. Madanayake , R. J. Cintra , N. Akram , V. Ariyarathna , S. Mandal , V. A. Coutinho , F. M. Bayer , D. Coelho , T. S. Rappaport

Feature Transformation is crucial for classic machine learning that aims to generate feature combinations to enhance the performance of downstream tasks from a data-centric perspective. Current methodologies, such as manual expert-driven…

Machine Learning · Computer Science 2025-03-27 Tianqi He , Xiaohan Huang , Yi Du , Qingqing Long , Ziyue Qiao , Min Wu , Yanjie Fu , Yuanchun Zhou , Meng Xiao

Preserving accuracy is a challenging issue in super resolution images. In this paper, we propose a new FFT based image registration algorithm and a sparse based super resolution algorithm to improve the accuracy of super resolution image.…

Computer Vision and Pattern Recognition · Computer Science 2014-07-15 Archana Vijayan , Vincy Salam

In this letter, a fast Fourier transform (FFT)-enhanced low-complexity super-resolution sensing algorithm for near-field source localization with both angle and range estimation is proposed. Most traditional near-field source localization…

Signal Processing · Electrical Eng. & Systems 2024-11-26 Yuxiao Wu , Huizhi Wang , Yong Zeng

Parameter-efficient fine-tuning (PEFT) of pre-trained language models has recently demonstrated remarkable achievements, effectively matching the performance of full fine-tuning while utilizing significantly fewer trainable parameters, and…

Computation and Language · Computer Science 2023-05-29 Baohao Liao , Yan Meng , Christof Monz

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…

Other Computer Science · Computer Science 2010-06-15 Ashish Raman , Anvesh Kumar , R. K. Sarin

Image subtraction is essential for transient detection in time-domain astronomy. The point spread function (PSF), photometric scaling, and sky background generally vary with time and across the field-of-view for imaging data taken with…

Instrumentation and Methods for Astrophysics · Physics 2022-09-14 Lei Hu , Lifan Wang , Xingzhuo Chen , Jiawen Yang

Adapting vision transformer foundation models through parameter-efficient fine-tuning (PEFT) methods has become increasingly popular. These methods optimize a limited subset of parameters, enabling efficient adaptation without the need to…

Computer Vision and Pattern Recognition · Computer Science 2024-12-02 Son Thai Ly , Hien V. Nguyen

The synchrosqueezing transform, a kind of reassignment method, aims to sharpen the time-frequency representation and to separate the components of a multicomponent non-stationary signal. In this paper, we consider the short-time Fourier…

Signal Processing · Electrical Eng. & Systems 2019-09-27 Lin Li , Haiyan Cai , Hongxia Han , Qingtang Jiang , Hongbing Ji

Ptychography is a popular imaging technique that combines diffractive imaging with scanning microscopy. The technique consists of a coherent beam that is scanned across an object in a series of overlapping positions, leading to reliable and…

Numerical Analysis · Mathematics 2024-08-08 Ricardo Parada , Samy Wu Fung , Stanley Osher

Dense image prediction tasks demand features with strong category information and precise spatial boundary details at high resolution. To achieve this, modern hierarchical models often utilize feature fusion, directly adding upsampled…

Computer Vision and Pattern Recognition · Computer Science 2024-08-26 Linwei Chen , Ying Fu , Lin Gu , Chenggang Yan , Tatsuya Harada , Gao Huang

In this work, we propose an algorithm for a filter based on the Fast Fourier Transform (FFT), which, due to its characteristics, allows for an efficient computational implementation, ease of use, and minimizes amplitude variation in the…

Numerical Analysis · Mathematics 2024-07-19 Flavio Dalossa Freire , Isabel Gebauer Soares