Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An efficient raster font compression for embedded systems

From MaRDI portal
Publication:609148
Jump to:navigation, search

DOI10.1016/J.PATCOG.2010.07.018zbMath1211.68191OpenAlexW2002808423MaRDI QIDQ609148

Borut Žalik, Timotej Globačnik

Publication date: 30 November 2010

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2010.07.018


zbMATH Keywords

embedded systemschain code compressionchain codesraster font compressionraster fonts


Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)


Related Items (2)

Can Burrows-Wheeler transform be replaced in chain code compression? ⋮ Efficient chain code compression with interpolative coding


Uses Software

  • METAFONT



Cites Work

  • Data compression
  • An optimal polygonal boundary encoding scheme in the rate distortion sense
  • A Method for the Construction of Minimum-Redundancy Codes
  • Unnamed Item




This page was built for publication: An efficient raster font compression for embedded systems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:609148&oldid=12502336"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 07:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki