对称相关高斯源的分布式有损编码

Siyao Zhou, Sadaf Salehkalaibar, Jingjing Qian, Jun Chen, Wuxian Shi, Yiqun Ge, W. Tong
{"title":"对称相关高斯源的分布式有损编码","authors":"Siyao Zhou, Sadaf Salehkalaibar, Jingjing Qian, Jun Chen, Wuxian Shi, Yiqun Ge, W. Tong","doi":"10.1109/CISS53076.2022.9751178","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a distributed lossy compression network with $L$ encoders and a decoder. Each encoder observes a source and sends a compressed version to the decoder. The decoder produces a joint reconstruction of target signals with the mean squared error distortion below a given threshold. It is assumed that the observed sources can be expressed as the sum of target signals and corruptive noises which are independently generated from two symmetric multivariate Gaussian distributions. We are interested in the minimum compression rate of this network versus the distortion threshold, which is known as the rate-distortion function. We derive a lower bound on the rate-distortion function by explicitly solving a max-min problem. Our lower bound matches the well-known Berger-Tung upper bound for some values of the distortion threshold. The asymptotic expressions of the upper and lower bounds are derived in the large $L$ limit and are shown to coincide under specific constraints.","PeriodicalId":305918,"journal":{"name":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Distributed Lossy Coding of Symmetrically Correlated Gaussian Sources\",\"authors\":\"Siyao Zhou, Sadaf Salehkalaibar, Jingjing Qian, Jun Chen, Wuxian Shi, Yiqun Ge, W. Tong\",\"doi\":\"10.1109/CISS53076.2022.9751178\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider a distributed lossy compression network with $L$ encoders and a decoder. Each encoder observes a source and sends a compressed version to the decoder. The decoder produces a joint reconstruction of target signals with the mean squared error distortion below a given threshold. It is assumed that the observed sources can be expressed as the sum of target signals and corruptive noises which are independently generated from two symmetric multivariate Gaussian distributions. We are interested in the minimum compression rate of this network versus the distortion threshold, which is known as the rate-distortion function. We derive a lower bound on the rate-distortion function by explicitly solving a max-min problem. Our lower bound matches the well-known Berger-Tung upper bound for some values of the distortion threshold. The asymptotic expressions of the upper and lower bounds are derived in the large $L$ limit and are shown to coincide under specific constraints.\",\"PeriodicalId\":305918,\"journal\":{\"name\":\"2022 56th Annual Conference on Information Sciences and Systems (CISS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 56th Annual Conference on Information Sciences and Systems (CISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS53076.2022.9751178\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 56th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS53076.2022.9751178","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们考虑了一个具有$L$编码器和一个解码器的分布式有损压缩网络。每个编码器观察一个源并将压缩版本发送给解码器。解码器产生目标信号的联合重构,其均方误差失真低于给定阈值。假设观测到的源可以表示为目标信号和干扰噪声的和,它们分别由两个对称的多元高斯分布独立产生。我们感兴趣的是这个网络的最小压缩率相对于失真阈值,这被称为率失真函数。通过显式地求解一个极大极小问题,推导出了率失真函数的下界。对于某些失真阈值,我们的下界与众所周知的Berger-Tung上界相匹配。在大$L$极限下导出了上界和下界的渐近表达式,并在特定的约束条件下证明了它们重合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On Distributed Lossy Coding of Symmetrically Correlated Gaussian Sources
In this paper, we consider a distributed lossy compression network with $L$ encoders and a decoder. Each encoder observes a source and sends a compressed version to the decoder. The decoder produces a joint reconstruction of target signals with the mean squared error distortion below a given threshold. It is assumed that the observed sources can be expressed as the sum of target signals and corruptive noises which are independently generated from two symmetric multivariate Gaussian distributions. We are interested in the minimum compression rate of this network versus the distortion threshold, which is known as the rate-distortion function. We derive a lower bound on the rate-distortion function by explicitly solving a max-min problem. Our lower bound matches the well-known Berger-Tung upper bound for some values of the distortion threshold. The asymptotic expressions of the upper and lower bounds are derived in the large $L$ limit and are shown to coincide under specific constraints.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信