Compression-time Shortening Algorithm on JPEG2000 using Pre-Truncation Method 


Vol. 28,  No. 1, pp. 64-71, Jan.  2003


PDF
  Abstract

In this paper, we proposed an algorithm that shorten coding time maintaining image quality in JPEG2000, which is the standard of still image compression. This method encodes only the bit plane selected as appropriate truncation point for output bitstream, obtained from estimation of frequency distribution for whole image Wavelet characterized by multi-resolution has vertical, horizontal, and diagonal frequency components for each resolution The frequency interrelation addressed above is maintained thorough whole level of resolution and represents the unique frequency characteristics for input image. Thus, using the frequency relation at highest level, we can pick the truncation point for the compression time decrease by estimating code bits at encoding each code block Also, we reduced the encoding time using simply downsampling instead of low-pass filtering at low-levels which are not encoded in color component of lower energy than luminance component From the proposed algorithm, we can reduce about 15~36% of encoding time maintaining PSNR 30±0 5dB

  Statistics
Cumulative Counts from November, 2022
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]

N. Yang and J. Chung, "Compression-time Shortening Algorithm on JPEG2000 using Pre-Truncation Method," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 1, pp. 64-71, 2003. DOI: .

[ACM Style]

Nak-min Yang and Jae-Ho Chung. 2003. Compression-time Shortening Algorithm on JPEG2000 using Pre-Truncation Method. The Journal of Korean Institute of Communications and Information Sciences, 28, 1, (2003), 64-71. DOI: .

[KICS Style]

Nak-min Yang and Jae-Ho Chung, "Compression-time Shortening Algorithm on JPEG2000 using Pre-Truncation Method," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 1, pp. 64-71, 1. 2003.