DATA-COMPRESSION ON MULTIFONT CHINESE CHARACTER PATTERNS

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > journal & Dissertation > Item 987654321/29236

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29236

Title:	DATA-COMPRESSION ON MULTIFONT CHINESE CHARACTER PATTERNS
Authors:	TSAY,MK;KUO,CH;JU,RH;CHIU,MK
Contributors:	資訊工程研究所
Date:	1994
Issue Date:	2010-06-29 20:17:09 (UTC+8)
Publisher:	中央大學
Abstract:	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, we find that our 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.
Relation:	IEEE TRANSACTIONS ON IMAGE PROCESSING
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	565	View/Open

社群 sharing