Skew and infinitary formal power series
Theoretical Computer Science
Weighted tree automata and weighted logics
Theoretical Computer Science
On generalizations of weighted finite automata and graphics applications
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Weighted automata and weighted logics on infinite words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 0.00 |
Weighted finite automata (WFA) exploit self similarities within single pictures and also sequences of pictures to remove spatial and temporal redundancies. Due to their simple mathematical structure, WFA provide an ideal platform for efficient hybrid compression methods. We present a new coding algorithm that hierarchically compounds adjacent ranges to subsets which are predicted prior to encoding. Prediction may use a coarse linear combination or a motion compensation depending on whether intra- or inter-frames are coded. We show that the new WFA codec clearly outperforms the video coding standard H.263.