Accession Number : ADA119419

Title :   Using String Matching to Compress Chinese Characters,

Corporate Author : STANFORD UNIV CA DEPT OF COMPUTER SCIENCE

Personal Author(s) : Guoan,Gu ; Hobby,John

PDF Url : ADA119419

Report Date : May 1982

Pagination or Media Count : 16

Abstract : A new method for font compression is introduced and compared to existing methods. A very compact representation is achieved by using a variant of McCreight's string matching algorithm to compress the bounding contour. Results from an actual implementation are given showing the improvement over other methods and how this varies with resolution and character complexity. Compression ratios of up to 150 are achieved for Chinese characters. (Author)

Descriptors :   *Data compression, *Character recognition, *Alphabets, *Chinese language, Computer applications, Printing, Character generators, Machine coding, Algorithms, Matching, Computer programs, Data processing, Alphanumeric data

Subject Categories : Linguistics
      Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE