This paper investigates the fixed-slope lossy coding of individual sequences and nonstationary sources. We clarify that, for a given individual sequence, the optimal cost attainable by the blockwise lossy encoders is equal to the optimal average cost with respect to the empirical distribution of the given sequence. Moreover, we show that, for a given nonstationary source, the optimal cost attainable by the blockwise encoders is equal to the supremum of the optimal average cost over all the stationary sources in the stationary hull of the given source. In addition, we show that the universal lossy coding algorithm based on Lempel-Ziv 78 code attains the optimal cost for any individual sequence and any nonstationary source.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Shigeaki KUZUOKA, Tomohiko UYEMATSU, "Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 3, pp. 836-845, March 2008, doi: 10.1093/ietfec/e91-a.3.836.
Abstract: This paper investigates the fixed-slope lossy coding of individual sequences and nonstationary sources. We clarify that, for a given individual sequence, the optimal cost attainable by the blockwise lossy encoders is equal to the optimal average cost with respect to the empirical distribution of the given sequence. Moreover, we show that, for a given nonstationary source, the optimal cost attainable by the blockwise encoders is equal to the supremum of the optimal average cost over all the stationary sources in the stationary hull of the given source. In addition, we show that the universal lossy coding algorithm based on Lempel-Ziv 78 code attains the optimal cost for any individual sequence and any nonstationary source.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.3.836/_p
Copy
@ARTICLE{e91-a_3_836,
author={Shigeaki KUZUOKA, Tomohiko UYEMATSU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources},
year={2008},
volume={E91-A},
number={3},
pages={836-845},
abstract={This paper investigates the fixed-slope lossy coding of individual sequences and nonstationary sources. We clarify that, for a given individual sequence, the optimal cost attainable by the blockwise lossy encoders is equal to the optimal average cost with respect to the empirical distribution of the given sequence. Moreover, we show that, for a given nonstationary source, the optimal cost attainable by the blockwise encoders is equal to the supremum of the optimal average cost over all the stationary sources in the stationary hull of the given source. In addition, we show that the universal lossy coding algorithm based on Lempel-Ziv 78 code attains the optimal cost for any individual sequence and any nonstationary source.},
keywords={},
doi={10.1093/ietfec/e91-a.3.836},
ISSN={1745-1337},
month={March},}
Copy
TY - JOUR
TI - Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 836
EP - 845
AU - Shigeaki KUZUOKA
AU - Tomohiko UYEMATSU
PY - 2008
DO - 10.1093/ietfec/e91-a.3.836
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2008
AB - This paper investigates the fixed-slope lossy coding of individual sequences and nonstationary sources. We clarify that, for a given individual sequence, the optimal cost attainable by the blockwise lossy encoders is equal to the optimal average cost with respect to the empirical distribution of the given sequence. Moreover, we show that, for a given nonstationary source, the optimal cost attainable by the blockwise encoders is equal to the supremum of the optimal average cost over all the stationary sources in the stationary hull of the given source. In addition, we show that the universal lossy coding algorithm based on Lempel-Ziv 78 code attains the optimal cost for any individual sequence and any nonstationary source.
ER -