Universality of Logarithmic Loss in Successive Refinement

We establish an universal property of logarithmic loss in the successive refinement problem. If the first decoder operates under logarithmic loss, we show that any discrete memoryless source is successively refinable under an arbitrary distortion criterion for the second decoder. Based on this resul...

Full description

Bibliographic Details
Main Author:	Albert No
Format:	Article
Language:	English
Published:	MDPI AG 2019-02-01
Series:	Entropy
Subjects:	logarithmic loss rate-distortion successive refinability
Online Access:	https://www.mdpi.com/1099-4300/21/2/158

id	doaj-bc18dcc28c7843eea77977eb65bad5fe
record_format	Article
spelling	doaj-bc18dcc28c7843eea77977eb65bad5fe2020-11-24T22:06:39ZengMDPI AGEntropy1099-43002019-02-0121215810.3390/e21020158e21020158Universality of Logarithmic Loss in Successive RefinementAlbert No0Department of Electronic and Electrical Engineering, Hongik University, Seoul 04066, KoreaWe establish an universal property of logarithmic loss in the successive refinement problem. If the first decoder operates under logarithmic loss, we show that any discrete memoryless source is successively refinable under an arbitrary distortion criterion for the second decoder. Based on this result, we propose a low-complexity lossy compression algorithm for any discrete memoryless source.https://www.mdpi.com/1099-4300/21/2/158logarithmic lossrate-distortionsuccessive refinability
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Albert No
spellingShingle	Albert No Universality of Logarithmic Loss in Successive Refinement Entropy logarithmic loss rate-distortion successive refinability
author_facet	Albert No
author_sort	Albert No
title	Universality of Logarithmic Loss in Successive Refinement
title_short	Universality of Logarithmic Loss in Successive Refinement
title_full	Universality of Logarithmic Loss in Successive Refinement
title_fullStr	Universality of Logarithmic Loss in Successive Refinement
title_full_unstemmed	Universality of Logarithmic Loss in Successive Refinement
title_sort	universality of logarithmic loss in successive refinement
publisher	MDPI AG
series	Entropy
issn	1099-4300
publishDate	2019-02-01
description	We establish an universal property of logarithmic loss in the successive refinement problem. If the first decoder operates under logarithmic loss, we show that any discrete memoryless source is successively refinable under an arbitrary distortion criterion for the second decoder. Based on this result, we propose a low-complexity lossy compression algorithm for any discrete memoryless source.
topic	logarithmic loss rate-distortion successive refinability
url	https://www.mdpi.com/1099-4300/21/2/158
work_keys_str_mv	AT albertno universalityoflogarithmiclossinsuccessiverefinement
_version_	1725822612510081024

Universality of Logarithmic Loss in Successive Refinement

Similar Items