Using String Matching to Compress Chinese Characters,

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1982
Accession Number
ADA119419

Entities

People

  • Gu Guoan
  • John Hobby

Organizations

  • Stanford University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Alphabets
  • Assembly Languages
  • Boundaries
  • Coding
  • Compression
  • Compression Ratio
  • Computer Programming
  • Computer Science
  • Computers
  • Data Compression
  • Decoding
  • High Resolution
  • Low Resolution
  • Personality
  • Probability
  • Probability Distributions

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computer Programming and Software Development.