Name
Abstract | ||
|---|---|---|
In this work we present a fast and accurate algorithm to compute frequency warping of arbitrary shaped maps. In contrast to the common Laguerre approach, frequency warping is represented by a matrix of truncated finite dimensions. The transformation matrix is decomposed in two additive terms: the first term represents its Nonuniform Fourier Transform approximation while the second term is imposed for aliasing suppression. Both matrices are approximated with a least square approach according to a suitable set of vectors. The cardinality of this set is shown to be nearly proportional to the logarithm of the matrix dimension. Finally, trade-off aspects between algorithm complexity and performance are discussed. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/ISCAS.2007.378025 | 2007 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-11 |
Keywords | Field | DocType |
kernel,fourier transform,least squares approximation,computational complexity,fourier transforms,amplitude modulation,matrix decomposition,least square,linearity,signal processing,frequency modulation,transformation matrix | Multidimensional signal processing,Image warping,Matrix (mathematics),Matrix decomposition,Algorithm,Fast Fourier transform,Logarithm,Discrete Fourier transform,Mathematics,DFT matrix | Conference |
ISSN | Citations | PageRank |
0271-4302 | 3 | 0.58 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Caporale | 1 | 16 | 4.68 |
| Luca De Marchi | 2 | 37 | 13.21 |
| Nicolo Speciale | 3 | 22 | 6.35 |