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

multiple descriptions Wyner-Ziv video coding

OPTIK 2014年第5期125卷 1650-1656页

作者： Ou, Xianfeng Qing, Linbo He, Xiaohai Yu, Yangcan Yu, Yanmei Sichuan Univ Sch Elect & Informat Engn Image Informat Inst Chengdu 610064 Peoples R China

This paper proposes a multiple descriptions Wyner-Ziv video coding (MDWZVC) architecture, which combines the merits of multiple descriptions coding (MDC) and Wyner-Ziv video coding (WZVC). All of the Wyner-Ziv frames (WZFs) are sub-sampled into four low resolution parallel phases to generate four descriptions, which are encoded and transmitted to the decoder independently. In addition, a successive refined side information (SI) algorithm, which is suitable for the video coding architecture is proposed to exploit both temporal and spatial correlations of the video frames. The simulation results show the SI quality, the peak signal to noise ratio (PSNR) and the rate-distortion (R-D) performance improved with the increasing numbers of received descriptions. By updating the SI quality and reconstruction results of the already decoded descriptions, the R-D performance improved further more. When all of the four descriptions correctly received, the R-D performance improvement of the proposed MDWZVC architecture over DISCOVER codec can be up to 1.8 dB, which indicates the effectiveness of the proposed architecture. (C) 2013 Elsevier GmbH. All rights reserved.

关键词： multiple descriptions coding Wyner-Ziv video coding Side information Low resolution Rate-distortion performance

来源：评论

学校读者我要写书评

暂无评论

Combinatorial Message Sharing and a New Achievable Region for multiple descriptions

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第2期62卷 769-792页

作者： Viswanatha, Kumar B. Akyol, Emrah Rose, Kenneth Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA Qualcomm Res Ctr San Diego CA 92121 USA Univ Illinois Dept Elect & Comp Engn Champaign IL 61820 USA

This paper presents a new achievable rate-distortion region for the general L channel multiple descriptions (MDs) problem. A well-known general region for this problem is due to Venkataramani, Kramer, and Goyal (VKG). Their encoding scheme is an extension of the El Gamal-Cover (EC) and Zhang-Berger (ZB) coding schemes to the L channel case and includes a combinatorial number of refinement codebooks, one for each subset of the descriptions. As in ZB, the scheme also allows for a single common codeword to be shared by all descriptions. This paper proposes a novel encoding technique involving combinatorial message sharing (CMS), where every subset of the descriptions may share a distinct common message. This introduces a combinatorial number of shared codebooks along with the refinement codebooks of. These shared codebooks provide a more flexible framework to tradeoff redundancy across the messages for resilience to descriptions loss. We derive an achievable rate-distortion region for the proposed technique, and show that it subsumes the VKG region for general sources and distortion measures. We further show that CMS provides a strict improvement of the achievable region for any source and distortion measures for which some two-description subset is such that ZB achieves points outside the EC region. We then show a more surprising result: CMS outperforms VKG for a general class of sources and distortion measures, including scenarios where the ZB and EC regions coincide for all two-description subsets. In particular, we show that CMS strictly improves on VKG, for the L-channel quadratic Gaussian MD problem, for all L >= 3, despite the fact that the EC region is complete for the corresponding two-descriptions problem. Consequently, the correlated quantization scheme (an extreme special case of VKG) that has been proven to be optimal for several cross sections of the L-channel quadratic Gaussian MD problem is strictly suboptimal Manuscript received April 20, 2013;revised

关键词： multiple descriptions coding source coding rate-distortion theory combinatorial message sharing

来源：评论

学校读者我要写书评

暂无评论

multiple description video coding for scalable and robust transmission over IP

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2005年第3期15卷 321-334页

作者： Franchi, N Fumagalli, M Lancini, R Tubaro, S Politecn Milan Multi Media Proc Unit CEFRIEL ICT Ctr Excellence Res Innovat Educ & Ind Labs I-20133 Milan Italy Politecn Milan Dipartimento Elettron & Informaz I-20133 Milan Italy

In this paper, we address the problem of video transmission over unreliable networks, such as the Internet, where packet losses occur. The most recent literature indicates multiple description (MD) as a promising coding approach to handle this issue. Moreover, it has been shown also how important the use of motion compensation prediction is in an MD-coding scheme. This paper proposes two architectures for multiple description video coding, both of them are based on the motion compensation prediction loop. The common characteristic of the two architectures is the use of a polyphase down-sampling technique to create the MDs and to introduce cross-redundancy among the descriptions. The first scheme, that we call drift-compensation multiple description video coder (DC-MDVC) appears very robust when used in an error-prone environment, but it can provide only two descriptions. The second architecture, called independent flow multiple description video coder (IF-MDVC), generates multiple sets of data before the motion compensation loop;in this case, there are no severe limitations in the selection of the number of descriptions used by the coder.

关键词： error concealment error resilience multiple descriptions coding robust video coding

来源：评论

学校读者我要写书评

暂无评论

n-channel symmetric multiple descriptions -: Part II:: An achievable rate-distortion region

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2005年第4期51卷 1377-1392页

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

In this Part II of a two-part paper, we present a new achievable rate-distortion region for the symmetric n-channel multiple-descriptions coding problem (n > 2) where the rate of every description is the same, and the reconstruction distortion depends only on the number of descriptions received. Using a new approach for the random coding constructions, along with a generalization of the technique used in the two-channel El Gamal and Cover region to any n, the rate region presented here achieves points that have not been known in the literature previously. This rate region is derived from a concatenation of source-channel erasure codes developed in Part I of this work by deploying the framework of source coding with side information ("random binning"). The key idea is that by using the framework of source coding with side information, multiple statistically identical realizations representing the coarse version of a source can be simultaneously refined by a single encoding. We point out that there is an important conceptual difference in random coding construction for the multiple-descriptions coding problem between the case of n = 2 and n > 2. To illustrate the framework, we also present the important case of the Gaussian source in detail.

关键词： maximum-distance separable (MDS) erasure codes multiple descriptions coding random binning source-channel erasure codes

来源：评论

学校读者我要写书评

暂无评论

n-channel symmetric multiple descriptions -: Part I:: (n, k) source-channel erasure codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2004年第1期50卷 47-61页

作者： Pradhan, SS Puri, R 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

In this two-part paper, we present a new achievable rate region for the general n-channel symmetric multiple descriptions problem. In Part I, inspired by the concept of maximum-distance separable (MDS) erasure channel codes, we consider a special case of this rate region, where the source is encoded into n descriptions each with rate R. These descriptions are transmitted over n bandwidth constrained and errorless channels. During transmission, a subset of these channels can break down, thus erasing the corresponding descriptions. The decoder is interested in recovering the source with the reception of at least k descriptions. Thus, the encoder is allowed to sample only one realization of this breakdown process during the entire transmission. For Gaussian sources, we have the following interesting result: when any k descriptions arrive, the achievable distortion exactly matches the optimal distortion-rate performance corresponding to a source rate of kR bits;with the reception of any m > k descriptions, the source reconstruction quality is strictly better, the improvement being nearly linear in the number of descriptions received.

关键词： distributed source coding maximum-distance separable (MDS) erasure codes multiple descriptions coding random binning

来源：评论

学校读者我要写书评

暂无评论

Improved multiple descriptions Sinusoidal Coder Adaptive to Packet Loss Rate

引用

Journal of Beijing Institute of Technology 2008年第2期17卷 202-207页

作者：郎玥王晶赵胜辉匡镜明 School of Information Science and Technology Beijing Institute of Technology

To make the multiple descriptions codec adaptive to the packet loss rate, which can minimize the final distortion, a novel adaptive multiple descriptions sinusoidal coder （AMDSC） is proposed, which is based on a sinusoidal model and a noise model. Firstly, the sinusoidal parameters are extracted in the sinusoidal model, and ordered in a decrease manner. Odd indexed and even indexed parameters are divided into two descriptions. Secondly, the output vector from the noise model is split vector quantized. And the two sub-vectors are placed into two descriptions too. Finally, the number of the extracted parameters and the redundancy between the two descriptions are adjusted according to the packet loss rate of the network. Analytical and experimental resuits show that the proposed AMDSC outperforms existing MD speech coders by taking network loss characteristics into account. Therefore, it is very suitable for unreliable channels

关键词： speech coding multiple descriptions coding sinusoidal model

来源：评论

学校读者我要写书评

暂无评论

Hierarchical and joint source-channel coding with coded state information at the transmitter

Hierarchical and joint source-channel coding with coded stat...

引用

IEEE International Symposium on Information Theory

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

This paper considers joint state-source-channel coding and multiple descriptions coding of channel state information (CSI), for state dependent channels. Specifically, we examine coded, non-causal CSI at the transmitt... 详细信息

ISBN: (纸本)0780391500

关键词： combined source-channel coding channel state information joint state-source-channel coding multiple descriptions coding state dependent channels

来源：评论

学校读者我要写书评

暂无评论

A Strictly Improved Achievable Region for multiple descriptions Using Combinatorial Message Sharing

A Strictly Improved Achievable Region for Multiple Descripti...

引用

IEEE Information Theory Workshop (ITW)

作者： Viswanatha, Kumar Akyol, Emrah Rose, Kenneth Univ Calif Santa Barbara ECE Dept Santa Barbara CA 93106 USA

ISBN: (纸本)9781457704376

We recently proposed a new coding scheme for the L-channel multiple descriptions (MD) problem for general sources and distortion measures involving 'Combinatorial Message Sharing' (CMS) [7] leading to a new achievable rate-distortion region. Our objective in this paper is to establish that this coding scheme strictly subsumes the most popular region for this problem due to Venkataramani, Kramer and Goyal (VKG) [3]. In particular, we show that for a binary symmetric source under Hamming distortion measure, the CMS scheme provides a strictly larger region for all L > 2. The principle of the CMS coding scheme is to include a common message in every subset of the descriptions, unlike the VKG scheme which sends a single common message in all the descriptions. In essence, we show that allowing for a common codeword in every subset of descriptions provides better freedom in coordinating the messages which can be exploited constructively to achieve points outside the VKG region.

关键词： multiple descriptions coding Source coding Rate distortion theory

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient multiple Description coding for Video Sensor Network

Energy Efficient Multiple Description Coding for Video Senso...

引用

9th IEEE International Symposium on Parallel and Distributed Processing with Applications Workshops (ISPAW)/ICASE/SGH/GSDP

作者： Sarif, Bambang A. B. Leung, Victor C. M. Nasiopoulos, Panos Univ British Columbia Dept Elect & Comp Engn Vancouver BC V5Z 1M9 Canada

ISBN: (纸本)9780769544298

Video transmission over wireless sensor networks (WSN) is a very challenging research field. With sensor nodes operate on limited energy resource, computational power and network bandwidth;energy efficient coding and transmission are of extreme important. As opposed to normal video system, video sensor network (VSN) system needs to provide high quality information only when situation calls for it. However, a certain degree of quality has to be guaranteed, especially for the region of interest (ROI) part. In this paper, a simple technique based on multiple description coding (MDC) to reduce the amount of information transmitted while maintaining a higher quality standard for the ROI part of the frame is proposed. Experimental results show some significant gain in energy conservation as compared to the existing techniques.

关键词： component wireless sensor network video sensor network multiple descriptions coding JPEG

来源：评论

学校读者我要写书评

暂无评论

Combinatorial Message Sharing for a Refined multiple descriptions Achievable Region

Combinatorial Message Sharing for a Refined Multiple Descrip...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Viswanatha, Kumar Akyol, Emrah Rose, Kenneth Univ Calif Santa Barbara ECE Dept Santa Barbara CA 93106 USA

ISBN: (纸本)9781457705953

This paper presents a new achievable rate-distortion region for the L-channel multiple descriptions problem. Currently, the most popular region for this problem is due to Venkataramani, Kramer and Goyal [3]. Their encoding scheme is an extension of the Zhang-Berger scheme to the L-channel case and includes a combinatorial number of refinement codebooks, one for each subset of the descriptions. All the descriptions also share a single common codeword, which introduces redundancy, but assists in better coordination of the descriptions. This paper proposes a novel encoding technique involving 'Combinatorial Message Sharing', where every subset of the descriptions may share a distinct common message. This introduces a combinatorial number of shared codebooks along with the refinement codebooks of [3]. These shared codebooks provide a more flexible framework to trade off redundancy across the messages for resilience to descriptions loss. We derive an achievable rate-distortion region for the proposed technique, and show that it subsumes the achievable region of [3].

关键词： multiple descriptions coding Source coding Rate distortion theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：