The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
연속 정제 문제에서는 정보 소스에서 방출된 고정 길이 시퀀스가 두 개의 인코더에 의해 두 개의 코드워드로 인코딩되어 시퀀스를 두 번 재구성합니다. XNUMX개의 재구성 중 하나는 XNUMX개의 코드워드 중 하나에 의해 획득되고, 다른 재구성은 XNUMX개의 코드워드 모두에 의해 획득됩니다. 이 코딩 문제에 대해 우리는 왜곡이 주어진 왜곡 수준을 초과하는 각 확률이 주어진 확률 수준보다 작도록 두 인코더의 코드워드 수 쌍에 대한 비점근 내부 및 외부 경계를 제공합니다. 우리는 또한 일반 소스에 대한 속도 왜곡 영역에 대한 일반 공식을 제공합니다. 여기서 속도 왜곡 영역은 가능한 왜곡의 각 최대값이 주어진 왜곡 수준보다 작도록 두 인코더의 속도 쌍 세트입니다.
Tetsunao MATSUTA
Tokyo Institute of Technology
Tomohiko UYEMATSU
Tokyo Institute of Technology
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.
부
Tetsunao MATSUTA, Tomohiko UYEMATSU, "Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 12, pp. 2110-2124, December 2018, doi: 10.1587/transfun.E101.A.2110.
Abstract: In the successive refinement problem, a fixed-length sequence emitted from an information source is encoded into two codewords by two encoders in order to give two reconstructions of the sequence. One of two reconstructions is obtained by one of two codewords, and the other reconstruction is obtained by all two codewords. For this coding problem, we give non-asymptotic inner and outer bounds on pairs of numbers of codewords of two encoders such that each probability that a distortion exceeds a given distortion level is less than a given probability level. We also give a general formula for the rate-distortion region for general sources, where the rate-distortion region is the set of rate pairs of two encoders such that each maximum value of possible distortions is less than a given distortion level.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.2110/_p
부
@ARTICLE{e101-a_12_2110,
author={Tetsunao MATSUTA, Tomohiko UYEMATSU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem},
year={2018},
volume={E101-A},
number={12},
pages={2110-2124},
abstract={In the successive refinement problem, a fixed-length sequence emitted from an information source is encoded into two codewords by two encoders in order to give two reconstructions of the sequence. One of two reconstructions is obtained by one of two codewords, and the other reconstruction is obtained by all two codewords. For this coding problem, we give non-asymptotic inner and outer bounds on pairs of numbers of codewords of two encoders such that each probability that a distortion exceeds a given distortion level is less than a given probability level. We also give a general formula for the rate-distortion region for general sources, where the rate-distortion region is the set of rate pairs of two encoders such that each maximum value of possible distortions is less than a given distortion level.},
keywords={},
doi={10.1587/transfun.E101.A.2110},
ISSN={1745-1337},
month={December},}
부
TY - JOUR
TI - Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2110
EP - 2124
AU - Tetsunao MATSUTA
AU - Tomohiko UYEMATSU
PY - 2018
DO - 10.1587/transfun.E101.A.2110
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2018
AB - In the successive refinement problem, a fixed-length sequence emitted from an information source is encoded into two codewords by two encoders in order to give two reconstructions of the sequence. One of two reconstructions is obtained by one of two codewords, and the other reconstruction is obtained by all two codewords. For this coding problem, we give non-asymptotic inner and outer bounds on pairs of numbers of codewords of two encoders such that each probability that a distortion exceeds a given distortion level is less than a given probability level. We also give a general formula for the rate-distortion region for general sources, where the rate-distortion region is the set of rate pairs of two encoders such that each maximum value of possible distortions is less than a given distortion level.
ER -