Title
Fast Computation of Frequency Warping Transforms
Abstract
In this paper, we introduce an analytical approach for the frequency warping transform. Criteria for the design of operators based on arbitrary warping maps are provided and an algorithm carrying out a fast computation is defined. Such operators can be used to shape the tiling of time-frequency (TF) plane in a flexible way. Moreover, they are designed to be inverted by the application of their adjoint operator. According to the proposed model, the frequency warping transform is computed by considering two additive operators: the first one represents its nonuniform Fourier transform approximation and the second one suppresses aliasing. The first operator is fast computable by various interpolation approaches. A factorization of the second operator is found for arbitrary shaped nonsmooth warping maps. By properly truncating the operators involved in the factorization, the computation turns out to be fast without compromising accuracy.
Year
DOI
Venue
2010
10.1109/TSP.2009.2034323
IEEE Transactions on Signal Processing
Keywords
Field
DocType
Fourier transforms,signal processing,arbitrary shaped nonsmooth warping maps,arbitrary warping maps,frequency warping transforms,nonuniform Fourier transform approximation,time-frequency plane,Fast transforms,frequency warping
Mathematical optimization,Image warping,Interpolation,Fourier transform,Aliasing,Time–frequency analysis,Operator (computer programming),Mathematics,Wavelet transform,Computation
Journal
Volume
Issue
ISSN
58
3
1053-587X
Citations 
PageRank 
References 
4
0.54
9
Authors
3
Name
Order
Citations
PageRank
S. Caporale1164.68
Luca De Marchi23713.21
Nicolo Speciale3226.35