{"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}
引用次数: 0
Abstract
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.