Ancient typefaces and parametric weighted finite automata

  • Authors:
  • Jürgen Albert;German Tischler

  • Affiliations:
  • Dept. of Computer Science, University of Würzburg, Germany;Dept. of Informatics, King's College London, UK

  • Venue:
  • Rainbow of computer science
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

Generalizations of weighted finite automata where real-valued weights are assigned to all transitions and d-dimensional vectors of real values belong to the states (PWFA) have been studied w.r.t. compact representations of glyphs from ancient fonts, especially from the ubiquitous fraktur-families. It is well-known, that polynomials of arbitrary degree over the unit interval can be generated by simple weighted finite automata in an elegant and compact manner. This result carries over nicely to the representation of typefaces. There it is first applied to the outlines of the glyphs and then to their interiors. Finally, we show that even animated writing, i.e. video-clips of drawing glyphs with a pen as if by a human hand, can be modeled by PWFA.