检索结果-内蒙古大学图书馆

An upper bound on the sum-rate distortion function and its corresponding rate allocation schemes for the CEO problem

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2004年第6期22卷 977-987页

作者： Chen, J Zhang, X Berger, T Wicker, SB Cornell Univ Ithaca NY 14853 USA

We consider a distributed sensor network in which several observations are communicated to the fusion center using limited transmission rate. The observation must be separately encoded so that the target can be estimated with minimum average distortion. We address the problem from an information theoretic perspective and establish the inner and outer bound of the admissible rate-distortion region. We derive an upper bound on the sum-rate distortion function and its corresponding rate allocation schemes by exploiting the contra-polymatroid structure of the achievable rate region. The quadratic Gaussian case is analyzed in detail and the optimal rate allocation schemes in the achievable rate region are characterized. We show that our upper bound on the sum-rate distortion function is tight for the quadratic Gaussian CEO problem in the case of same signal-to-noise ratios at the sensors.

关键词： CEO problem contra-polymatroid decentralized estimation Gaussian source multiterminal source coding mean-squared error rate allocation water-filling

来源：评论

学校读者我要写书评

暂无评论

The CEO Problem With Secrecy Constraints

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2015年第6期10卷 1234-1249页

作者： Naghibi, Farshad Salimi, Somayeh Skoglund, Mikael KTH Royal Inst Technol Sch Elect Engn ACCESS Linnaeus Ctr S-10044 Stockholm Sweden

We study a lossy source coding problem with secrecy constraints in which a remote information source should be transmitted to a single destination via multiple agents in the presence of a passive eavesdropper. The agents observe noisy versions of the source and independently encode and transmit their observations to the destination via noiseless rate-limited links. The destination should estimate the remote source based on the information received from the agents within a certain mean distortion threshold. The eavesdropper, with access to side information correlated to the source, is able to listen in on one of the links from the agents to the destination in order to obtain as much information as possible about the source. This problem can be viewed as the so-called CEO problem with additional secrecy constraints. We establish inner and outer bounds on the rate-distortion-equivocation region of this problem. We also obtain the region in special cases where the bounds are tight. Furthermore, we study the quadratic Gaussian case and provide the optimal rate-distortion-equivocation region when the eavesdropper has no side information and an achievable region for a more general setup with side information at the eavesdropper.

关键词： CEO problem multiterminal source coding secrecy constraints eavesdropping equivocation

来源：评论

学校读者我要写书评

暂无评论

multiterminal source-channel communication over an orthogonal multiple-access channel

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2007年第9期53卷 3255-3264页

作者： Xiao, Jin-Jun Luo, Zhi-Quan Univ Minnesota Dept Elect & Comp Engn Minneapolis MN 55455 USA

We consider the problem of multiterminal source-channel communication where a number of distributed and possibly correlated sources are transmitted through an orthogonal multiple access channel to a common destination. We provide a characterization of the optimal tradeoff between the transmission cost F and the distortion vector D as measured against individual sources. Our approach consists of two steps: 1) a multiple-letter characterization of the rate-distortion region of the multiterminal source coding and 2) a source-channel separation theorem ensuring that all achievable pairs of (Gamma, D) can be obtained by combining the rate-distortion region and the orthogonal multiple access channel capacity region. As a corollary, we determine the optimal power and distortion tradeoff in a quadratic Gaussian sensor network under orthogonal multiple access, and show that separate source and channel coding strictly outperforms the uncoded (amplify-forward) transmission, and is in fact optimal in this case. This result is in sharp contrast to the case of nonorthogonal multiple access for which separate source and channel coding is not only suboptimal but also strictly inferior to uncoded transmission

关键词： Gaussian sensor networks multiterminal source coding rate-distortion region source-channel separation theorem uncoded transmission

来源：评论

学校读者我要写书评

暂无评论

On code design for the Slepian-Wolf problem and lossless multiterminal networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第4期52卷 1495-1507页

作者： Stankovic, V Liveris, AD Xiong, ZX Georghiades, CN Univ Lancaster Dept Commun Syst Lancaster LA1 4WA England Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA

A Slepian-Wolf coding scheme for compressing two uniform memoryless binary sources using a single channel code that can achieve arbitrary rate allocation among encoders was outlined in the work of Pradhan and Ramchandran. Inspired by this work, we address the problem of practical code design for general multiterminal lossless networks where multiple memoryless correlated binary sources are separately compressed and sent;each decoder receives a set of compressed sources and attempts to jointly reconstruct them. First, we propose a near-lossless practical code design for the Slepian-Wolf system with multiple sources. For two uniform sources, if the code approaches the capacity of the channel that models the correlation between the sources, then the system will approach the theoretical limit. Thus, the great advantage of this design method is its possibility to approach the theoretical limits with a single channel code for any rate allocation among the encoders. Based on Slepian-Wolf code constructions, we continue with providing practical designs for the general lossless multiterminal network which consists of an arbitrary number of encoders and decoders. Using irregular repeat-accumulate and turbo codes in our designs, we obtain the best results reported so far and almost reach the theoretical bounds.

关键词： data compression distributed source coding Slepian-Wolf coding multiterminal source coding

来源：评论

学校读者我要写书评

暂无评论

On the Generalized Gaussian CEO Problem

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2012年第6期58卷 3350-3372页

作者： Yang, Yang Xiong, Zixiang Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA

This paper considers a distributed source coding (DSC) problem where L encoders observe noisy linear combinations of K correlated remote Gaussian sources, and separately transmit the compressed observations to the decoder to reconstruct the remote sources subject to a sum-distortion constraint. This DSC problem is referred to as the generalized Gaussian CEO problem since it can be viewed as a generalization of the quadratic Gaussian CEO problem where the number of remote source K = 1. First, we provide a new outer region obtained using the entropy power inequality and an equivalent argument (in the sense of having the same rate-distortion region and Berger-Tung inner region) among a certain class of generalized Gaussian CEO problems. We then give two sufficient conditions for our new outer region to match the inner region achieved by Berger-Tung schemes, where the second matching condition implies that in the low-distortion regime, the Berger-Tung inner rate region is always tight, while in the high-distortion regime, the same region is tight if a certain condition holds. The sum-rate part of the outer region is also studied and shown to meet the Berger-Tung sum-rate upper bound under a certain condition, which is obtained using the Karush-Kuhn-Tucker conditions of the underlying convex semidefinite optimization problem, and is in general weaker than the aforesaid two for rate region tightness.

关键词： Distributed source coding (DSC) Gaussian CEO problem multiterminal source coding rate region remote sources sum rate

来源：评论

学校读者我要写书评

暂无评论

Distributed Binary Detection With Lossy Data Compression

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2017年第8期63卷 5207-5227页

作者： Katz, Gil Piantanida, Pablo Debbah, Merouane Cent Supelec Large Networks & Syst Grp F-91192 Gif Sur Yvette France Univ Paris Sud Cent Supelec CNRS Lab Signaux & Syst F-91192 Gif Sur Yvette France

Consider the problem where a statistician in a two-node system receives rate-limited information from a transmitter about marginal observations of a memoryless process generated from two possible distributions. Using its own observations, this receiver is required to first identify the legitimacy of its sender by declaring the joint distribution of the process, and then depending on such authentication, it generates adequate reconstruction of the observations, satisfying an average per-letter distortion. The performance of this setup is investigated through the corresponding rate-error-distortion region, describing the tradeoff between: the communication rate, the error exponent induced by the detection, and the distortion incurred by the source reconstruction. In the special case of testing against independence, where the alternative hypothesis implies that the sources are independent, the optimal rate-error-distortion region is characterized. An application example to binary symmetric sources is given subsequently and the explicit expression for the rate-error-distortion region is provided as well. The case of "general hypotheses" is also investigated. A new achievable rate-error-distortion region is derived based on the use of non-asymptotic binning, improving the quality of communicated descriptions. Further improvement of performance in the general case is shown to be possible when the requirement of source reconstruction is relaxed, which stands in contrast to the case of general hypotheses.

关键词： Data compression error statistics signal detection asymptotic performance central detector discrete spatially dependent observations distributed detection error exponent multiterminal detection multiterminal source coding side information lossy source coding type-I error rate type-II error rate

来源：评论

学校读者我要写书评

暂无评论

Low-density parity-check matrices for coding of correlated sources

Low-density parity-check matrices for coding of correlated s...

引用

IEEE International Symposium on Information Theory

作者： Muramatsu, J Uyematsu, T Wadayama, T NTT Corp NTT Commun Sci Labs Kyoto 6190237 Japan Tokyo Inst Technol Meguro Ku Tokyo 1528552 Japan Nagoya Inst Technol Showa Ku Nagoya Aichi 4668555 Japan

ISBN: (纸本)0780377281

Linear codes for a coding problem of correlated sources are considered. It is proved that we can construct codes by using low-density parity-check (LDPC) matrices with maximum-likelihood (or typical set) decoding. As applications of the above coding problem, a construction of codes is presented for multiple-access channel with correlated additive noises and a coding theorem of parity-check codes for general channels is proved.

关键词： linear codes low-density parity-check (LDPC) matrix multiterminal source coding multiterminal channel coding multiple-access channel with correlated additive noise Slepian-Wolf source coding

来源：评论

学校读者我要写书评

暂无评论

Universal coding for Lossy Complementary Delivery Problem

Universal Coding for Lossy Complementary Delivery Problem

引用

IEEE International Symposium on Information Theory

作者： Kuzuoka, Shigeaki Kimura, Akisato Uyematsu, Tomohiko Wakayama Univ Dept Comp & Commun Sci 930 Sakaedani Wakayama 6408510 Japan NTT Corp NTT Commun Sci Lab Kanagawa 2430198 Japan Tokyo Inst Technol Dept Commun & Integrated Syst Tokyo 1528550 Japan

ISBN: (纸本)9781424422562

This paper deals with a universal lossy coding problem for a certain kind of multiterminal source coding network called a complementary delivery system. A universal coding scheme based on Wyner-Ziv codes is proposed. While the proposed scheme cannot attain the optimal rate-distortion trade-off in general, the rate-loss is upper bounded by a universal constant under some mild conditions. Moreover, the proposed scheme allows us to apply (non-universal) Wyner-Ziv codes to construct a universal lossy complementary delivery code.

关键词： complementary delivery multiterminal source coding network coding universal coding Wyner-Ziv coding

来源：评论

学校读者我要写书评

暂无评论

Distributed Keyless Security for Correlated Data with Applications in Visual Sensor Networks

Distributed Keyless Security for Correlated Data with Applic...

引用

9th ACM Multimedia and Security Workshop

作者： Luh, William Kundur, Deepa Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA

ISBN: (纸本)9781595938572

This paper examines the problem in which several nodes sharing highly correlated data, such as visual data, wish to compress and encrypt their data to provide confidentiality. The nodes however perform these tasks separately, without communicating with one another and without the use of cryptographic keys. The base station (BS) receiving all such encrypted data, can reconstruct each of the nodes' data, whereas a passive eavesdropper who is only allowed a subset of the encrypted data gleans as little information as possible about the nodes' data. We build on previous results with the goal of increasing secrecy (measured by Shannon equivocation) by: (1) relaxing the BS's perfect reconstruction criterion thus permitting non-zero distortion reconstruction;(2) permitting communication (feedback) from the BS to the nodes. We show that permitting non-zero distortion reconstruction does increase secrecy, however unconditional secrecy is still not achievable unless the distortion is maximal. We also prove that feedback from the BS usually (under most practical scenarios) does not improve secrecy, unless the BS has certain knowledge concerning the eavesdropper. Finally this paper proposes ideas for applying the results to images by analyzing the ideal image model to demonstrate the practical difficulties in achieving provable security for images.

关键词： Distributed secrecy Shannon equivocation multiterminal source coding

来源：评论

学校读者我要写书评

暂无评论

Universal coding for correlated sources with complementary delivery

Universal coding for correlated sources with complementary d...

引用

29th Symposium on Information Theory and Its Applications (SITA2006)

作者： Kimura, Akisato Uyematsu, Tomohiko Kuzuoka, Shigeaki Tokyo Inst Technol Dept Commun & Integrated Syst Tokyo 1528550 Japan NTT Corp Commun Sci Labs Atsugi Kanagawa 2430198 Japan

This paper deals with a universal coding problem for a certain kind of multiterminal source coding system that we call the complementary delivery coding system. In this system, messages from two correlated sources are jointly encoded, and each decoder has access to one of the two messages to enable it to reproduce the other message. Both fixed-to-fixed length and fixed-to-variable length lossless coding schemes are considered. Explicit constructions of universal codes and bounds of the error probabilities are clarified via type-theoretical and graph-theoretical analyses.

关键词： multiterminal source coding complementary delivery universal coding types of sequences bipartite graphs

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：