Detailed Information
Cited 4 time in 
Cited 2 time in 
Cited 2 time in
Metadata Downloads
Universality of Logarithmic Loss in Successive Refinement
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | No, Albert | - |
| dc.date.available | 2020-07-10T04:02:07Z | - |
| dc.date.created | 2020-07-06 | - |
| dc.date.issued | 2019-02 | - |
| dc.identifier.issn | 1099-4300 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/2001 | - |
| dc.description.abstract | 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. | - |
| dc.language | 영어 | - |
| dc.language.iso | en | - |
| dc.publisher | MDPI | - |
| dc.title | Universality of Logarithmic Loss in Successive Refinement | - |
| dc.type | Article | - |
| dc.contributor.affiliatedAuthor | No, Albert | - |
| dc.identifier.doi | 10.3390/e21020158 | - |
| dc.identifier.scopusid | 2-s2.0-85061975615 | - |
| dc.identifier.wosid | 000460742200059 | - |
| dc.identifier.bibliographicCitation | ENTROPY, v.21, no.2 | - |
| dc.relation.isPartOf | ENTROPY | - |
| dc.citation.title | ENTROPY | - |
| dc.citation.volume | 21 | - |
| dc.citation.number | 2 | - |
| dc.type.rims | ART | - |
| dc.type.docType | Article | - |
| dc.description.journalClass | 1 | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Physics | - |
| dc.relation.journalWebOfScienceCategory | Physics, Multidisciplinary | - |
| dc.subject.keywordPlus | COMPRESSION | - |
| dc.subject.keywordAuthor | logarithmic loss | - |
| dc.subject.keywordAuthor | rate-distortion | - |
| dc.subject.keywordAuthor | successive refinability | - |
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.