Fast 2-D \(8\times 8\) discrete cosine transform algorithm for image coding
From MaRDI portal
Publication:2267025
DOI10.1007/s11432-009-0038-4zbMath1181.94014OpenAlexW1964747615MaRDI QIDQ2267025
Xiuhua Ji, Caiming Zhang, Jiaye Wang, S. H. Boey
Publication date: 26 February 2010
Published in: Science in China. Series F (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11432-009-0038-4
Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- Simple FFT and DCT algorithms with reduced number of operations.
- A refined fast 2-D discrete cosine transform algorithm
- A generalized output pruning algorithm for matrix-vector multiplication and its application to compute pruning discrete cosine transform
- Interpolation theorem for the number of generalized end-vertices of spanning trees
- A new two-dimensional fast cosine transform algorithm
- A new algorithm to compute the discrete cosine Transform
- Fast Algorithms for the 2-D Discrete Cosine Transform
- A fast 4*4 DCT algorithm for the recursive 2-D DCT
- Fast algorithms for the discrete cosine transform
- A Fast Computational Algorithm for the Discrete Cosine Transform
- Discrete Cosine Transform
This page was built for publication: Fast 2-D \(8\times 8\) discrete cosine transform algorithm for image coding