Fast recursive algorithms for 2-D discrete cosine transform.
A new algorithm for computation of two-dimensional (2D) type-III discrete cosine transform is presented. The algorithm is particularly suited to block size \((p_1*2^m)\) by \((p_2*2n)\), where \(p_{1}\) and \(p_{2}\) are odd integers, and \(m\) and \(n\) are non-negative integers. It shows that the 2D type-III DCT can be decomposed into cosine-cosine, cosine-sine, sine-cosine, sine-sine sequences, which can be further decomposed into similar sequences. The proposed algorithm provides the flexibility in choosing block size and has a simple indexing mapping scheme and a fairly regular computation structure. The algorithm also requires a smaller number of arithmetic operations for \(p_{1}=p_{2}=3\).
- A unified algorithm for subband-based discrete cosine transform
- Complexity reduction, self/completely recursive, radix-2 DCT I/IV algorithms
- Concurrent computation of two-dimensional discrete cosine transform
- On the computation of two-dimensional DCT
- Fast computation of two-dimensional discrete cosine transforms using fast discrete radon transform
- A new two-dimensional fast cosine transform algorithm
- New fast recursive algorithms for the computation of discrete cosine and sine transforms
- scientific article; zbMATH DE number 1833436 (Why is no real title available?)
- Two-dimensional linear convolution in the discrete trigonometric transform domain
- A tutorial overview on the properties of the discrete cosine transform for encoded image and video processing
- An efficient algorithm for the 2-D discrete cosine transform
- Improvement of the discrete cosine transform calculation by means of a recursive method
This page was built for publication: Fast recursive algorithms for 2-D discrete cosine transform.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575779)
