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

source coding with side information at the Decoder and Uncertain Knowledge of the Correlation

IEEE TRANSACTIONS ON COMMUNICATIONS 2014年第1期62卷 269-279页

作者： Dupraz, Elsa Roumy, Aline Kieffer, Michel Univ Paris 11 L2S CNRS SUPELEC F-91192 Gif Sur Yvette France INRIA F-35042 Rennes France Inst Univ France F-75013 Paris France

This paper considers the problem of lossless source coding with side information at the decoder, when the correlation model between the source and the side information is uncertain. Four parametrized models representing the correlation between the source and the side information are introduced. The uncertainty on the correlation appears through the lack of knowledge on the value of the parameters. For each model, we propose a practical coding scheme based on non-binary Low Density Parity Check Codes and able to deal with the parameter uncertainty. At the encoder, the choice of the coding rate results from an information theoretical analysis. Then we propose decoding algorithms that jointly estimate the source vector and the parameters. As the proposed decoder is based on the Expectation-Maximization algorithm, which is very sensitive to initialization, we also propose a method to produce first a coarse estimate of the parameters.

关键词： source coding with side information non-binary LDPC codes Expectation-Maximization algorithm

来源：评论

学校读者我要写书评

暂无评论

Achievability of the Rate-Distortion Function in Binary Uniform source coding with side information 23

Achievability of the Rate-Distortion Function in Binary Unif...

引用

23rd International Conference on Telecommunications (ICT)

作者： Sechelea, Andrei Munteanu, Adrian Pizurica, Aleksandra Deligiannis, Nikos Vrije Univ Brussel Dept Elect & Informat Brussels Belgium Univ Ghent Dept Telecommun & Informat Proc Ghent Belgium IMinds Gaston Crommenlaan 8 B102 B-9050 Ghent Belgium

ISBN: (纸本)9781509019908

In this work we consider asymmetric correlation channels and focus on the achievability of the rate-distortion function when the source is binary uniform. This lies in contrast with conventional symmetric correlation channel models employed in the literature. The rate-distortion function for binary source coding with correlated side information is expressed as a function of an auxiliary random variable with an alphabet size smaller or equal to three. Complementing our recent findings on the problem, we propose a numerical analysis of the differences between assuming binary and ternary auxiliary variables in the derivation of the rate distortion bound. We also show that, even if the proposed bound does not admit an analytical expression, it always admits a unique solution.

关键词： source coding with side information Wyner-Ziv coding rate-distortion function

来源：评论

学校读者我要写书评

暂无评论

Distributed single source coding with side information

Distributed single source coding with side information

引用

Conference on Visual Communications and Image Processing 2004

作者： Vila-Forcen, JE Koval, O Voloshynovskiy, S Univ Geneva Dept Comp Sci CH-1211 Geneva Switzerland

ISBN: (纸本)0819452114

In the paper we advocate image compression technique in the scope of distributed source coding framework. The novelty of the proposed approach is twofold: classical image compression is considered from the positions of source coding with side information and, contrarily to the existing scenarios, where side information is given explicitly, side information is created based on deterministic approximation of local image features. We consider an image in the transform domain as a realization of a source with a bounded codebook of symbols where each symbol represents a particular edge shape. The codebook is image independent and plays the role of auxiliary source. Due to the partial availability of side information at both encoder and decoder we treat our problem as a modification of Berger-Flynn-Gray problem and investigate a possible gain over the solutions when side information is either unavailable or available only at decoder. Finally. we present a practical compression algorithm for passport photo images based on our concept that demonstrates the superior performance in very low bit rate regime.

关键词： image compression wavelets distributed source coding source coding with side information image enhancement rate-distortion function Markov chain random coding argument Slepian-Wolf coding Wyner-Ziv coding Berger-Flynn-Gray coding Estimation-Quantization

来源：评论

学校读者我要写书评

暂无评论

Rate-storage regions for Extractable source coding with side information

引用

PHYSICAL COMMUNICATION 2019年 37卷 100845-000页

作者： Dupraz, Elsa Roumy, Aline Maugey, Thomas Kieffer, Michel UBL Lab STICC IMT Atlantique Rennes France INRIA Rennes Bretagne Atlantique Rennes France Univ Paris Sud Cent Supelec L2S UMR CNRS 8506 Orsay France

This papers considers the coding of a source X with J decoders, each having access to a different side information Y-(j). We define a new source coding problem called Extractable source coding with side information (ESC-SI). In this problem, the server stores one single coded description of the source, from which J descriptions can be extracted without re-encoding, depending on the side information available at the decoder. We want to minimize both the storage rate of the source on the server, and the J transmission rates from the server to the decoders. We provide the achievable storage-transmission rate regions for lossless source coding of general, non i.i.d., non-ergodic sources, and the achievable storage-transmission rate-distortion regions for lossy source coding for non i.i.d. Gaussian sources. The regions obtained for such general source models provide insightful design guidelines for practical applications. (c) 2019 Elsevier B.V. All rights reserved.

关键词： source coding with side information Lossless source coding Lossy source coding General sources Gaussian sources Storage-transmission rate region

来源：评论

学校读者我要写书评

暂无评论

Zero-Delay and Causal Single-User and Multi-User Lossy source coding with Decoder side information

引用

IEEE TRANSACTIONS ON information THEORY 2014年第11期60卷 6931-6942页

作者： Kaspi, Yonatan Merhav, Neri Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

We consider zero-delay, single-user, and multi-user source coding with an average distortion constraint and decoder side information. The zero-delay constraint translates into causal (sequential) encoder and decoder pairs as well as the use of instantaneous codes. For the single-user setting, we show that optimal performance is attained by time sharing at most two scalar encoder-decoder pairs, that use zero-error side information codes. side information look-ahead is shown to be useless in this setting. Furthermore, we show that even without delay constraints, if either the encoder or decoder are restricted a priori to be scalar, the performance loss cannot be compensated by the other component, which can be scalar as well without further loss. Finally, we show that the multi-terminal source coding problem can be solved in the zero-delay regime and the rate-distortion region is provided.

关键词： source coding with side information zero delay causal source coding rate distortion multiterminal source coding

来源：评论

学校读者我要写书评

暂无评论

Remote Vector Gaussian source coding With Decoder side information Under Mutual information and Distortion Constraints

引用

IEEE TRANSACTIONS ON information THEORY 2009年第10期55卷 4676-4680页

作者： Tian, Chao Chen, Jun AT&T Labs Res Florham Pk NJ 07932 USA McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4K1 Canada

Let X,Y,Z be zero-mean, jointly Gaussian random vectors of dimensions n(x), n(y), and n(z), respectively. Let P be the set of random variables W such that W Y (X,Z) is a Markov string. We consider the following optim... 详细信息

Let X,Y,Z be zero-mean, jointly Gaussian random vectors of dimensions n(x), n(y), and n(z), respectively. Let P be the set of random variables W such that W <-> Y <->(X,Z) is a Markov string. We consider the following optimization problem: min(W is an element of P) I(Y;W vertical bar Z) subject to one of the following two possible constraints: 1) I(X;W vertical bar Z) >= R-1, and 2) the mean squared error between and (X) over cap = E(X vertical bar W, Z) is less than d. The problem under the first kind of constraint is motivated by multiple-input multiple-output ( MIMO) relay channels with an oblivious transmitter and a relay connected to the receiver through a dedicated link, while for the second case, it is motivated by source coding with decoder side information where the sensor observation is noisy. In both cases, we show that jointly Gaussian solutions are optimal. Moreover, explicit water filling interpretations are given for both cases, which suggest transform coding approaches performed in different transform domains, and that the optimal solution for one problem is, in general, suboptimal for the other.

关键词： Gaussian vector relay channel source coding with side information transform coding

来源：评论

学校读者我要写书评

暂无评论

Duality between source coding and channel coding and its extension to the side information case

引用

IEEE TRANSACTIONS ON information THEORY 2003年第5期49卷 1181-1203页

作者： Pradhan, SS Chou, J Ramchandran, K Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

We explore the information-theoretic duality between source coding with side information at the decoder and channel coding with side information at the encoder. We begin with a mathematical characterization of the functional duality between classical source and channel coding, formulating the precise conditions under which the optimal encoder for one problem is functionally identical to the optimal decoder for the other problem. We then extend this functional duality to the case of coding with side information. By invoking this duality, we are able to generalize the result of Wyner and Ziv [1] relating to no rate loss for source coding with side information from Gaussian to more arbitrary distributions. We consider several examples corresponding to both discrete- and continuous-valued cases to illustrate our formulation. For the Gaussian cases of coding with side information, we invoke geometric arguments to provide further insights into their duality. Our geometric treatment inspires the construction and dual use of practical coset codes for a large class of emerging applications for coding with side information, such as distributed sensor networks, watermarking, and information-hiding communication systems.

关键词： capacity-cost function channel coding with side information duality rate-distortion function source coding with side information

来源：评论

学校读者我要写书评

暂无评论

coding and Common Reconstruction

引用

IEEE TRANSACTIONS ON information THEORY 2009年第11期55卷 4995-5010页

作者： Steinberg, Yossef Technion Israel Inst Technol Dept Elect Engn IL-32000 Technion Haifa Israel

This work studies problems of source and joint source-channel coding under the requirement that the encoder can produce an exact copy of the compressed source constructed by the decoder. This requirement, termed here as the common reconstruction constraint (CR), is satisfied automatically in rate-distortion theory for single sources. However, in the common formulation of problems of lossy source coding with side information at the decoder (the Wyner-Ziv problem), distributed source coding, and joint source-channel coding for networks, the destination can exploit the information it receives in a manner that cannot be exactly reproduced at the sender side. Some applications, like the transmission of sensitive medical information, may require that both sides-the sender and the receiver-will share a common version of the compressed data, for the purpose of future discussions or consulting. The purpose of this work is to study the implications of CR constraints on the achievable rates in scenarios of lossy source coding and lossy transmission of sources. Three problems are examined: source coding with side information at the decoder, simultaneous transmission of data and state over state-dependent channels, and joint source-channel coding for the degraded broadcast channel. Single-letter characterizations of the optimal performance are developed for these problems, under corresponding CR constraints. Implications of this constraint on problems of joint source-channel coding in networks are discussed.

关键词： Broadcast channel common reconstruction (CR) Gel'fand-Pinsker channel hierarchical coding joint source-channel coding source coding with side information successive refinement state-dependent channels Wyner-Ziv problem

来源：评论

学校读者我要写书评

暂无评论

coding With Action-Dependent side information and Additional Reconstruction Requirements

引用

IEEE TRANSACTIONS ON information THEORY 2015年第11期61卷 6355-6367页

作者： Kittichokechai, Kittipong Oechtering, Tobias J. Skoglund, Mikael KTH Royal Inst Technol Sch Elect Engn ACCESS Linnaeus Ctr SE-10044 Stockholm Sweden

Two classes of source/channel coding problems, namely, coding with action-dependent side information and coding with additional signal reconstruction are considered in a unified fashion. In the source coding setting, a decoder wishes to reconstruct the source subject to a distortion constraint, while an encoder is required to estimate the decoder's reconstruction reliably. side information is action-dependent in the sense that its quality and/or availability at the encoder or decoder can be influenced by a cost-constrained action sequence. In the channel coding dual, the decoder wishes to decode both the message and the channel input sequence reliably, and the channel state information available at the encoder or decoder is assumed to depend on the action sequence. We consider discrete memoryless systems and characterize single letter expressions for the rate-distortion-cost function and channel capacity for the respective source and channel coding problems.

关键词： Action source coding with side information channel with states signal reconstruction duality

来源：评论

学校读者我要写书评

暂无评论

Tracking and Control of Gauss-Markov Processes over Packet-Drop Channels with Acknowledgments

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2019年第2期6卷 549-560页

作者： Khina, Anatoly Kostina, Victoria Khisti, Ashish Hassibi, Babak CALTECH Dept Elect Engn Pasadena CA 91125 USA Tel Aviv Univ Dept Elect Engn Syst IL-69978 Tel Aviv Israel Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada

We consider the problem of tracking the state of Gauss-Markov processes over rate-limited erasureprone links. We concentrate first on the scenario in which several independent processes are seen by a single observer. The observer maps the processes into finite-rate packets that are sent over the erasure-prone links to a state estimator, and are acknowledged upon packet arrivals. The aim of the state estimator is to track the processes with zero delay and with minimum mean square error (MMSE). We show that, in the limit of many processes, greedy quantization with respect to the squared error distortion is optimal. That is, there is no tension between optimizing the MMSE of the process in the current time instant and that of future times. For the case of packet erasures with delayed acknowledgments, we connect the problem to that of compression with side information that is known at the observer and may be known at the state estimator-where the most recent packets serve as side information that may have been erased, and demonstrate that the loss due to a delay by one time unit is rather small. For the scenario where only one process is tracked by the observer-state estimator system, we further show that variable-length coding techniques are within a small gap of the many-process outer bound. We demonstrate the usefulness of the proposed approach for the simple setting of discrete-time scalar linear quadratic Gaussian control with a limited data-rate feedback that is susceptible to packet erasures.

关键词： Networked control systems packet loss sequential coding of correlated sources source coding with side information state estimation successive refinement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：