JUCS - Journal of Universal Computer Science 5(4): 227-242, doi: 10.3217/jucs-005-04-0227
Generalized Weighted Finite Automata Based Image Compression
expand article infoKarel Culik Ii.‡, Peter C. von Rosenberg‡
‡ Department of Computer Science University of South Carolina Columbia, United States of America

Corresponding author: Karel Ii. ( culik@cs.sc.edu )

© Karel Ii., Peter C. von Rosenberg.
This article is freely available under the J.UCS Open Content License.
Citation: Ii. KC, Rosenberg PC (1999) Generalized Weighted Finite Automata Based Image Compression. JUCS - Journal of Universal Computer Science 5(4): 227-242. https://doi.org/10.3217/jucs-005-04-0227
Open Access
Abstract
The Culik-Kari recursive inference algorithm for WFA is based on an effcient way of expressing subsquares of the given image as linear combinations of available states. Here we improve it in two ways. First, we allow the use of rotations, flippings and negations of the states in the linear combination. Second, in order to get the best possible representation of simple fractal images we allow the creation of edges pointing to ancestors of states under construction which, for technical reasons, was not done in the original recursive algorithm.
Keywords
image-data compression, nite automata, WFA, fractal-image compression