具有任意指标的有限信道的失真与感知权衡特征

Dror Freirich, Nir Weinberger, Ron Meir
{"title":"具有任意指标的有限信道的失真与感知权衡特征","authors":"Dror Freirich, Nir Weinberger, Ron Meir","doi":"arxiv-2402.02265","DOIUrl":null,"url":null,"abstract":"Whenever inspected by humans, reconstructed signals should not be\ndistinguished from real ones. Typically, such a high perceptual quality comes\nat the price of high reconstruction error, and vice versa. We study this\ndistortion-perception (DP) tradeoff over finite-alphabet channels, for the\nWasserstein-$1$ distance induced by a general metric as the perception index,\nand an arbitrary distortion matrix. Under this setting, we show that computing\nthe DP function and the optimal reconstructions is equivalent to solving a set\nof linear programming problems. We provide a structural characterization of the\nDP tradeoff, where the DP function is piecewise linear in the perception index.\nWe further derive a closed-form expression for the case of binary sources.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"12 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Characterization of the Distortion-Perception Tradeoff for Finite Channels with Arbitrary Metrics\",\"authors\":\"Dror Freirich, Nir Weinberger, Ron Meir\",\"doi\":\"arxiv-2402.02265\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Whenever inspected by humans, reconstructed signals should not be\\ndistinguished from real ones. Typically, such a high perceptual quality comes\\nat the price of high reconstruction error, and vice versa. We study this\\ndistortion-perception (DP) tradeoff over finite-alphabet channels, for the\\nWasserstein-$1$ distance induced by a general metric as the perception index,\\nand an arbitrary distortion matrix. Under this setting, we show that computing\\nthe DP function and the optimal reconstructions is equivalent to solving a set\\nof linear programming problems. We provide a structural characterization of the\\nDP tradeoff, where the DP function is piecewise linear in the perception index.\\nWe further derive a closed-form expression for the case of binary sources.\",\"PeriodicalId\":501433,\"journal\":{\"name\":\"arXiv - CS - Information Theory\",\"volume\":\"12 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2402.02265\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2402.02265","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在人类检测时,重建信号不应与真实信号有任何区别。通常,这种高感知质量是以高重建误差为代价的,反之亦然。我们研究了有限字母信道上的这种失真-感知(DP)权衡,研究对象是以一般度量作为感知指数的瓦瑟斯坦-1 美元距离和任意失真矩阵。在这种情况下,我们证明计算 DP 函数和最优重构等同于求解一组线性规划问题。我们提供了 DP 权衡的结构特征,其中 DP 函数与感知指数成片断线性关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Characterization of the Distortion-Perception Tradeoff for Finite Channels with Arbitrary Metrics
Whenever inspected by humans, reconstructed signals should not be distinguished from real ones. Typically, such a high perceptual quality comes at the price of high reconstruction error, and vice versa. We study this distortion-perception (DP) tradeoff over finite-alphabet channels, for the Wasserstein-$1$ distance induced by a general metric as the perception index, and an arbitrary distortion matrix. Under this setting, we show that computing the DP function and the optimal reconstructions is equivalent to solving a set of linear programming problems. We provide a structural characterization of the DP tradeoff, where the DP function is piecewise linear in the perception index. We further derive a closed-form expression for the case of binary sources.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信