Enhancements of partitioning techniques for image compression using weighted finite automata

Authors:
F. Katritzke;W. Merzenich;M. Thomas
Affiliations:
Department of Electronic Engineering and Computer Science, University of Siegen, Siegen, Germany;Department of Electronic Engineering and Computer Science, University of Siegen, Siegen, Germany;Mathematical Department, University of Siegen, Siegen, Germany
Venue:
Theoretical Computer Science - Implementation and application automata
Year:
2004

Citing 2
Cited 5

Fractal encoding with HV partitions

Fractal image compression
Inference algorithms for WFA and image compression

Fractal image compression

WeightedWord Recognition

Fundamenta Informaticae
How to Tackle Integer Weighted Automata Positivity

RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Component Simulation-based Substitutivity Managing QoS Aspects

Electronic Notes in Theoretical Computer Science (ENTCS)
Component simulation-based substitutivity managing QoS and composition issues

Science of Computer Programming
WeightedWord Recognition

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Weighted finite automata are efficient structures for the storage of digital images. The choice of the image partitioning technique is important to achieve good compression results. In this paper we examine two promising techniques by measuring the compression performance at well-known test images.