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

Collaborative Information Bottleneck

IEEE TRANSACTIONS ON INFORMATION THEORY 2019年第2期65卷 787-815页

作者： Vera, Matias Vega, Leonardo Rey Piantanida, Pablo Univ Buenos Aires Fac Ingn C1063ACV Buenos Aires DF Argentina CSC CONICET C1425FQD Buenos Aires DF Argentina Univ Paris Sud Cent Supelec French Natl Ctr Sci Res F-91190 Gif Sur Yvette France Univ Montreal Montreal Inst Learning Algorithms Montreal PQ H3T 1N8 Canada

This paper investigates a multi-terminal source coding problem under a logarithmic loss fidelity which does not necessarily lead to an additive distortion measure. The problem is motivated by an extension of the information bottleneck method to a multi-source scenario where several encoders have to build cooperatively rate-limited descriptions of their sources in order to maximize information with respect to other unobserved (hidden) sources. More precisely, we study fundamental information-theoretic limits of the so-called: 1) two-way collaborative information bottleneck (TW-CIB) and 2) the collaborative distributed information bottleneck (CDIB) problems. The TW-CIB problem consists of two distant encoders that separately observe marginal (dependent) components X-1 and X-2 and can cooperate through multiple exchanges of limited information with the aim of extracting information about hidden variables (Y-1, Y-2), which can be arbitrarily dependent on (X-1, X-2). On the other hand, in CDIB, there are two cooperating encoders which separately observe X-1 and X-2 and a third node which can listen to the exchanges between the two encoders in order to obtain information about a hidden variable Y. The relevance (figure-of-merit) is measured in terms of a normalized (per-sample) multi-letter mutual information metric (log-loss fidelity), and an interesting tradeoff arises by constraining the complexity of descriptions, measured in terms of the rates needed for the exchanges between the encoders and decoders involved. Inner and outer bounds to the complexity-relevance region of these problems are derived from which optimality is characterized for several cases of interest. Our resulting theoretical complexity-relevance regions are finally evaluated for binary symmetric and Gaussian statistical models, showing theoretical tradeoffs between the complexity-constrained descriptions and their relevance with respect to the hidden variables.

关键词： Multi-terminal source coding logarithmic loss distributed source coding noisy rate-distortion side information interactive lossy source coding information bottleneck Shannon theory

来源：评论

学校读者我要写书评

暂无评论

Low-complexity distributed multi-view video coding for wireless video sensor networks based on compressive sensing theory

引用

NEUROCOMPUTING 2013年 120卷 415-421页

作者： Jiang, Dan Guo, Jichang Wu, Xiaojia Tianjin Univ Sch Elect Informat Engn Tianjin 300072 Peoples R China Taiyuan Univ Sci & Technol Sch Elect Informat Engn Taiyuan 030024 Peoples R China

Sparsity is an attractive feature of images. Images can be efficiently represented using a few significant coefficients and sparse reconstructed from a small set of random linear measurements by utilizing the sparse feature in compressive sensing theory. Storage and transmission of multi-view video sequences involve large volumes of redundant data. These data can be efficiently compressed with techniques which encode the signals independently and decode them jointly. By integrating the respective characteristics of compressive sensing and distributed source coding, we propose a novel multi-view video coding approach for use in resource limited devices such as wireless video sensor networks. The proposed approach can explore the sparsity of video images, allow for low complexity encoder and the exploitation of inter-camera correlation without communications among cameras. Simulation results show the proposed framework outperforms the baseline compressive sensing-based scheme of intra frame coding by 3-5 dB. Compared with conventional H.264 or DVC scheme, the proposed frameworks simple while the quality of reconstructed image and compressibility are kept. (c) 2013 Elsevier B.V. All rights reserved.

关键词： Sparsity Sparse reconstruction Multi-view video Compressive sensing Wireless video sensor networks distributed source coding

来源：评论

学校读者我要写书评

暂无评论

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 Rate Loss of Multiple sources Codes in the Wyner-Ziv Setting

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第3期57卷 1457-1465页

作者： Lu, Jian Wang, Qiao SE Univ Dept Radio Engn Sch Informat Sci & Engn Nanjing 210096 Peoples R China

In this paper, we consider the rate loss and achievable region of multiple sources codes (also named multiterminal source codes) in the Wyner-Ziv setting (WZ-MSC), in which two stationary memoryless sources (X, Y) are compressed separately from each other at respective rates and R-1 and R-2, and the joint decoder, having access to the side information S which is correlated with sources (X, Y), reconstructs X and Y with distortion and D-1 and D-2, respectively. We define the rate loss L-1 = R-1 - R-X vertical bar Y,R- S (D-1), L-2 = R-2 - R-Y vertical bar X,R- S (D-2) and L-0 = R-1 + R-2 - R-X,R-Y vertical bar S(D-1, D-2). For general real-valued stationary memoryless sources and mean squared error distortion measure, we show that the rate loss can be bounded by L-i <= K-i + 1,i = 1, 2, and L-0 <= 1, where K-1 = R-X,R-Y vertical bar(S)(D-1, D-2) - R-Y vertical bar S(D-1) - R-X vertical bar Y,R-S(D-1) and K-2 = R-X,R-Y vertical bar(S)(D-1, D-2) - R-X vertical bar S(D-1) - R-Y vertical bar X,R-S(D-2). When the sources and side information have a jointly Gaussian distribution, we give upper bounds of K-1 and K-2 by a function of conditional correlation coefficient rho(XY vertical bar S). For a special case when there is no side information, our result tightens Feng's rate loss bounds. Using our upper bounds of the rate loss, we give good approximations of the achievable region.

关键词： distributed source coding multiple sources multiterminal source code rate loss rate-distortion function side information Wyner-Ziv problem

来源：评论

学校读者我要写书评

暂无评论

High-rate quantization and transform coding with side information at the decoder

引用

SIGNAL PROCESSING 2006年第11期86卷 3160-3179页

作者： Rebollo-Monedero, David Rane, Shantanu Aaron, Anne Girod, Bernd Stanford Univ Dept Elect Engn Informat Syst Lab Stanford CA 94305 USA

We extend high-rate quantization theory to Wyner-Ziv coding, i.e., lossy source coding with side information at the decoder. Ideal Slepian-Wolf coders are assumed, thus rates are conditional entropies of quantization indices given the side information. This theory is applied to the analysis of orthonormal block transforms for Wyner-Ziv coding. A formula for the optimal rate allocation and an approximation to the optimal transform are derived. The case of noisy high-rate quantization and transform coding is included in our study, in which a noisy observation of source data is available at the encoder, but we are interested in estimating the unseen data at the decoder, with the help of side information. We implement a transform-domain Wyner-Ziv video coder that encodes frames independently but decodes them conditionally. Experimental results show that using the discrete cosine transform results in a rate-distortion improvement with respect to the pixel-domain coder. Transform coders of noisy images for different communication constraints are compared. Experimental results show that the noisy Wyner-Ziv transform coder achieves a performance close to the case in which the side information is also available at the encoder. (c) 2006 Elsevier B.V. All rights reserved.

关键词： high-rate quantization transform coding side information Wyner-Ziv coding distributed source coding noisy source coding

来源：评论

学校读者我要写书评

暂无评论

Successive coding in multiuser information theory

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2007年第6期53卷 2246-2254页

作者： Zhang, Xin Chen, Jun Wicker, Stephen B. Berger, Toby Cornell Univ Sch Elect & Comp Engn Ithaca NY 14853 USA

In this correspondence, we show that solutions to the multiple description coding problem and the broadcast channel coding problem share a common encoding procedure: successive source encoding. We use this connection as the basis for establishing connections between the achievable multiple description rate region and Marton's region for broadcast channels. Specifically, we show that Marton's encoding scheme can be viewed as a multiple description coding procedure. We also explore the dual problem, namely, the relationship between successive channel decoding in multiple access communication and distributed source coding. By illuminating these connections to multiple description, we hope to motivate a solution to what remains a mostly unsolved problem.

关键词： broadcast channel dirty paper coding distributed source coding Gram-Schmidt orthogonalization multiple access multiple descriptions successive coding

来源：评论

学校读者我要写书评

暂无评论

Hamming Distance Spectrum of DAC Codes for Equiprobable Binary sources

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第3期64卷 1232-1245页

作者： Fang, Yong Stankovic, Vladimir Cheng, Samuel Yang, En-hui Northwest A&F Univ Coll Informat Engn Yangling 712100 Peoples R China Univ Strathclyde Dept Elect & Elect Engn Glasgow G1 1XW Lanark Scotland Univ Oklahoma Sch Elect & Comp Engn Tulsa OK 74135 USA Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

distributed arithmetic coding (DAC) is an effective technique for implementing Slepian-Wolf coding (SWC). It has been shown that a DAC code partitions source space into unequal-size codebooks, so that the overall performance of DAC codes depends on the cardinality and structure of these codebooks. The problem of DAC codebook cardinality has been solved by the so-called codebook cardinality spectrum (CCS). This paper extends the previous work on CCS by studying the problem of DAC codebook structure. We define Hamming distance spectrum (HDS) to describe DAC codebook structure and propose a mathematical method to calculate the HDS of DAC codes. The theoretical analyses are verified by experimental results.

关键词： distributed source coding Slepian-Wolf coding distributed arithmetic coding Hamming distance spectrum codebook cardinality spectrum

来源：评论

学校读者我要写书评

暂无评论

On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2013年第3期59卷 1329-1345页

作者： Shayevitz, Ofer Wigger, Michele Univ Calif San Diego Informat Theory & Applicat Ctr San Diego CA 92093 USA Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

A coding scheme for the discrete memoryless broadcast channel with {noiseless, noisy, generalized} feedback is proposed, and the associated achievable region derived. The scheme is based on a block-Markov strategy combining the Marton scheme and a lossy version of the Gray-Wyner scheme with side information. In each block, the transmitter sends fresh data and update information that allows the receivers to improve the channel outputs observed in the previous block. For a generalization of Dueck's broadcast channel, our scheme achieves the noiseless-feedback capacity, which is strictly larger than the no-feedback capacity. For a generalization of Blackwell's channel and when the feedback is noiseless, our new scheme achieves rate points that are outside the no-feedback capacity region. It follows by a simple continuity argument that for both these channels and when the feedback noise is sufficiently low, our scheme improves on the no-feedback capacity even when the feedback is noisy.

关键词： Broadcast channel channel capacity distributed source coding feedback source coding with side-information

来源：评论

学校读者我要写书评

暂无评论

Improved Low-Density Parity Check Accumulate (LDPCA) Codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第9期61卷 3590-3599页

作者： Yu, Chao Sharma, Gaurav Univ Rochester Dept Elect & Comp Engn Rochester NY 14627 USA Univ Rochester Dept Biostat & Computat Biol Rochester NY 14627 USA Univ Rochester Dept Oncol Rochester NY 14627 USA

We present improved constructions for Low-Density Parity-Check Accumulate (LDPCA) codes, which are rate-adaptive codes commonly used for distributed source coding (DSC) applications. Our proposed constructions mirror the traditional LDPCA approach;higher rate codes are obtained by splitting the check nodes in the decoding graph of lower rate codes, beginning with a lowest rate mother code. In a departure from the uniform splitting strategy adopted by prior LDPCA codes, however, the proposed constructions introduce non-uniform splitting of the check nodes at higher rates. Codes are designed by a global minimization of the average rate gap between the code operating rates and the corresponding theoretical lower bounds evaluated by density-evolution. In the process of formulating the design framework, the paper also contributes a formal definition of LDPCA codes. Performance improvements provided by the proposed non-uniform splitting strategy over the conventional uniform splitting approach used in prior work are substantiated via density evolution based analysis and DSC codec simulations. Optimized designs for our proposed constructions yield codes with a lower average rate gap than conventional designs and alleviate the trade-off between the performance at different rates inherent in conventional designs. A software implementation is provided for the codec developed.

关键词： LDPCA codes LDPC codes distributed source coding code design

来源：评论

学校读者我要写书评

暂无评论

Symmetric distributed coding of stereo omnidirectional images

引用

SIGNAL PROCESSING-IMAGE COMMUNICATION 2008年第5期23卷 379-390页

作者： Thirumalai, Vijayaraghavan Tosic, Ivana Frossard, Pascal Ecole Polytech Fed Lausanne Signal Proc Lab LTS4 CH-1015 Lausanne Switzerland

This paper presents a distributed coding scheme for the representation of 3D scenes captured by a pair of omnidirectional cameras with equivalent computational resources;and transmission capabilities. The images are captured at different viewpoints and are encoded independently. A joint decoder exploits the correlation between images for improved decoding quality. The distributed coding is built on the multi-resolution representation of spherical images, whose information is split into two partitions. The encoder then transmits one partition after entropy coding, as well as the syndrome bits resulting from the channel encoding of the other partition. The joint decoder exploits the intra-view correlation by predicting one partition from the other partition. At the same time, it exploits the inter-view correlation using block-based disparity estimation between images from different cameras. Experiments demonstrate that the distributed coding solution performs better than a scheme where images are handled independently. Furthermore, the coding rate stays balanced between the different cameras, which permits to avoid hierarchical relations between vision sensors in camera networks. (C) 2008 Elsevier B.V. All rights reserved.

关键词： distributed source coding omnidirectional images LDPC codes camera networks stereo imaging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：