DMCA
An Efficient Decoding Algorithm for WFA
BibTeX
@MISC{U_anefficient,
author = {Raghavendra Udupa U and Vinayaka D Pandit and U Vinayaka and D Pandit and Tanveer A Faruquie},
title = {An Efficient Decoding Algorithm for WFA},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Several promising image/video data compression techniques that explicitly exploit self-similarity in images and videos have been proposed in the recent past. While most of these fractal techniques are variants and/or enhancements of Jacquin's Iterated Function Systems (IFS), the Weighted Finite Automata (WFA) techniques (introduced by Culik and Kari) are based on automata theory and are known to yield better compression rates than the IFS techniques in practice. The algorithm proposed by Culik and Kari for decoding WFA is simple but inecient. It is very slow and has very high memory requirements. In this paper we give a simple decoding algorithm which is not only faster but also requires considerably less memory.
