By Topic

Data compression on multifont Chinese character patterns

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Mu-King Tsay ; Inst. of Comput. Sci. & Electron. Eng., Nat. Central Univ., Chung-Li, Taiwan ; Chia-Hsu Kuo ; Rong-Huah Ju ; Ming-Ko Chiu

The problems arising in the modeling and coding of digital Chinese character patterns for noiseless compression purposes are discussed. The modeling is intended to capture the maximum redundancies of the source under the consideration of relevant parameters. In this study, a redundancy-gathering algorithm is proposed in which a 2-D parsing tree is used, and the nodes to extend the tree are ranked according to the maximum redundancy gathered. Hence, the modeling represented by the tree can achieve great performance in the small number of nodes. The algorithm is then applied to evaluate the performance of arithmetic coding for digital Chinese character patterns. The results are compared to those of the traditional compression methods. In the same complexity, the authors find that their algorithm can improve the coding efficiency as high as 25.54%, 30.23%, 32.17%, 15.90%, and 27.58%, for five Chinese fonts, respectively

Published in:

Image Processing, IEEE Transactions on  (Volume:3 ,  Issue: 2 )