Shifted Fourier transform-based tensor algorithms for the 2-D DCT

DOI10.1109/78.942639MaRDI QIDQ5353546zbMATH OpenOpenAlexFDO

Authors Artyom M. Grigoryan, Sos Agaian

Publication date 8 September 2017

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/78.942639

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• On the computation of two-dimensional DCT
• On the regular structure for the fast 2-D DCT algorithm
• Low-Complexity Multidimensional DCT Approximations for High-Order Tensor Data Decorrelation
• Fast method to compute tensor product 2D wavelet transforms
• A new efficient algorithm to compute the two-dimensional discrete Fourier transform
• Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format
• A new look at DCT-type transforms
• An efficient algorithm for the Fourier transform on a compressed image in restricted quadtree and shading format.
• 2-D FFT algorithm by matrix factorization in a 2-D space
• A fast algorithm for computing multidimensional dct on certain small sizes

Cited in

(2)

• Tensor transform-based quaternion Fourier transform algorithm
• Representation of the Fourier transform by Fourier series

This page was built for publication: Shifted Fourier transform-based tensor algorithms for the 2-D DCT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353546)