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

Data Compression Conference 2003 (DCC2003)

作者： Rebollo-Monedero, D Zhang, R Girod, B Stanford Univ Dept Elect Engn Informat Syst Lab Stanford CA 94305 USA

ISBN: (纸本)0769518966

We address the problem of designing optimal quantizers for distributed source coding. The generality of our formulation includes both the symmetric and asymmetric scenarios, together with a number of coding schemes, such as the ideal coding achieving a rate equal to the joint conditional entropy of the quantized sources given the side information. We show the optimality conditions quantizers must satisfy, and generalize the Lloyd algorithm for its design. Experimental results are shown for the Gaussian scalar asymmetric case.

关键词： Algorithm design and analysis Decoding Design optimization Entropy Information systems Laboratories Quantization Rate-distortion Remote sensing source coding

来源：评论

学校读者我要写书评

暂无评论

A COMPLETE SUFFICIENT STATISTIC FOR FINITE-STATE MARKOV-PROCESSES WITH APPLICATION TO source-coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1993年第3期39卷 1047-1049页

作者： WOLFE, LB CHANG, CI UNIV MARYLAND DEPT ELECT ENGNCATONSVILLEMD 21228

A complete sufficient statistic is presented in this paper for the class of all finite-state, finite-order stationary discrete Markov processes. This sufficient statistic is complete in the sense that it summarizes in entirety the whole of the relevant information supplied by any process sample. The sufficient statistic has application to source coding problems such as source matching and calculation of the rate distortion function.

关键词： COMPLETE SUFFICIENT STATISTIC MARKOV CHAIN source coding

来源：评论

学校读者我要写书评

暂无评论

Compress-and-Estimate source coding for a Vector Gaussian source

Compress-and-Estimate Source Coding for a Vector Gaussian So...

引用

2017 IEEE Information Theory Workshop (ITW)

作者： Song, Ruiyang Rini, Stefano Kipnis, Alon Goldsmith, Andrea J. Stanford Univ Stanford CA 94305 USA Natl Chiao Tung Univ Hsinchu Taiwan

ISBN: (纸本)9781509030972

We consider the remote vector source coding problem in which a vector Gaussian source is estimated from noisy linear measurements. For this problem, we derive the performance of the compress-and-estimate (CE) coding scheme and compare it to the optimal performance. In the CE coding scheme, the remote encoder compresses the noisy source observations so as to minimize a local distortion measure, independent from the joint distribution between the source and the observations. In reconstruction, the decoder, having full knowledge of the joint distribution of the source and observations, estimates the original source realization from the lossy-compressed noisy observations. For the CE scheme in the vector Gaussian case, we show that, if the code rate is less than a specific threshold, then the CE coding scheme attains the same performance as the optimal coding scheme. For code rates above this threshold, we introduce lower and upper bounds on the performance gap between the CE and the optimal scheme. The case of a two-dimensional Gaussian source observed through two noisy measurements is studied to illustrate the behavior of the performance gap.

关键词： Distortion source coding Noise measurement Distortion measurement Covariance matrices Decoding

来源：评论

学校读者我要写书评

暂无评论

VERSATILE MULTIVIEW LAYERED VIDEO BASED ON DISTRIBUTED source coding

VERSATILE MULTIVIEW LAYERED VIDEO BASED ON DISTRIBUTED SOURC...

引用

14th International Workshop on Image Analysis for Multimedia Interactive Services (WIAMIS)

作者： Petrazzuoli, G. Macovei, C. Nicolae, I. -E. Cagnazzo, M. Dufaux, F. Pesquet-Popescu, B. Telecom ParisTech Inst Mines Telecom CNRS LTCI UMR 5141 Paris France

ISBN: (纸本)9781479908332

Video content constitutes today a large part of the data traffic on the Internet. This is allowed by the capillary spreading of video codec technologies: nowadays, every computer, tablet and smart phone is equipped with video encoding and decoding technologies. As a matter of fact, the video content often exists in different formats, that, even though they can be incompatible to each other, still have a significant mutual redundancy. The incompatibility prevents an efficient exploitation of the scalability, which on the other hand is a very important characteristic when it comes to efficient network use. An interesting alternative to classical scalable video is to use distributed video coding (DVC) for the enhancement layers. In the envisaged scenario, clients have different decoders for the base layer, adapted to the characteristics of their device. However they can share the same enhancement layer, since DVC allows encoding frames independently from the reference that will be employed at the decoder. This approach has been considered in the past in order to improve temporal and spatial scalability. In this work we review the existing approaches, improve them using more recent DVC techniques and perform a new analysis for the emerging multi-view applications.

关键词： Internet smart phones source coding telecommunication traffic video codecs video coding

来源：评论

学校读者我要写书评

暂无评论

A Graph-Based Message Passing Approach for Noisy source coding via Information Bottleneck Principle

A Graph-Based Message Passing Approach for Noisy Source Codi...

引用

IEEE Global Conference on Communications (GLOBECOM) / Workshop on Wireless Networking and Control for UAV

作者： Hassanpour, Shayan Wuebben, Dirk Dekorsy, Armin Univ Bremen Dept Commun Engn D-28359 Bremen Germany

ISBN: (纸本)9781538647271

The main focus of this paper is on the problem of noisy source coding wherein observed signals from an inaccessible source shall be compressed. To that end, rather than resorting to the conventional methods from Rate-Distortion theory, the so-called Information Bottleneck paradigm is deployed in order to obtain a highly informative representing signal w.r.t. the given source. An efficient, generic and highly flexible graph-based message passing routine for clustering, known as the Affinity Propagation is successfully applied here as a novel treatment for that purpose. The fundamental differences and the performance-wise comparison w.r.t. the state-of-the-art KL-Means-IB algorithm is provided as well.

关键词： Noise measurement Distortion measurement Task analysis source coding Complexity theory Distortion Optimization

来源：评论

学校读者我要写书评

暂无评论

Zero-error source coding with maximum distortion criterion.

Zero-error source coding with maximum distortion criterion.

引用

Data Compression Conference (DCC 2002)

作者： Tuncel, E Koulgi, P Regunathan, S Rose, K Univ Calif Santa Barbara Dept ECE Santa Barbara CA 93106 USA

ISBN: (纸本)0769514774

Let finite source and reproduction alphabets X and Y and a distortion measure d : X x Y --> [0, infinity) be given. We study the minimum asymptotic rate required to describe a source distributed over X within a (given) distortion threshold D at every sample. The problem is hence a min-max problem, and the distortion measure is extended to vectors as follows: for x(n) epsilon X-n, y(n) epsilon Y-n, d(x(n), y(n)) = max, d(x(i), y(i)). In the graph-theoretic formulation we introduce, a code for the problem is a dominating set of an equivalent distortion graph, We introduce a linear programming lower bound for the minimum dominating set size of an arbitrary graph, and show that this bound is also the minimum asymptotic rate required for the corresponding source. Turning then to the optimality of scalar coding, we show that scalar codes are asymptotically optimal if the underlying graph is either an interval graph or a tree.

关键词： Constraint theory Distortion measurement Image coding Image reconstruction Linear programming Probability source coding Statistics Turning Vectors

来源：评论

学校读者我要写书评

暂无评论

On joint classification and compression in a distributed source coding framework

On joint classification and compression in a distributed sou...

引用

12th IEEE Workshop on Statistical Signal Processing

作者： Ishwar, P Prabhakaran, VM Ramchandran, K Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

ISBN: (纸本)0780379977

In many classification problems of interest, it is desirable to not only classify accurately but also to have access to the "raw data" that was used to do the classification. This naturally leads to the concept of joint classification and compression under system communication (or bandwidth) constraints. A typical system involves a complexity-constrained remote sensing unit and a central processing unit. In this paper, we will address the case of a single remote sensing unit (encoder) and a central processing unit (decoder) and a finite bit rate constraint to abstract the bandwidth-limited channel between the encoder and decoder. The goal is to spend this bit budget in the optimal sense, in terms of classification performance (minimize probability of classification error) as well as to enable reconstruction of the raw data with maximum fidelity (in the rate-distortion sense). © 2003 IEEE.

关键词： Bandwidth Bit rate Central Processing Unit Cryptography Data models Decoding Performance loss Rate-distortion Remote sensing source coding

来源：评论

学校读者我要写书评

暂无评论

Rate Distortion for source coding with Markov Side Information at the Decoder

Rate Distortion for Source Coding with Markov Side Informati...

引用

International Symposium on Information Theory and its Applications (ISITA)

作者： Oohama, Yasutada Univ Electrocommun Tokyo Japan

ISBN: (纸本)9784885522925

In this paper we study the rate distortion trade off for source coding with side information at the decoder. This problem was posed and investigated by Wyner and Ziv. We call this problem the Wyner-Ziv source coding problem. In this paper we study the Wyner-Ziv source coding problem for a class of information sources with memory. For this class of information sources we give explicit inner and outer bounds of the rate distortion region.

关键词： Australia Decoding Joints Markov processes Random variables Rate-distortion source coding

来源：评论

学校读者我要写书评

暂无评论

Secure and Private source coding with Private Key and Decoder Side Information

Secure and Private Source Coding with Private Key and Decode...

引用

IEEE Information Theory Workshop (ITW)

作者： Gunlu, Onur Schaefer, Rafael F. Boche, Holger Poor, H. Vincent Univ Siegen Chair Commun Engn & Secur Siegen Germany Linkoping Univ Dept Elect Engn Informat Coding Div Linkoping Sweden Tech Univ Munich Chair Theoret Informat Technol Munich Germany Ruhr Univ Bochum CASA Cyber Secur Age Large Scale Adversaries Exze Bochum Germany Tech Univ Munich BMBF Res Hub 6G Life Munich Germany Princeton Univ Dept Elect & Comp Engn Princeton NJ 08544 USA

ISBN: (数字)9781665483414

ISBN: (纸本)9781665483414

The problem of secure source coding with multiple terminals is extended by considering a remote source whose noisy measurements are the correlated random variables used for secure source reconstruction. The main additions to the problem include 1) all terminals noncausally observe a noisy measurement of the remote source;2) a private key is available to all legitimate terminals;3) the public communication link between the encoder and decoder is rate-limited;and 4) the secrecy leakage to the eavesdropper is measured with respect to the encoder input, whereas the privacy leakage is measured with respect to the remote source. Exact rate regions are characterized for a lossy source coding problem with a private key, remote source, and decoder side information under security, privacy, communication, and distortion constraints. By replacing the distortion constraint with a reliability constraint, we obtain the exact rate region also for the lossless case. Furthermore, the lossy rate region for scalar discrete-time Gaussian sources and measurement channels is established.

关键词： Privacy source coding Reliability theory Distortion Loss measurement Decoding Random variables

来源：评论

学校读者我要写书评

暂无评论

New results on optimistic source coding

New results on optimistic source coding

引用

26th Symposium on Information Theory and Its Applications (SITA2003)

作者： Sato, N Koga, H Univ Tsukuba Masters Program Sci & Engn Tsukuba Ibaraki 3058573 Japan Univ Tsukuba Grad Sch Syst & Informat Engn Tsukuba Ibaraki 3058573 Japan

Optimistic coding is a coding in which we require the existence of reliable codes for infinitely many block length. In this letter we consider the optimistic source coding theorems for a general source Z from the information-spectrum approach. We first formulate the problem to be considered clearly. We obtain the optimistic infimum achievable source coding rate T-epsilon(Z) for the case where decoding error probability epsilon(n) is asymptotically less than or equal to an arbitrarily given epsilonis an element of [0, 1). In fact, T-epsilon(Z) turns out to be expressed in a form similar to the ordinary infimum achievable source coding rate. A new expression for T-epsilon(Z) is also given. In addition. we investigate the case where epsilon(n) = 0 for infinitely many n and obtain the infimum achievable coding rate.

关键词： source coding fixed-length coding general source information-spectrum optimistic coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：