Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization
From MaRDI portal
Publication:4833437
Abstract: A versatile method is described for the practical computation of the discrete Fourier transforms (DFT) of a continuous function given by its values at the points of a uniform grid generated by conjugacy classes of elements of finite adjoint order in the fundamental region of compact semisimple Lie groups. The present implementation of the method is for the groups SU(2), when is reduced to a one-dimensional segment, and for in multidimensional cases. This simplest case turns out to result in a transform known as discrete cosine transform (DCT), which is often considered to be simply a specific type of the standard DFT. Here we show that the DCT is very different from the standard DFT when the properties of the continuous extensions of these two discrete transforms from the discrete grid points to all points are considered. (A) Unlike the continuous extension of the DFT, the continuous extension of (the inverse) DCT, called CEDCT, closely approximates between the grid points . (B) For increasing , the derivative of CEDCT converges to the derivative of . And (C), for CEDCT the principle of locality is valid. Finally, we use the continuous extension of 2-dimensional DCT to illustrate its potential for interpolation, as well as for the data compression of 2D images.
Recommendations
- scientific article; zbMATH DE number 2236701
- Generalization of the multiplicative Fourier transform and its properties
- An extension of the discrete Fourier transform
- scientific article; zbMATH DE number 515718
- scientific article; zbMATH DE number 1256356
- A generalization of the discrete fourier transform
- On the generalized fourier sine- and cosine-transforms
- scientific article; zbMATH DE number 1047548
- Generalizing the discrete Fourier transform
Cites work
- A fast cosine transform in one and two dimensions
- Automorphisms of finite order of semisimple Lie algebras
- Characters of Elements of Finite Order in Lie Groups
- Discrete Cosine Transform
- Fast algorithms for the discrete W transform and for the discrete Fourier transform
- Numerical transforms
- On Computing the Discrete Cosine Transform
- On the Computation of the Discrete Cosine Transform
- Simple FFT and DCT algorithms with reduced number of operations.
- The Discrete Cosine Transform
Cited in
(9)- scientific article; zbMATH DE number 2236701 (Why is no real title available?)
- (Anti)symmetric multivariate trigonometric functions and corresponding Fourier transforms
- The discrete \(\text{SU}(3)\) transform and its continuous extension for triangular lattices
- On discretization of tori of compact simple Lie groups
- Decomposition matrices for the square lattices of the Lie groups \(\mathrm{SU}(2)\times \mathrm{SU}(2)\)
- The discrete cosine transform, a Fourier-related method for morphometric analysis of open contours
- Discrete and continuous cosine transform generalized to Lie groups SU(2)×SU(2) and O(5)
- Discrete and continuous cosine transform generalized to Lie groups SU(3) and G(2)
- Discrete and continuous sine transform generalized to semisimple Lie groups of rank two
This page was built for publication: Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4833437)