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
_version_ 1783586634907779072
author No, Albert
author_facet No, Albert
author_sort No, Albert
collection PubMed
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.
format Online
Article
Text
id pubmed-7514640
institution National Center for Biotechnology Information
language English
publishDate 2019
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-75146402020-11-09 Universality of Logarithmic Loss in Successive Refinement † No, Albert Entropy (Basel) Article 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. MDPI 2019-02-08 /pmc/articles/PMC7514640/ /pubmed/33266874 http://dx.doi.org/10.3390/e21020158 Text en © 2019 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
No, Albert
Universality of Logarithmic Loss in Successive Refinement †
title 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_short Universality of Logarithmic Loss in Successive Refinement †
title_sort universality of logarithmic loss in successive refinement †
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7514640/
https://www.ncbi.nlm.nih.gov/pubmed/33266874
http://dx.doi.org/10.3390/e21020158
work_keys_str_mv AT noalbert universalityoflogarithmiclossinsuccessiverefinement

Ejemplares similares