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

Channel Optimized distributed Multiple Description coding

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2012年第5期60卷 2539-2551页

作者： Valipour, Mehrdad Lahouti, Farshad Univ Tehran Sch Elect & Comp Engn Ctr Excellence Appl Electromagnet Syst Wireless Multimedia Commun LabColl Engn Tehran 14174 Iran

In this paper, for robust and efficient transmission of multiple correlated sources over noisy channels with packet loss, a channel optimized distributed multiple description vector quantization (CDMD) scheme is presented. The proposed CDMD scheme enjoys low-complexity encoding and delay and a scalable CDMD decoder, which jointly reconstructs the symbols of an arbitrary number of correlated sources. This, for example, suits data-gathering applications in wireless sensor networks. The CDMD encoder is designed using a deterministic annealing approach based on a minimum mean squared error asymmetric CDMD. A CDMD decoder for asymmetric distributed source coding is presented, which takes into account the side information, as well as channel noise and packet loss. Two types of iterative symmetric CDMD decoders, namely the estimated-SI and the soft-SI decoders, are presented, which respectively exploit the reconstructed symbols and a posteriori probabilities of other sources as SI in iterations. In a multiple-source CDMD setting, for reconstruction of a source, three methods are proposed to select another source as its SI during the decoding. The methods operate based on minimum physical distance, maximum mutual information, and minimum end-to-end distortion. The performance of the proposed systems and algorithms are evaluated and compared in detail.

关键词： distributed source coding multiple descriptions noisy channels with packet loss

来源：评论

学校读者我要写书评

暂无评论

Design of Binary LDPCA Codes with source Revealing Rate-Adaptation

引用

IEEE COMMUNICATIONS LETTERS 2012年第11期16卷 1836-1839页

作者： Shin, Sang-Yun Jang, Min Kim, Sang-Hyo Jeon, Byeungwoo Sungkyunkwan Univ Coll Informat & Commun Engn Suwon 440746 South Korea

In this letter, we consider binary low density parity check accumulate (LDPCA) codes with source revealing rate-adaptation for distributed source coding (DSC) applications. We propose an effective algorithm for selecting source symbols to the source revealing. Numerical results demonstrate that the proposed scheme significantly outperforms the conventional LDPCA codes in the high compression rate region in asymmetric DSC systems.

关键词： distributed source coding low-density parity-check nodes LDPCA codes source revealing rate-adaptation

来源：评论

学校读者我要写书评

暂无评论

Multiple-source Slepian-Wolf coding Under a Linear Equation Correlation Model

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2012年第9期60卷 2402-2407页

作者： Li, Shizheng Ramamoorthy, Aditya Iowa State Univ Dept Elect & Comp Engn Ames IA 50011 USA

In this work we present practical coding schemes for the problem of lossless distributed source coding for multiple sources. We consider two scenarios - the classical Slepian-Wolf case where there is no feedback from the terminal to the sources and a case where there is feedback from the terminal to the source encoders. The correlation model of interest is given by a system of linear equations, a generalization of the work of Stankovic et al. '06. We propose a transformation of correlation model and a way to determine proper decoding schedules, both of which are required to obtain the optimal sum rate. Our scheme allows us to exploit more correlations than those in the previous work. Simulation results show that the proposed coding scheme has lower sum rate than previous work in both scenarios.

关键词： Slepian-Wolf distributed source coding rate adaptive codes LDPC

来源：评论

学校读者我要写书评

暂无评论

Selfish distributed Compression Over Networks: Correlation Induces Anarchy

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2012年第5期58卷 3182-3197页

作者： Ramamoorthy, Aditya Roychowdhury, Vwani P. Singh, Sudhir K. Iowa State Univ Dept Elect & Comp Engn Ames IA 50011 USA Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA Haileo Inc Santa Clara CA 95054 USA

We consider the min-cost multicast problem (under network coding) with multiple correlated sources where each terminal wants to losslessly reconstruct all the sources. We study the inefficiency brought forth by the selfish behavior of the terminals in this scenario by modeling it as a noncooperative game among the terminals. The degradation in performance due to the lack of regulation is measured by the Price of Anarchy (POA), which is defined as the ratio between the cost of the worst possible Wardrop equilibrium and the socially optimum cost. Our main result is that in contrast with the case of independent sources, the presence of source correlations can significantly increase the price of anarchy. Toward establishing this result, we first characterize the socially optimal flow and rate allocation in terms of four intuitive conditions. Next, we show that the Wardrop equilibrium is a socially optimal solution for a different set of (related) cost functions. Using this, we construct explicit examples that demonstrate that the POA > 1 and determine near-tight upper bounds on the POA as well. The main techniques in our analysis are Lagrangian duality theory and the usage of the supermodularity of conditional entropy.

关键词： distributed source coding game theory multicast network coding selfish behavior

来源：评论

学校读者我要写书评

暂无评论

Onboard Low-Complexity Compression of Solar Stereo Images

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2012年第6期21卷 3114-3118页

作者： Wang, Shuang Cui, Lijuan Cheng, Samuel Stankovic, Lina Stankovic, Vladimir Univ Oklahoma Sch Elect & Comp Engn Tulsa OK 74135 USA Univ Strathclyde Dept Elect & Elect Engn Glasgow G1 1XW Lanark Scotland

We propose an adaptive distributed compression solution using particle filtering that tracks correlation, as well as performing disparity estimation, at the decoder side. The proposed algorithm is tested on the stereo solar images captured by the twin satellites system of NASA's Solar TErrestrial RElations Observatory (STEREO) project. Our experimental results show improved compression performance w.r.t. to a benchmark compression scheme, accurate correlation estimation by our proposed particle-based belief propagation algorithm, and significant peak signal-to-noise ratio improvement over traditional separate bit-plane decoding without dynamic correlation and disparity estimation.

关键词： distributed source coding image compression multiview imaging remote sensing

来源：评论

学校读者我要写书评

暂无评论

distributed source coding for Multimedia Multicast Over Heterogeneous Networks

引用

IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING 2007年第2期1卷 220-230页

作者： Stankovic, Vladimir Yang, Yang Xiong, Zixiang Univ Lancaster Dept Commun Syst Lancaster LA1 4WA England Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA

Real-time multimedia multicast over wireless networks is an exciting application that has generated a lot of interest recently. Its main challenge lies in the stringent bandwidth and time-delay requirements of real-time multimedia and severe impairments of the wireless channels. We develop a network-aware cross-layer design for multimedia multicast over heterogeneous wireless-wireline networks, that leverages the knowledge on network information theory, multimedia processing, error control, and networking. In particular, the encoded multimedia data are broadcast to multiple Internet servers over a wireless radio link. Each server merely compresses the signal it has received using distributed source coding by exploiting mutual correlation among signals received at different servers. The receiver collects bitstreams from the servers before performing joint decoding. We provide an algorithm for optimal nonuniform scalar quantizer design at the server side that minimizes the required rate under the decoder bit error rate constraint. For scalable multimedia codes, we develop a joint source-channel coding scheme which combines error-protection at the base station and distributed source coding at the servers. Our experimental results show significant performance improvements over conventional solutions due to spatial diversity and distributed source coding gains.

关键词： distributed source coding diversity methods multimedia communication multiterminal source coding video signal processing

来源：评论

学校读者我要写书评

暂无评论

Efficient improvement of Side Information in GOB-based DVC System

Efficient improvement of Side Information in GOB-based DVC S...

引用

IEEE International Symposium on Circuits and Systems

作者： Wu, Tsung-Che Hsu, Ji-Hua Lee, Chang-Ming Chiang, Jui-Chiu Natl Chung Cheng Univ Dept Commun Engn Chiayi Taiwan

ISBN: (纸本)9781467302197

Among the emerging video coding schemes, the effectual solution for the separate-encoding and joint-decoding architecture is the distributed source coding (DSC). In the DSC-based video system, the side information is available in the Wyner-Ziv (WZ) decoder and video reconstruction. Theoretically, the quality of side information (SI), usually referring to the difference between SI and source, dominates the coding efficiency. In order to improve the coding efficiency of DVC with temporal group of blocks, we proposed three SI generations after analyzing the correlation between the SI and original information. In contrast to the traditional improvement in the DVC decoder, the complexity of SI generator was dramatically reduced in our schemes. Experimental results show that the best method can reduce 0.7% bit-rate with less computation and no codec delay compared to the bi-linear interpolation (BLI) method.

关键词： distributed source coding Wyner-Ziv theorem side information interpolation correlation noise modeling

来源：评论

学校读者我要写书评

暂无评论

Prospicient Real-Time coding of Markov sources over Burst Erasure Channels: Lossless Case

Prospicient Real-Time Coding of Markov Sources over Burst Er...

引用

Data Compression Conference (DCC)

作者： Etezadi, Farrokh Khisti, Ashish Trott, Mitchell D. Univ Toronto ECE Dept Toronto ON M1B 5P1 Canada MCNL Lab HP Labs Palo Alto CA USA

ISBN: (纸本)9780769546568

We introduce a framework to study fundamental limits of sequential coding of Markov sources under an error propagation constraint. An encoder sequentially compresses a sequence of vector-sources that are spatially i.i.d. but temporally correlated according to a Markov process. The channel erases up to B packets in a single burst, but reveals all other packets to the destination. The destination is required to reproduce all the source-vectors instantaneously and in a lossless manner, except those sequences that occur in a window of length B+W following the start of the erasure burst. We define a rate-recovery function R(B, W), the minimum compression rate that can be achieved in this framework, and develop upper and lower bounds for first-order Markov sources. For the special class of linear diagonally correlated deterministic sources, we propose a new coding technique - prospicient coding - that achieves the rate-recovery function. Finally, a lossy extension to the rate-recovery function is also studied for a class of Gaussian sources where the source is temporally and spatially i.i.d. and the decoder aims to recover a collection of past K sources with a quadratic distortion measure. The optimal rate-recovery function is compared with the sub-optimal techniques including forward error correction coding (FEC) and Wyner-Ziv coding, and performance gains are quantified.

关键词： Delay Sensitive Communication distributed source coding Information Theory Multi-terminal source coding Real Time Streaming Communication

来源：评论

学校读者我要写书评

暂无评论

Easier Encoding-Decoding distributed Arithmetic coding for Slepian-Woff coding

Easier Encoding-Decoding Distributed Arithmetic Coding for S...

引用

2nd International Conference on Multimedia and Signal Processing (CMSP 2012)

作者： Pang, Yuye Shanghai Univ Elect Power Sch Comp & Informat Engn Shanghai 200090 Peoples R China

ISBN: (纸本)9783642352850

distributed Arithmetic coding (DAC) is an effective implementation of Slepian-Wolf problem. In this paper, the coding theory of DAC is introduced including two implements for asymmetric Slepian-Wolf problem, distributed Overlap Arithmetic coding (DOAC) and distributed Quasi-Arithmetic coding (DQAC). Both of the implementation schemes are analyzed. The advantages and disadvantages of them are compared and discussed. Then an improved scheme with easier encoding and decoding is proposed. Simulation results show that the proposed scheme is better than DOAC and DQAC.

关键词： distributed Arithmetic coding distributed source coding arithmetic coding

来源：评论

学校读者我要写书评

暂无评论

An Optimal Quantizer for distributed Souce coding

An Optimal Quantizer for Distributed Souce Coding

引用

2nd International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)

作者： Hao Runfang Cheng Yongqiang Taiyuan Univ Technol Coll Informat Engn Taiyuan Peoples R China

ISBN: (纸本)9780769549354

We present a extended algorithm to design an optimal scalar quantizer for distributed source coding in order to achieve a coding rate close to joint conditional entropy of the quantized frames given the side information. A simple model is considered in this paper. A tabu search method was combined with the Lloyd algorithm to select initial quantizers, which aims at minimizing the Lagrangian cost function and avoiding many poor local optima. Experimental results show the proposed method can improve rate-distortion performance for Gaussian scalar asymmetric case.

关键词： wireless sensor network distributed source coding quantizer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：