Abstract
The discrete cosine transform (DCT) is now the established technique for image and video coding. In most image coding schemes, a large number- of high-frequency transform coefficients can be neglected and need not be calculated. Therefore, significant savings in computation can be obtained by applying pruning in the fast algorithms. In this work, we analyze pruning in Chan and Ho's fast DCT algorithm and evaluate the saving of operations.
Original language | English |
---|---|
Pages (from-to) | 714-717 |
Number of pages | 4 |
Journal | IEEE Transactions on Signal Processing |
Volume | 44 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1 Dec 1996 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Signal Processing