[3]

For compressing/processing of images there are multiple algorithms and steps needed to be
performed in WFA (weighted finite automata). WFA is a variant of finite automata. It is a finite
automata, whose transitions are weighted by real weights. Each state of WFA has two weights,
one is called the initial distribution value, while the other is called the final distribution. Here
data will be compressed using weighted finite automata.
[8]
It has been declared a codec which is based on weighted finite automata in order to compress the
still images. The compression performance of WFA at low bit rate is much better to compress
JPEG images. Regeneration of images is done faster in WFA, because of less complexity and its
mathematical structure. WFA compression basis are very close to fractal image compression. An
image is subdivided into sub images using binary partitioning. It provides better performance as
compared to quad tree partitioning. Both of these ranges or partitions are approximated by linear
combination of images of pool. The domain pool consists of two sets of multi resolution images,
first one is trigonometric or polynomial functions, and the other one is generated in coding
process. So this area of work provide modification of weighted finite automata.