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...

Descripción completa

Detalles Bibliográficos
Autor principal: No, Albert
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2019
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7514640/
https://www.ncbi.nlm.nih.gov/pubmed/33266874
http://dx.doi.org/10.3390/e21020158
Descripción
Sumario: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.

Ejemplares similares