An efficient raster font compression for embedded systems

Authors:
Timotej Globačnik;Borut alik
Affiliations:
Gorenje Household Appliances, Research & Development Group, Partizanska 12, SI-3503 Velenje, Slovenia;University of Maribor, Faculty of Electrical Engineering and Computer Science, Smetanova 17, SI-2000 Maribor, Slovenia
Venue:
Pattern Recognition
Year:
2010

Citing 3
Cited 2

Inside Macintosh, Vol. I

Inside Macintosh, Vol. I
An efficient chain code with Huffman coding

Pattern Recognition
An optimal polygonal boundary encoding scheme in the rate distortion sense

IEEE Transactions on Image Processing

Directional difference chain codes with quasi-lossless compression and run-length encoding

Image Communication
Chain code lossless compression using move-to-front transform and adaptive run-length encoding

Image Communication

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a new lossless raster font compression method that uses vertex chain code to define character's outline. Obtained chain codes are compressed by Huffman coding algorithm. The results show that the new method requires least memory space to store the raster fonts among the known methods. Moreover, the font size has almost no impact on the coder efficiency. Due to the low complexity of the decoder that occupies only 2.7kB of memory space, this method is ideal for use in embedded systems.