{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:38:49Z","timestamp":1773376729268,"version":"3.50.1"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206646","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"531-536","source":"Crossref","is-referenced-by-count":13,"title":["Computation of Rate-Distortion-Perception Function under f-Divergence Perception Constraints"],"prefix":"10.1109","author":[{"given":"Giuseppe","family":"Serra","sequence":"first","affiliation":[{"name":"EURECOM,Communication Systems Department,Sophia-Antipolis,France"}]},{"given":"Photios A.","family":"Stavrou","sequence":"additional","affiliation":[{"name":"EURECOM,Communication Systems Department,Sophia-Antipolis,France"}]},{"given":"Marios","family":"Kountouris","sequence":"additional","affiliation":[{"name":"EURECOM,Communication Systems Department,Sophia-Antipolis,France"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2865570"},{"key":"ref12","first-page":"1","article-title":"A coding theorem for the rate-distortion-perception function","author":"theis","year":"2021","journal-title":"International Conference on Learning Representations (ICLR)"},{"key":"ref15","article-title":"The rate-distortion-perception tradeoff: The role of common randomness","author":"wagner","year":"2022"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3231820"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3274122"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.2000604"},{"key":"ref2","first-page":"142","article-title":"Coding theorems for a discrete source with a fidelity criterion","volume":"4","author":"shannon","year":"1993","journal-title":"Institute of Radio Engineers International Convention Record"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3390\/e20050383"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1504\/IJICT.2022.119317","article-title":"A rate-distortion-perception theory for binary sources","author":"qian","year":"2022","journal-title":"The International Zurich Seminar on Information and Communication"},{"key":"ref19","author":"yeung","year":"2008","journal-title":"Information Theory and Network Coding"},{"key":"ref18","first-page":"205","article-title":"Information geometry and alternating minimization procedures","volume":"1","author":"csiszar","year":"1984","journal-title":"Statistics and Decisions Dedewicz"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3095406"},{"key":"ref23","author":"blahut","year":"1987","journal-title":"Principles and Practice of Information Theory"},{"key":"ref25","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054855"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1561\/0100000004"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/PCS48520.2019.8954548"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00260"},{"key":"ref9","first-page":"675","article-title":"Rethinking lossy compression: The rate-distortion-perception tradeoff","author":"blau","year":"2019","journal-title":"International Conference on Machine Learning"},{"key":"ref4","first-page":"11517","article-title":"Universal rate-distortion-perception representations for lossy compression","volume":"34","author":"zhang","year":"2021","journal-title":"Advances in neural information processing systems"},{"key":"ref3","article-title":"Joint autoregressive and hierarchical priors for learned image compression","volume":"31","author":"minnen","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1109\/CVPR.2017.19","article-title":"Photo-realistic single image super-resolution using a generative adversarial network","author":"ledig","year":"2017","journal-title":"2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2020.3036752"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206646.pdf?arnumber=10206646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:58Z","timestamp":1773347278000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206646\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206646","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}