Abstract
A great number of data associated with visual information requires usage of the popular DCT (Discrete Cosine Transform) compression. This also suggests the investigation of methods for image processing directly in the DCT domain. This paper presents a fast DCT domain image up-conversion algorithm, and a DCT domain linear filter, which only involves matrix manipulation. By using the separate property of certain spatial filters, we accomplish the DCT domain up-conversion via only matrix products. Because 1) most of the matrices can be calculated beforehand, and 2) common DCT blocks are very sparse; and 3) by avoiding the conventional decode and re-encode scheme, the computational complexities are greatly reduced. Experiments on real images show good results.
References
Assuncao, P. A. A. Ghanbari, M., 1998. A frequency-domain video transcoder for dynamic bit-rate reduction of MPEG-2 bit streams.IEEE Transactions on Circuits and Systems for Video Technology,8:953–967.
Assuncao, P. A. A. Ghanbari, M., 1997. Fast computation of MC-DCT for video transcoding.Electronics Letters,33:284–286.
Chang, S. F., Messerschmitt, D. G., 1995. Manipulation and composing of MC-DCT compressed video.IEEE J-Sel. Area on Commu,13(1):1–11.
Chiptrasert, B. Rao, K. R., 1990. Discrete cosine transform filtering.Sig. Proc. 19(3):233–245.
Merhav, N., Bhaskaran, V., 1996. A fast algorithm for DCT-domain inverse motion compensation, IEEE International Conference on Acoustics.Speech, and Signal Processing,4(4):2307–2310.
Merhav, N. Bhasharan V., 1997. Fast algorithms for DCT domain image down-conversion and for inverse motion compensation.IEEE T-CSVT,7(3):468–476.
Neri, A. Russo G. Talone P., 1994. Inter-block filtering and down conversion in DCT domain.Sig. Proc.: Image Communication,6:303–317.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hong-dong, L., Rong, X., Ji-lin, L. et al. Fast algorithm for DCT domain image up-conversion. J. Zhejiang Univ. Sci. A 1, 264–268 (2000). https://doi.org/10.1631/BF02910634
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1631/BF02910634