An Efficient Compression Algorithm for Simple Computer Cell Animation 


Vol. 27,  No. 3, pp. 211-220, Mar.  2002


PDF
  Abstract

In this paper, we propose an efficient algorithm to compress simple computer cell animation at very low bit rate. The structure of proposed algorithm consists of intra frame coding and inter frame coding. In inter frame coding, animation is encoded by color quantization using a palette, rearrangement of index, ADPCM used in JPEG-LS, mapping, classification, and entropy coding. In interframe coding, classifying the characteristics of motion, animation is encoded by block based motion replenishment. Experimental results show that the proposed methods turns out to outperform conventional methods including Flash, FLC, Motion-JPEG, MPEG-1, and MPEG-4.

  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]

B. Min, J. Jeong, B. Choi, "An Efficient Compression Algorithm for Simple Computer Cell Animation," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 3, pp. 211-220, 2002. DOI: .

[ACM Style]

Byong-seok Min, Je-chang Jeong, and Byung-uk Choi. 2002. An Efficient Compression Algorithm for Simple Computer Cell Animation. The Journal of Korean Institute of Communications and Information Sciences, 27, 3, (2002), 211-220. DOI: .

[KICS Style]

Byong-seok Min, Je-chang Jeong, Byung-uk Choi, "An Efficient Compression Algorithm for Simple Computer Cell Animation," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 3, pp. 211-220, 3. 2002.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880