Universality of Logarithmic Loss in Successive Refinement

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

Internet

https://www.mdpi.com/1099-4300/21/2/158

Similar Items