Variable-length lossy compression allowing positive overflow and excess distortion probabilities

Shota Saito; Hideki Yagi; Toshiyasu Matsushima

doi:10.1109/ISIT.2017.8006793

Variable-length lossy compression allowing positive overflow and excess distortion probabilities

Shota Saito, Hideki Yagi, Toshiyasu Matsushima

School of Fundamental Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

Abstract

This paper investigates the problem of variable-length lossy source coding. We deal with the case where both the excess distortion probability and the overflow probability of codeword length are less than or equal to positive constants. The infimum of the thresholds on the overflow probability is characterized by a smooth max entropy-based quantity. Both non-asymptotic and asymptotic cases are analyzed. To show the achievability results, we do not utilize the random coding argument but give an explicit code construction.

Original language	English
Title of host publication	2017 IEEE International Symposium on Information Theory, ISIT 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1568-1572
Number of pages	5
ISBN (Electronic)	9781509040964
DOIs	https://doi.org/10.1109/ISIT.2017.8006793
Publication status	Published - 2017 Aug 9
Event	2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany Duration: 2017 Jun 25 → 2017 Jun 30

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Other

Other	2017 IEEE International Symposium on Information Theory, ISIT 2017
Country/Territory	Germany
City	Aachen
Period	17/6/25 → 17/6/30

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2017.8006793

Cite this

Saito, S., Yagi, H., & Matsushima, T. (2017). Variable-length lossy compression allowing positive overflow and excess distortion probabilities. In 2017 IEEE International Symposium on Information Theory, ISIT 2017 (pp. 1568-1572). Article 8006793 (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2017.8006793

Variable-length lossy compression allowing positive overflow and excess distortion probabilities. / Saito, Shota; Yagi, Hideki; Matsushima, Toshiyasu.
2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 1568-1572 8006793 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Saito, S, Yagi, H & Matsushima, T 2017, Variable-length lossy compression allowing positive overflow and excess distortion probabilities. in 2017 IEEE International Symposium on Information Theory, ISIT 2017., 8006793, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 1568-1572, 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, 17/6/25. https://doi.org/10.1109/ISIT.2017.8006793

Saito S, Yagi H, Matsushima T. Variable-length lossy compression allowing positive overflow and excess distortion probabilities. In 2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 1568-1572. 8006793. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2017.8006793

@inproceedings{97451e56c0084c61bb205d73f9ac44b6,

title = "Variable-length lossy compression allowing positive overflow and excess distortion probabilities",

abstract = "This paper investigates the problem of variable-length lossy source coding. We deal with the case where both the excess distortion probability and the overflow probability of codeword length are less than or equal to positive constants. The infimum of the thresholds on the overflow probability is characterized by a smooth max entropy-based quantity. Both non-asymptotic and asymptotic cases are analyzed. To show the achievability results, we do not utilize the random coding argument but give an explicit code construction.",

author = "Shota Saito and Hideki Yagi and Toshiyasu Matsushima",

note = "Funding Information: ACKNOWLEDGMENT This work was supported in part by JSPS KAKENHI Grant Numbers 26289119, 16K00195, 16K06340, and 17K06446. Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",

year = "2017",

month = aug,

day = "9",

doi = "10.1109/ISIT.2017.8006793",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1568--1572",

booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",

}

TY - GEN

T1 - Variable-length lossy compression allowing positive overflow and excess distortion probabilities

AU - Saito, Shota

AU - Yagi, Hideki

AU - Matsushima, Toshiyasu

PY - 2017/8/9

Y1 - 2017/8/9

N2 - This paper investigates the problem of variable-length lossy source coding. We deal with the case where both the excess distortion probability and the overflow probability of codeword length are less than or equal to positive constants. The infimum of the thresholds on the overflow probability is characterized by a smooth max entropy-based quantity. Both non-asymptotic and asymptotic cases are analyzed. To show the achievability results, we do not utilize the random coding argument but give an explicit code construction.

AB - This paper investigates the problem of variable-length lossy source coding. We deal with the case where both the excess distortion probability and the overflow probability of codeword length are less than or equal to positive constants. The infimum of the thresholds on the overflow probability is characterized by a smooth max entropy-based quantity. Both non-asymptotic and asymptotic cases are analyzed. To show the achievability results, we do not utilize the random coding argument but give an explicit code construction.

UR - http://www.scopus.com/inward/record.url?scp=85034116704&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85034116704&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2017.8006793

DO - 10.1109/ISIT.2017.8006793

M3 - Conference contribution

AN - SCOPUS:85034116704

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1568

EP - 1572

BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 IEEE International Symposium on Information Theory, ISIT 2017

Y2 - 25 June 2017 through 30 June 2017

ER -

Variable-length lossy compression allowing positive overflow and excess distortion probabilities

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this