An efficient algorithm for the 2-D discrete cosine transform
From MaRDI portal
Publication:673366
DOI10.1016/S0165-1684(96)00132-6zbMATH Open0925.65258OpenAlexW1999545574MaRDI QIDQ673366FDOQ673366
Authors: Gau-Shin Liu, Pei-Zong Lee
Publication date: 28 February 1997
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0165-1684(96)00132-6
Recommendations
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)
Cited In (8)
- The advanced OCA for 2-D discrete periodized wavelet transformation
- Two-dimensional linear convolution in the discrete trigonometric transform domain
- A refined fast 2-D discrete cosine transform algorithm
- On the regular structure for the fast 2-D DCT algorithm
- A generalized output pruning algorithm for matrix-vector multiplication and its application to compute discrete cosine transform
- A new two-dimensional fast cosine transform algorithm
- On the computation of two-dimensional DCT
- Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format
This page was built for publication: An efficient algorithm for the 2-D discrete cosine transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673366)