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

Conditional and Relevant Common Information

INFORMATION AND INFERENCE-A JOURNAL OF THE IMA 2022年第2期11卷 679-737页

作者： Graczyk, Robert Lapidoth, Amos Wigger, Michele Swiss Fed Inst Technol Zurich Switzerland IP Paris Telecom Paris LTCI Paris France

Two variations on Wyner's common information are proposed: conditional common information and relevant common information. These are shown to have operational meanings analogous to those of Wyner's common information in appropriately defined distributed problems of compression, simulation and channel synthesis. For relevant common information, an additional operational meaning is identified: on a multiple-access channel with private and common messages, it is the minimal common-message rate that enables communication at the maximum sum-rate under a weak coordination constraint on the inputs and output. En route, the weak-coordination problem over a Gray-Wyner network is solved under the no-excess-rate constraint.

关键词： Common Information Channel Synthesis distributed source coding Coordination Simulation

来源：评论

学校读者我要写书评

暂无评论

Analysis on crossover probability estimation using LDPC syndrome

引用

Science China(Information Sciences) 2011年第9期54卷 1895-1904页

作者： FANG Yong College of Information Engineering,Northwest A&F University,Yangling 712100,China 1. College of Information Engineering Northwest A&F University Yangling 712100 China

Correlation estimation is a critical issue that impacts the application of Slepian-Wolf coding (SWC) in *** online correlation estimation is a type of newly-appearing approaches,in which the decoder estimates the virtual correlation channel between two correlated sources using both side information and the compressed SWC bitstream of the *** the compressed SWC bitstream usually contains partial information of the source,the emergence of dynamic online correlation estimation is helpful to solving the problem of correlation estimation in the SWC and further makes the SWC ***,the SWC is usually implemented by LDPC *** this case,the SWC bitstream is just the LDPC syndrome of the *** has been revealed that there are residual redundancies in LDPC syndromes,which can be used to estimate the crossover probability between two correlated binary ***,this algorithm has not been well justified *** paper makes use of the central limit theorem (CLT) to establish a mathematic model for analyzing the performance of this ***,for irregular LDPC codes,the optimization of weight vectors is discussed in *** experimental results are provided to validate the analysis.

关键词： distributed source coding Slepian-Wolf coding LDPC syndrome correlation estimation

来源：评论

学校读者我要写书评

暂无评论

Selfish distributed Compression Over Networks: Correlation Induces Anarchy

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2012年第5期58卷 3182-3197页

作者： Ramamoorthy, Aditya Roychowdhury, Vwani P. Singh, Sudhir K. Iowa State Univ Dept Elect & Comp Engn Ames IA 50011 USA Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA Haileo Inc Santa Clara CA 95054 USA

We consider the min-cost multicast problem (under network coding) with multiple correlated sources where each terminal wants to losslessly reconstruct all the sources. We study the inefficiency brought forth by the selfish behavior of the terminals in this scenario by modeling it as a noncooperative game among the terminals. The degradation in performance due to the lack of regulation is measured by the Price of Anarchy (POA), which is defined as the ratio between the cost of the worst possible Wardrop equilibrium and the socially optimum cost. Our main result is that in contrast with the case of independent sources, the presence of source correlations can significantly increase the price of anarchy. Toward establishing this result, we first characterize the socially optimal flow and rate allocation in terms of four intuitive conditions. Next, we show that the Wardrop equilibrium is a socially optimal solution for a different set of (related) cost functions. Using this, we construct explicit examples that demonstrate that the POA > 1 and determine near-tight upper bounds on the POA as well. The main techniques in our analysis are Lagrangian duality theory and the usage of the supermodularity of conditional entropy.

关键词： distributed source coding game theory multicast network coding selfish behavior

来源：评论

学校读者我要写书评

暂无评论

On the Minimization of Communication Energy Consumption of Correlated Sensor Nodes

引用

WIRELESS PERSONAL COMMUNICATIONS 2009年第1期50卷 57-67页

作者： Yin, Liuguo Wang, Changmian Oien, Geir E. Norwegian Univ Sci & Technol Dept Elect & Telecommun N-7491 Trondheim Norway

Minimizing the sensor-node energy consumption is an important consideration when designing wireless sensor networks. In this paper, we focus on the energy consumption issues related to communication of data from correlated sensor nodes. An optimization algorithm is proposed for minimizing the overall energy consumption of the hardware and the physical link. We perform a detailed trade-off analysis of the circuit energy consumption, the transmission energy consumption, the transmission time, the modulation symbol size, and the channel coding rate, over a wide range of transmission distances and correlation values. Thus, a new optimized communication schedule with much lower energy consumption than our benchmark scheme of optimized uncorrelated uncoded transmission is obtained. Compared to this scheme, the total energy consumption may be reduced by more than 83.5% for a correlation value of 0.6 and a transmission distance of 100 m when using the results from the proposed optimization. This is significant with respect to increasing the lifetime of a wireless sensor network.

关键词： Dense wireless sensor network Energy consumption optimization distributed source coding Correlated sensor nodes Circuit energy consumption Transmission energy consumption

来源：评论

学校读者我要写书评

暂无评论

Towards Optimum Cost in Multi-Hop Networks with Arbitrary Network Demands

Towards Optimum Cost in Multi-Hop Networks with Arbitrary Ne...

引用

2010 IEEE International Symposium on Information Theory

作者： Viswanatha, Kumar Akyol, Emrah Rose, Kenneth Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

ISBN: (纸本)9781424469604

This paper considers the problem of minimizing the communication cost for a general multi-hop network with correlated sources and multiple sinks. For the single sink scenario, it has been shown that this problem can be decoupled, without loss of optimality, into two separate subproblems of distributed source coding and finding the optimal routing (transmission structure). It has further been established that, under certain assumptions, such decoupling also applies in the general case of multiple sinks and arbitrary network demands. We show that these assumptions are significantly restrictive, and further provide examples to substantiate the loss, including settings where removing the assumptions yields unbounded performance gains. Finally, an approach to solving the unconstrained problem, where routing and coding cannot be decoupled, is derived based on Han and Kobayashi's achievability region for multi-terminal coding.

关键词： Multi-hop sensor networks distributed source coding multi-terminal information theory

来源：评论

学校读者我要写书评

暂无评论

IMPROVING THE VISUAL PERFORMANCE OF S/DISCUS

IMPROVING THE VISUAL PERFORMANCE OF S/DISCUS

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Dominguez-Conde, Gabriel Kundur, Deepa Univ Vigo Signal Theory & Commun Dept Vigo 36310 Spain Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA

ISBN: (纸本)9781612843490

Wireless multimedia sensor networks (WMSNs) emerge as a solution in wireless unattended video surveillance scenarios. The G-E-M methodology was recently introduced by Czarlinska et al. to address the problem providing protection to visual wireless surveillance systems in the presence of another hostile sensing system. This work builds upon the G-E-M framework by introducing pre- and post-processing stages that reduce decoding errors and visual noise as well as allowing the effective control of bitrate.

关键词： Keyless security distributed source coding low-complexity video coding wireless multimedia sensor networks Slepian-Wolf coding

来源：评论

学校读者我要写书评

暂无评论

New results of efficient Slepian-Wolf compression using turbo codes

New results of efficient Slepian-Wolf compression using turb...

引用

6th IASTED International Conference on Signal and Image Processing

作者： Li, J Lehigh Univ Dept Elect & Comp Engn Bethlehem PA 18015 USA

ISBN: (纸本)0889864349

We introduce a new innovation for exploiting the algebraic binning scheme with turbo codes in distributed source coding (DSC). A simple and optimal turbo-binning scheme based on syndrome former (SF) and inverse syndrome former (ISF) was proposed in [1], but the SF/ISF construction therein works for non-punctured codes only. Since punctured turbo codes are an important class of codes, this work extends it to the punctured case. The key is to represent the punctured code in an equivalent non-punctured form and to construct the SF and ISF accordingly. We show that with punctured codes, the turbo-binning scheme is still simple, efficient and optimal. Further, the extension not only makes a large class of powerful turbo codes available to DSC, but also opens the possibility to explore rate adaptivity in turbo codes.

关键词： distributed source coding distributed compression code binning turbo codes punctured codes

来源：评论

学校读者我要写书评

暂无评论

Multi-Resolution Based Hybrid Spatiotemporal Compression of Encrypted Videos

Multi-Resolution Based Hybrid Spatiotemporal Compression of ...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Yao, Qiuming Zeng, Wenjun Liu, Wei Univ Missouri Dept Comp Sci Columbia MO 65211 USA

ISBN: (纸本)9781424423538

Compression of encrypted data can be viewed as a special case of distributed source coding and can be achieved by applying Slepian-Wolf coding. However, how to compress the encrypted video efficiently remains a challenging problem especially for those videos with irregular high motion. This paper proposes a novel multi-resolution based approach which makes it possible not only to effectively derive the temporal side information from previous frames, but also to generate the spatial side information by having partial access to the current frame. The spatial and temporal side information can then be integrated adaptively to facilitate the compression. Simulation results show that the proposed scheme significantly outperforms other schemes, especially for those video clips with irregular high motion.

关键词： Compression of encrypted data multi-resolution hybrid spatiotemporal method distributed source coding Context Adaptive Interpolator

来源：评论

学校读者我要写书评

暂无评论

distributed LOSSLESS coding OF HYPERSPECTRAL IMAGES

DISTRIBUTED LOSSLESS CODING OF HYPERSPECTRAL IMAGES

引用

IEEE International Conference on Image Processing

作者： Zhang, Wei Liu, Qiwei Li, Houqiang Univ Sci & Technol China Hefei 230026 Peoples R China

ISBN: (纸本)9781424479948

In this paper we propose a novel distributed lossless compression scheme for hyperspectral images. All the images/bands are encoded independently, and the spectral correlation is exploited using distributed coding technologies in order to achieve low encoding complexity. At the encoder, sub-sampled images are successively encoded and transmitted. At the decoder, side information is generated with the knowledge of decoded sub-sampled images and other previously decoded bands. Reference bands are adaptively selected, and sliding window prediction or k nearest neighbor prediction is performed to capture the spatially varying spectral characteristics. Experimental results on AVRIS data demonstrate that the proposed scheme achieves competitive compression performance with respect to other state-of-the-art 3D codecs and with even lower encoding complexity than 2D codecs.

关键词： Hyperspectral images distributed source coding lossless compression low-complexity encoding inter-band prediction

来源：评论

学校读者我要写书评

暂无评论

Rate Region of the Vector Gaussian CEO Problem With the Trace Distortion Constraint

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第4期62卷 1823-1835页

作者： Xu, Yinfei Wang, Qiao Southeast Univ Sch Informat Sci & Engn Nanjing 210096 Jiangsu Peoples R China

We establish a new extremal inequality, which is further leveraged to give a complete characterization of the rate region of the vector Gaussian CEO problem with the trace distortion constraint. The proof of this extremal inequality hinges on a careful analysis of the Karush-Kuhn-Tucker necessary conditions for the non-convex optimization problem associated with the Berger-Tung scheme, which enables us to integrate the perturbation argument by Wang and Chen and the distortion projection method by Rahman and Wagner.

关键词： CEO problem distributed source coding extremal inequality indirect source lossy source coding mean square error rate region vector Gaussian source

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：