A New Approximate DCT Computation Based on Subband Decomposition and Its Application


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 5, pp. 1329-1336, Sep. 1996
10.3745/KIPSTE.1996.3.5.1329,   PDF Download:

Abstract

In many image compression applications, the discrete cosine transform(DCT) is well known for its highly efficient coding performance. However, it produces undesirable block artifacts in low-bit rate coding. In addition, in many practical applications, faster computation and easier VLSI implementation of DCT coefficients are also important issues. The removal of the block artifacts and faster DCT computation are therefore of practical interest. In this paper, a modified DCT computation scheme was investigated, which provides a simple efficient solution to the reduction of the block artifacts while achieving faster computation. We have applied the new approach to the low-bit rate coding and decoding of images. Simulation results on real images have verified the improved performance of the proposed methods over the standard method.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. S. Hwan, "A New Approximate DCT Computation Based on Subband Decomposition and Its Application," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 3, no. 5, pp. 1329-1336, 1996. DOI: 10.3745/KIPSTE.1996.3.5.1329.

[ACM Style]
Jung Sung Hwan. 1996. A New Approximate DCT Computation Based on Subband Decomposition and Its Application. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 3, 5, (1996), 1329-1336. DOI: 10.3745/KIPSTE.1996.3.5.1329.