JUCS - Journal of Universal Computer Science 3(10): 1100-1113, doi: 10.3217/jucs-003-10-1100
Compression of Silhouette-like Images based on WFA
expand article infoKarel Culik Ii.‡, Vladimir Valenta‡, Jarkko Kari§
‡ Department of Computer Science, University of South Carolina, Columbia, SC, United States of America§ Iterated Systems, Inc., Atlanta, GA, United States of America

Corresponding author: Karel Ii.

© Karel Ii., Vladimir Valenta, Jarkko Kari.
This article is freely available under the J.UCS Open Content License.
Citation: Ii. KC, Valenta V, Kari J (1997) Compression of Silhouette-like Images based on WFA. JUCS - Journal of Universal Computer Science 3(10): 1100-1113. https://doi.org/10.3217/jucs-003-10-1100
Open Access
Abstract
We describe a new approach to lossy compression of silhouette-like images. By a silhouette-like image we mean a bi-level image consisting of black and white regions divided by a small number of closed curves. We use a boundary detection algorithm to express the closed curves by chain codes, and we express the chains as one function of one variable. We compress this function using WFA over two letter alphabet. Finally, we use arithmetic coding to store the automaton. 1.) This work was supported by the National Science Foundation under Grant No. CCR-9417384. Preliminary version was presented in DCC 1997.