On the computation of two-dimensional DCT

DOI10.1109/78.827550MaRDI QIDQ2734324zbMATH OpenOpenAlexFDO

Authors Guoan Bi, Gang Li, Kai-Kuang Ma, Teu-Chia Tan

Publication date 14 August 2001

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

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

zbMATH Keywords

discrete cosine transformfast algorithms

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Fast recursive algorithms for 2-D discrete cosine transform.
• A new two-dimensional fast cosine transform algorithm
• An efficient algorithm for the 2-D discrete cosine transform
• A refined fast 2-D discrete cosine transform algorithm
• Fast algorithms for the discrete cosine transform

Cited in

(22)

• A parallel algorithm for \(4\times 4\) DCT
• General approach for the realization of DCT/IDCT using convolutions
• Fast recursive algorithms for 2-D discrete cosine transform.
• Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format
• Fast 2-D \(8\times 8\) discrete cosine transform algorithm for image coding
• Concurrent computation of two-dimensional discrete cosine transform
• On computing the 2-D FFT
• A refined fast 2-D discrete cosine transform algorithm
• New polynomial transform algorithm for multidimensional DCT
• A fast directional discrete cosine transform based image compression
• Convolution-based DCT algorithm
• A new algorithm to compute the DCT and its inverse
• On the regular structure for the fast 2-D DCT algorithm
• scientific article; zbMATH DE number 621949 (Why is no real title available?)
• On the odd-DFT and its applications to DCT/IDCT computation
• scientific article; zbMATH DE number 1833436 (Why is no real title available?)
• Two-dimensional linear convolution in the discrete trigonometric transform domain
• Shifted Fourier transform-based tensor algorithms for the 2-D DCT
• Low-Complexity Scaling Methodsfor DCT-II Approximations
• Parallel, pipelined and folded architectures for computation of 1-D and 2-D DCT in image and video codec
• An efficient algorithm for the 2-D discrete cosine transform
• A fast algorithm for the computation of 2-D forward and inverse MDCT

This page was built for publication: On the computation of two-dimensional DCT

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