English
Related papers

Related papers: Fast implementation of synchrosqueezing transform …

200 papers

The problem of recovering a signal from its Fourier magnitude is of paramount importance in various fields of engineering and applied physics. Due to the absence of Fourier phase information, some form of additional information is required…

Information Theory · Computer Science 2016-05-25 Kishore Jaganathan , Yonina C. Eldar , Babak Hassibi

The cost of writing, transferring, and storing large data from unsteady simulations limits access to the entire solution, often leaving much of the flow under-sampled or unanalyzed. For example, modeling transient behavior of rare dynamic…

Data Analysis, Statistics and Probability · Physics 2024-10-17 Spencer L. Stahl , Stuart I. Benton

Many interesting and fundamentally practical optimization problems, ranging from optics, to signal processing, to radar and acoustics, involve constraints on the Fourier transform of a function. It is well-known that the {\em fast Fourier…

Optimization and Control · Mathematics 2012-09-05 Robert J. Vanderbei

Scanning transmission X-ray microscopy (STXM) is a nanoscale imaging technique that can utilize several powerful contrast mechanisms for the quantitative mapping of chemical and physical materials properties. Spatial resolutions down to…

Instrumentation and Detectors · Physics 2026-05-27 Simone Finizio , Benjamin Watts , Benedikt Rösner , Tim A. Butcher , Sebastian Wintz , Markus Weigand , Jörg Raabe

Stochastic density functional theory (sDFT) is becoming a valuable tool for studying ground state properties of extended materials. The computational complexity of describing the Kohn-Sham orbitals is replaced by introducing a set of random…

Chemical Physics · Physics 2021-06-16 Ming Chen , Roi Baer , Daniel Neuhauser , Eran Rabani

A Fourier transform method is introduced for a class of hybrid time-frequency methods that solve the acoustic scattering problem in regimes where the solution exhibits both highly oscillatory behavior and slow decay in time. This extends…

Numerical Analysis · Mathematics 2026-02-18 Heather Wilber , Wietse Vaes , Abinand Gopal , Gunnar Martinsson

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

Diffuse scattering is a rich source of information about disorder in crystalline materials, which can be modelled using atomistic techniques such as Monte Carlo and molecular dynamics simulations. Modern X-ray and neutron scattering…

Materials Science · Physics 2018-12-21 Joseph A. M. Paddison

Time-frequency analysis (TFA) techniques play an important role in the field of machine fault diagnosis attributing to their superiority in dealing with nonstationary signals. Synchroextracting transform (SET) and transient-extracting…

Signal Processing · Electrical Eng. & Systems 2024-02-09 Yunlong Ma , Gang Yu , Tianran Lin , Qingtang Jiang

The framework of ultrasound computed tomography (USCT) has recently re-emerged as a powerful, safe and operator-independent way to image the breast. State of the art image reconstruction methods are performed with iterative techniques based…

Medical Physics · Physics 2025-08-13 Luca A. Forte

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…

Information Theory · Computer Science 2020-05-15 Ningning Han , Shidong Li , Zhanjie Song

Purpose: A novel subspace-based reconstruction method for frequency-modulated balanced steady-state free precession (fmSSFP) MRI is presented. In this work, suitable data acquisition schemes, subspace sizes, and efficiencies for banding…

A new method is proposed to determine the time-frequency content of time-dependent signals consisting of multiple oscillatory components, with time-varying amplitudes and instantaneous frequencies. Numerical experiments as well as a…

Statistics Theory · Mathematics 2016-04-27 Ingrid Daubechies , Yi Wang , Hau-tieng Wu

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

An algorithm for deriving delay functions based on real examples of vibrato was recently introduced and can be used to perform a vibrato transfer, in which the vibrato pattern of a target signal is imparted onto an incoming sound using a…

Sound · Computer Science 2025-09-29 Jeremy Hyrkas

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

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

The problem of recovering a signal from the magnitude of its short-time Fourier transform (STFT) is a longstanding one in audio signal processing. Existing approaches rely on heuristics that often perform poorly because of the nonconvexity…

Applications · Statistics 2012-09-11 Dennis L. Sun , Julius O. Smith

Real life signals are in general non--stationary and non--linear. The development of methods able to extract their hidden features in a fast and reliable way is of high importance in many research fields. In this work we tackle the problem…

Numerical Analysis · Mathematics 2018-10-26 Antonio Cicone , Haomin Zhou

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…

Data Structures and Algorithms · Computer Science 2017-04-12 Volkan Cevher , Michael Kapralov , Jonathan Scarlett , Amir Zandieh
‹ Prev 1 3 4 5 6 7 10 Next ›