نتایج جستجو برای: robust multiterminal source coding

تعداد نتایج: 730332  

A. Aghagolzadeh, E. Mikaili, H. R. Rabiee, M. Nooshyar,

The robustness property can be added to DSC system at the expense of reducing performance, i.e., increasing the sum-rate. The aim of designing robust DSC schemes is to trade off between system robustness and compression efficiency. In this paper, after deriving an inner bound on the rate–distortion region for the quadratic Gaussian MDC based RDSC system with two encoders, the structure of...

Journal: :Journal of Multimedia 2007
Bi Song Ertem Tuncel Amit K. Roy-Chowdhury

In this paper, we present a framework for multiterminal video compression (MTVC) that exploits the geometric constraints between cameras with overlapping fields of view, and then uses distributed source coding on corresponding points in two or more views. There are two main parts of the paper a Distributed Motion Estimation (DME) algorithm and a Distributed Source Coding (DSC) algorithm. The no...

Journal: :Foundations and Trends in Communications and Information Theory 2016
Prakash Narayan Himanshu Tyagi

This monograph describes principles of information theoretic secrecy generation by legitimate parties with public discussion in the presence of an eavesdropper. The parties are guaranteed secrecy in the form of independence from the eavesdropper’s observation of the communication. Part I develops basic technical tools for secrecy generation, many of which are potentially of independent interest...

Journal: :CoRR 2008
Shigeaki Kuzuoka Akisato Kimura Tomohiko Uyematsu

This paper deals with a coding problem called complementary delivery, where messages from two correlated sources are jointly encoded and each decoder reproduces one of two messages using the other message as the side information. Both lossless and lossy universal complementary delivery coding schemes are investigated. In the lossless case, it is demonstrated that a universal complementary deliv...

Journal: :IEEE Transactions on Communications 2021

Consider the following setup: Through a joint design, multiple observations of remote data source shall be xmlns:xlink="http://www.w3.org/1999/xlink">locally compressed before getting transmitted via several xmlns:xlink="http://www.w3.org/1999/xlink">error-prone , rate-limited forward l...

2006
TOMAS ANDERSSON

This thesis treats the problem of source coding in situations where the encoded data is subject to errors. The typical scenario is a communication system, where source data such as speech or images should be transmitted from one point to another. A problem is that most communication systems introduce some sort of error in the transmission. A wireless communication link is prone to introduce ind...

2009
H. A. Haus P. L. Penfield Jr. W. D. Rummler

The research on noise in electron devices has two objectives: (i) The study of specific devices, such as the parametric amplifier and the maser, to determine the physical sources of noise and the limitations they impose on the noise performance of the amplifier. The parametric amplifier with coherent input signals at both the signal and idler frequency, and the degenerate parametric amplifier a...

Journal: :IEEE Trans. Information Theory 2012
Behzad Ahmadi Osvaldo Simeone

Source coding with a side information "vending machine" is a recently proposed framework in which the statistical relationship between the side information available at the decoder and the source sequence can be controlled by the decoder based on the message received from the encoder. In this paper, the characterization of the optimal rate-distortion performance as a function of the cost associ...

Journal: :CoRR 2012
Kumar Viswanatha Emrah Akyol Kenneth Rose

Consider the following information theoretic setup wherein independent codebooks of N correlated random variables are generated according to their respective marginals. The problem of determining the conditions on the rates of codebooks to ensure the existence of at least one codeword tuple which is jointly typical with respect to a given joint density (called the multivariate covering lemma) h...

2006
Sergio D. Servetto

It is proved that a convexified form of the Berger-Tung inner bound provides the set of all achievable rates for the multiterminal source coding problem. In this paper, a proof is developed for general discrete memoryless sources and bounded distortion measures, for two encoding terminals. The proof is based on two new developments. One is the construction of new inner and outer bounds to the r...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید