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

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

作者： Yasutada Oohama Department of Information Science and Intelligent Systems University of Tokushima Tokushima Japan

We consider the distributed source coding system for L correlated Gaussian remote sources X i , i = 1, 2,···, L, where X i , i = 1, 2, ·, L are L correlated Gaussian random variables. We deal with the case where each of L distributed encoders can not directly observe X i but its noisy version Y i = X i +N i . Here N i , i = 1,2,···, L are independent additive L Gaussian noises also independent of X i , i = 1, 2,···, L. On this coding system the determination problem of the rate distortion region remains open. In our previous works, we derived explicit outer and inner bounds of the rate distortion region and explicit sufficient condition for those two to match. In this paper we derive a stronger sufficient condition for the inner and outer bound to match. We further study the sum rate part of the rate distortion region when the correlation has some symmetrical property and derive a new lower bound of the sum rate part. We further derive a sufficient condition for this lower bound to be tight. The derived sufficient condition depends only on the correlation property of the sources and their observations.

关键词： source coding Sufficient conditions Rate-distortion Random variables Gaussian noise Rate distortion theory Information theory Conferences Information science Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

Diophantine Index Assignments for Distributed source coding

Diophantine Index Assignments for Distributed Source Coding

引用

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

作者： Gerhard Maierbacher Joao Barros Department of Computer Science Universidade do Porto Porto Portugal

We consider the design of index assignments for the distributed source coding problem in large-scale sensor networks. Using basic tools from number theory, specifically Diophantine analysis, we provide a framework for constructing cyclic index assignments that have very low complexity yet perform very close to fundamental bounds provided by rate-distortion theory.

关键词： source coding Decoding Lakes Telecommunications Computer science Large-scale systems Performance analysis Rate-distortion Sensor phenomena and characterization Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Remote source coding Under Gaussian Noise: Dueling Roles of Power and Entropy-Power

Remote Source Coding Under Gaussian Noise: Dueling Roles of ...

引用

Information Theory and Applications Workshop, ITA

作者： Krishnan Eswaran Michael Gastpar U.C. Berkeley and Google Inc. EPFL

Lossy source coding under the mean-squared error fidelity criterion is considered. The rate-distortion function can be expressed in closed form only for very special cases, including Gaussian sources. The classical upper and lower bounds look exactly alike, except that the upper bound has the source power (variance) whereas the lower bound has the source entropy-power. This pleasing duality of power and entropy-power extends to the case of remote source coding, i.e., the case where the encoder only gets to observe the source through a noisy channel. Bounds are presented both for the centralized and for the distributed case, often referred to as the CEO problem.

关键词： Rate-distortion Distortion source coding Noise measurement Nickel AWGN

来源：评论

学校读者我要写书评

暂无评论

Exponent function for Wyner-Ziv source coding problem at rates below the rate distortion function

Exponent function for Wyner-Ziv source coding problem at rat...

引用

International Symposium on Information Theory and Its Applications, ISITA

作者： Yasutada Oohama University of Electro-Communications Tokyo Japan

We consider the rate distortion problem with side information at the decoder posed and investigated by Wyner and Ziv. The rate distortion function indicating the trade-off between the rate on the data compression and the quality of data obtained at the decoder was determined by Wyner and Ziv. In this paper, we study the error probability of decoding at rates below the rate distortion function. We evaluate the probability of decoding such that the estimation of source outputs by the decoder has a distortion not exceeding a prescribed distortion level. We prove that when the rate of the data compression is below the rate distortion function this probability goes to zero exponentially and derive an explicit lower bound of this exponent function. On the Wyner-Ziv source coding problem the strong converse coding theorem has not been established yet. We prove this as a simple corollary of our result.

关键词： Decoding Rate-distortion Zinc source coding Distortion Probability distribution Error probability

来源：评论

学校读者我要写书评

暂无评论

Lossless source coding for a Heegard-Berger problem with two sources and degraded reconstruction sets

Lossless source coding for a Heegard-Berger problem with two...

引用

International Symposium on Wireless Communication Systems (ISWCS)

作者： Meryem Benammar Abdellatif Zaidi Mathematics and Algorithmic Sciences Lab Huawei Technologies France Boulogne-Billancourt France

This work investigates the problem of lossless compression of two arbitrarily correlated memoryless sources in an instance of Heegard-Berger problem with degraded reconstruction sets. Specifically, one of the sources is to be reproduced losslessly by two separate decoders, and the other one is to be reproduced losslessly by only one of the two decoders. The decoders observe side information sequences that are arbitrarily correlated among them, and with the sources. We establish a single-letter characterization of the optimal compression rate of this model. We also discuss several examples, and highlight the utility of an appropriate joint compression of the two sources for it to be optimal.

关键词： Decoding source coding Manganese Rate-distortion Distortion Random variables

来源：评论

学校读者我要写书评

暂无评论

Adaptive Distributed source coding over Erasure Channels Using Particle-Based Belief Propagation

Adaptive Distributed Source Coding over Erasure Channels Usi...

引用

2010 IEEE Global Telecommunications Conference GLOBECOM 2010

作者： Lijuan Cui Shuang Wang Samuel Cheng School of Electrical and Computer Engineering University of Oklahama Tulsa OK USA

This paper addresses the problem of distributed source coding (DSC) of binary sources with unknown varying correlation statistics over erasure channels. We propose an adaptive asymmetric Slepian-Wolf (SW) decoding scheme using particle-based belief propagation (BP) based on Raptor codes. We show through the experiments that the proposed algorithm can simultaneously reconstruct the compressed sources and estimate the correlation between source and side information. Moreover, compared to the conventional Raptor decoder, the proposed approach can achieve a higher compression ratio and provide stronger erasure protection under unknown varying correlation statistics. The ability to estimate the statistical correlation in the code structure makes our approach very useful for real applications.

关键词： Correlation Decoding Peer to peer computing Estimation Bit error rate source coding Region 1

来源：评论

学校读者我要写书评

暂无评论

Analytical rate versus distortion characteristics for LMS adaptive source coding

Analytical rate versus distortion characteristics for LMS ad...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： S. Alexander D. Kim Department of Electrical and Computer Engineering North Carolina State University Raleigh NC USA

This paper investigates analytically and experimentally the rate (transmitted bandwidth) versus signal distortion introduced by transmitting and reconstructing the signal from the quantized LMS prediction residual. The contribution of this paper is the analytical determination of the received signal distortion as a function of quantizer wordlength (which determines the transmitted bit rate), LMS filter parameters and input signal correlation properties. This distortion is computable for both the transient adaptation stage and in the steady state converged stage.

关键词： Rate distortion theory Least squares approximation source coding Image reconstruction Bandwidth Steady-state Pulse modulation Arithmetic Signal analysis Adaptive algorithm

来源：评论

学校读者我要写书评

暂无评论

A design of rate-adaptive LDPC codes for distributed source coding using PEG algorithm

A design of rate-adaptive LDPC codes for distributed source ...

引用

MILCOM, Military Communications Conference

作者： Min Jang Jin Whan Kang Sang-Hyo Kim School of Information and Communication Engineering Sungkyunkwan University Suwon South Korea

We propose a method for constructing rate-adaptive low-density parity check (LDPC) codes with large girth by syndrome merging with progressive-edge-growth (PEG) algorithm. Proposed scheme has a different structure from LDPC accumulate (LDPCA) codes. As a result, the new construction method turns the girth up for each specific code, and eliminates error floor.

关键词： Parity check codes Decoding Algorithm design and analysis Merging Floors source coding

来源：评论

学校读者我要写书评

暂无评论

Two-way successively refined joint source-channel coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第4期52卷 1483-1494页

作者： Maor, A Merhav, N Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

Consider a source, {X-i, Y-i}(i=1)(infinity) producing independent copies of a pair of jointly distributed random variables (RVs). The {X-i} part of the process is observed at some location, say A, and is supposed to be reproduced at a different location, say B, where the {Y-i} part of the process is observed. Similarly, {Y-i} should be reproduced at location A. The communication between the two locations is carried out across two memoryless channels in K iterative bi-directional rounds. In each round, the source components are reconstructed at the other locations based on the information exchanged in all previous rounds and the source component known at that location, and it is desired to find the amount of information that should be exchanged between the two locations in each round, so that the distortions incurred (in each round) will not exceed given thresholds. Our setting extends the results of Steinberg and Merhav as well as Kaspi, combining the notion of successive refinement with this of two-way interactive communication. We first derive a single-letter characterization of achievable rates for a pure source-coding problem with successive refinement. Then, for a joint source-channel coding setting, we prove a separation theorem, asserting that in the limit of long blocks, no optimality is lost by first applying lossy (two-way) successive-refinement source coding, regardless of the channels, and then applying good channel codes to each one of the resulting bitstreams, regardless of the source.

关键词： channel capacity joint source-channel coding source coding successive refinement two-way communication

来源：评论

学校读者我要写书评

暂无评论

A source and channel-coding framework for vector-based data hiding in video

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2000年第4期10卷 630-645页

作者： Mukherjee, D Chae, JJ Mitra, SK Manjunath, BS Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA

Digital data hiding is a technology being developed for multimedia services, where significant amounts of secure data is invisibly hidden inside a host data source by the owner for retrieval only by those authorized. The hidden data should be recoverable even after the host has undergone standard transformations, such as compression. In this paper, we present a source and channel coding framework for data hiding, allowing any tradeoff between the visibility of distortions introduced, the amount of data embedded, and the degree of robustness to noise, The secure data is source coded by vector quantization, and the indices obtained in the process are embedded in the host video using orthogonal transform domain vector perturbations, Transform coefficients of the host are grouped into vectors and perturbed using noise-resilient channel codes derived from multidimensional lattices. The perturbations are constrained by a maximum allowable mean-squared error that can be introduced in the host. Channel-optimized VQ can be used for increased robustness to noise. The generic approach is readily adapted to make retrieval possible for applications where the original host is not available to the retriever. The secure data in our implementations are low spatial and temporal resolution video, and sampled speech, while the host data is QCIF video. The host video with the embedded data is H.263 compressed, before attempting retrieval of the hidden video and speech from the reconstructed video. The quality of the extracted video and speech is shown for varying compression ratios of the host video.

关键词： channel coding data hiding lattice VQ source coding watermarking wavelet transform

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：