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

Multimedia Multicast Based on Multiterminal source coding

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2010年第9期E93A卷 1639-1649页

作者： Aghagolzadeh, Ali Nooshyar, Mahdi Rabiee, Hamid R. Mikaili, Elhameh Univ Tabriz Fac Elect & Comp Engn Tabriz 51664 Iran Sharif Univ Technol Fac Comp Engn Tehran Iran

Multimedia multicast with two servers based on the multiterminal source coding is studied in some previous researches. Due to the possibility of providing an approach for practical code design for more than two correlated sources in IMTSC/CEO setup, in this paper, the framework of Slepian-Wolf coded quantization is extended and a practical code design is presented for IMTSC/CEO with the number of encoders greater than two. Then the multicast system based on the IMTSC/CEO is applied to the cases with three, four and five servers. Since the underlying code design approach for the IMTSC/CEO problem has the capability of applying to an arbitrary number of active encoders, the proposed MMBMSC method can also be used with an arbitrary number of servers easily. Also, explicit expressions of the expected distortion with an arbitrary number of servers in the MMBMSC system are presented. Experimental results with data, image and video signals show the superiority of our proposed method over the conventional solutions and over the MMBMSC system with two servers.

关键词： distributed source coding indirect multi terminal source coding CEO problem multicast

来源：评论

学校读者我要写书评

暂无评论

Interactive Encoding and Decoding for One Way Learning: Near Lossless Recovery With Side Information at the Decoder

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2010年第4期56卷 1808-1824页

作者： Yang, En-Hui He, Da-Ke Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA

A source coding paradigm called interactive encoding and decoding (IED) is considered for a source network where a finite alphabet source X is to be encoded, and another finite alphabet source Y correlated with is available only to the decoder as a helper. The optimal performance achievable asymptotically (OPAA) by IED is investigated, where the performance is measured as the average number of bits per symbol exchanged by the encoder and decoder until the decoder learns with high probability. First, it is shown that for any stationary (X, Y), the OPAA by IED is given by the conditional entropy rate H (X vertical bar Y) of X given Y. This is in contrast with noninteractive Slepian-Wolf (SW) coding, where the OPAA is shown in general to be strictly greater than H (X vertical bar Y) when (X, Y) is not ergodic. Second, for a memory-less source pair (X, Y), it is shown that IED approaches H (X vertical bar Y) faster than SW coding does. Finally, it is demonstrated that one can convert any classical universal data compression algorithm with side information to a universal IED algorithm for the class A of all stationary ergodic source pairs. In contrast, universal SW coding algorithms for the class A do not exist.

关键词： distributed source coding entropy interactive encoding and decoding source networks universal data compression

来源：评论

学校读者我要写书评

暂无评论

Robust Video coding Based on Multiple Description Scalar Quantization With Side Information

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2010年第6期20卷 769-779页

作者： Crave, Olivier Pesquet-Popescu, Beatrice Guillemot, Christine Telecom ParisTech Dept Signal & Image Proc F-75634 Paris 13 France Inst Natl Rech Informat & Automat F-35042 Rennes France

This paper addresses the problem of video compression for robust transmission on lossy Internet networks. The approach developed relies on multiple description coding (MDC) principles. Predictive multiple description video coding has already been considered for robust video transmission over lossy channels. However, MDC, when combined with motion-compensated prediction, is known to suffer from predictive mismatch: in presence of losses, the prediction signal available at the decoder may differ from the one used at the encoder. In this paper, we describe a video compression scheme based on MDC and Wyner-Ziv (WZ) coding. The input sequence is structured into groups of pictures which contain one key frame and one WZ frame. Each frame is first transformed with a wavelet transform and the resulting frequency bands are quantized with a multiple description scalar quantizer. Two balanced descriptions of the video input are thus generated. The quantization indexes of the WZ frames are coded with an low-density parity-check accumulate-based Slepian-Wolf (SW) coder. The lateral receivers first decode the received key frame lateral descriptions, and then construct the side information needed for decoding the corresponding WZ frame descriptions by motion-compensated interpolation. In the case where the two WZ data descriptions are received, the central decoder can perform a separate SW decoding of the two sequences of quantization indexes. A joint iterative decoding approach of the two WZ descriptions is also described which improve the central WZ data decoding performance, however, at the expense of increased decoding complexity. The influence of the proposed iterative decoding technique and of the amount of redundancy on the lateral and central rate-distortion performance of the algorithm is studied.

关键词： distributed source coding multiple description coding Wyner-Ziv (WZ)

来源：评论

学校读者我要写书评

暂无评论

Energy Aware Iterative source Localization for Wireless Sensor Networks

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2010年第9期58卷 4824-4835页

作者： Masazade, Engin Niu, Ruixin Varshney, Pramod K. Keskinoz, Mehmet Sabanci Univ Fac Engn & Nat Sci TR-34956 Istanbul Turkey Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA

In this paper, the source localization problem in wireless sensor networks is investigated where the location of the source is estimated based on the quantized measurements received from sensors in the field. An energy efficient iterative source localization scheme is proposed where the algorithm begins with a coarse location estimate obtained from measurement data from a set of anchor sensors. Based on the available data at each iteration, the posterior probability density function (pdf) of the source location is approximated using an importance sampling based Monte Carlo method and this information is utilized to activate a number of non-anchor sensors. Two sensor selection metrics namely the mutual information and the posterior Cramer-Rao lower bound (PCRLB) are employed and their performance compared. Further, the approximate posterior pdf of the source location is used to compress the quantized data of each activated sensor using distributed data compression techniques. Simulation results show that with significantly less computation, the PCRLB based iterative sensor selection method achieves similar mean squared error (MSE) performance as compared to the state-of-the-art mutual information based sensor selection method. By selecting only the most informative sensors and compressing their data prior to transmission to the fusion center, the iterative source localization method reduces the communication requirements significantly and thereby results in energy savings.

关键词： distributed source coding Monte Carlo methods posterior Cramer-Rao lower bound source localization wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

source-Optimized Clustering for distributed source coding

Source-Optimized Clustering for Distributed Source Coding

引用

IEEE Global Telecommunications Conference (GLOBECOM 06)

作者： Maierbacher, Gerhard Barros, Joao Univ Porto Dept Comp Sci Oporto Portugal

ISBN: (纸本)9781424403561

Motivated by the design of low-complexity distributed quantizers and iterative decoding algorithms that leverage the correlation in the data picked up by a large-scale sensor network, we address the problem of finding correlation preserving clusters. To construct a factor graph describing the statistical dependencies between sensor measurements, we develop a hierarchical clustering algorithm that minimizes the Kullback Leibler Distance between known and approximated source statistics. Finally, we show how the clustering result can be exploited in the design of index assignments for distributed quantization and source-channel decoders of manageable complexity.

关键词： sensor networks distributed source coding clustering trees quantization Kullback-Leibler distance

来源：评论

学校读者我要写书评

暂无评论

A reduced-reference structural similarity approximation for videos corrupted by channel errors

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2010年第3期48卷 471-492页

作者： Tagliasacchi, Marco Valenzise, Giuseppe Naccari, Matteo Tubaro, Stefano Politecn Milan Dipartimento Elettron & Informat I-20133 Milan Italy

In this paper we propose a reduced-reference quality assessment algorithm which computes an approximation of the Structural SIMilarity (SSIM) metrics exploiting coding tools provided by the distributed source coding theory. The algorithm has been tested to evaluate the quality of decoded video bitstreams after transmission over error-prone networks. We evaluate the accuracy of the proposed quality assessment algorithm by measuring the Pearson's correlation coefficient between the structural similarity metrics computed in full-reference mode and the one provided by the proposed reduced-reference algorithm. The proposed reduced-reference algorithm achieves good correlation values (higher than 0.85 with packet loss rate equal up to 2.5%).

关键词： Reduced reference video quality assessment distributed source coding

来源：评论

学校读者我要写书评

暂无评论

Multiterminal source coding for multiview images under wireless fading channels

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2010年第3期48卷 457-470页

作者： Khirallah, Chadi Stankovic, Vladimir Stankovic, Lina Cheng, Samuel Univ Strathclyde Dept Elect & Elect Engn Glasgow G1 1XW Lanark Scotland Univ Oklahoma Sch Elect & Comp Engn Schusterman Ctr Tulsa OK 74135 USA

This paper addresses the problem of wireless transmission of a captured scene from multiple cameras, which do not communicate among each other, to a joint decoder. Correlation among different camera views calls for distributed source coding for efficient multiview image compression. The fact that cameras are placed within a short range of each other results in a high level of interference, multipath fading, and noise effects during communications. We develop a novel two-camera system, that employs multiterminal source coding and complete complementary data spreading, so that while the former technique exploits the statistical correlation between camera views, and performs joint compression to reduce transmission rates, the spreading technique will protect transmitted data by mitigating the effects of wireless fading channels. Our results indicate that the proposed system is competitive when compared to two independently JPEG encoded streams at low to medium transmission rates.

关键词： Multiview image coding distributed source coding Slepian-Wolf coding Spread spectrum Complete complementary sequences

来源：评论

学校读者我要写书评

暂无评论

Biometric template protection in multimodal authentication systems based on error correcting codes

引用

JOURNAL OF COMPUTER SECURITY 2010年第1期18卷 161-185页

作者： Argyropoulos, Savvas Tzovaras, Dimitrios Ioannidis, Dimosthenis Damousis, Yannis Strintzis, Michael G. Braun, Martin Boverie, Serge Ctr Res & Technol Hellas Informat & Telemat Inst GR-57001 Thermi Greece Aristotle Univ Thessaloniki Dept Elect & Comp Engn Thessaloniki Greece Continental Automot GmbH Regensburg Germany

The widespread deployment of biometric systems has raised public concern about security and privacy of personal data. In this paper, we present a novel framework for biometric template security in multimodal biometric authentication systems based on error correcting codes. Biometric recognition is formulated as a channel coding problem with noisy side information at the decoder based on distributed source coding principles. It is shown that the proposed method binds the biometric template in a cryptographic key which does not reveal any information about the original biometric data even if it is compromised by an attacker. Furthermore, the advantages of the proposed method in terms of security and impact on matching accuracy are discussed. We assess the performance of the proposed method in the context of HUMABIO, an EU Specific Targeted Research Project, where face and gait biometrics are employed in an unobtrusive application scenario for human authentication. Experimental evaluation on a multimodal biometric database demonstrates the validity of the proposed method.

关键词： Multimodal biometrics authentication biometric template security distributed source coding

来源：评论

学校读者我要写书评

暂无评论

Functional Compression Through Graph Coloring

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2010年第8期57卷 3901-3917页

作者： Doshi, Vishal Shah, Devavrat Medard, Muriel Effros, Michelle MIT Informat & Decis Syst Lab Dept EECS Cambridge MA 02139 USA MIT Elect Res Lab Dept EECS Cambridge MA 02139 USA CALTECH Data Compress Lab Pasadena CA 91125 USA

Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly correlated discrete sources such that an arbitrary but fixed deterministic function of those sources can be computed given the compressed data from each source. We consider both the lossless and lossy computation of a function. Specifically, we present results of the rate regions for three instances of the problem where there are two sources: 1) lossless computation where one source is available at the decoder;2) under a special condition, lossless computation where both sources are separately encoded;and 3) lossy computation where one source is available at the decoder. For all of these instances, we present a layered architecture for distributed coding: first preprocess data at each source using colorings of certain characteristic graphs and then use standard distributed source coding (a la Slepian and Wolfs scheme) to compress them. For the first instance, our results extend the approach developed by Orlitsky and Roche (2001) in the sense that our scheme requires simpler structure of coloring rather than independent sets as in the previous case. As an intermediate step to obtain these results, we obtain an asymptotic characterization of conditional graph coloring for an OR product of graphs generalizing a result of Korner (1973), which should be of interest in its own right.

关键词： distributed computing distributed source coding functional compression

来源：评论

学校读者我要写书评

暂无评论

A model-based approach to correlation estimation in wavelet-based distributed source coding with application to hyperspectral imagery

A model-based approach to correlation estimation in wavelet-...

引用

IEEE International Conference on Image Processing (ICIP 2006)

作者： Cheung, Ngai-Man Ortega, Antonio Univ So Calif Inst Signal & Image Proc Dept Elect Engn Los Angeles CA 90089 USA

ISBN: (纸本)9781424404810

In many practical distributed source coding (DSC) applications correlation information has to be obtained at the encoder in order to determine the encoding rate. coding efficiency depends strongly on the accuracy of this correlation estimation, which often has to be performed under rate and complexity constraints. In this paper we focus on correlation estimation for wavelet-based DSC. We extend our previously proposed model-based estimation techniques, which provided accurate estimates of bit-plane level correlation under rate constraints, in the simple case where bit-planes are generated from the binary representation of the sources. To extend the model-based approach to wavelet-based DSC, we need to address two issues. Firstly, in order to improve coding efficiency, bit-planes are typically generated by more sophisticated algorithms in wavelet-based DSC (e.g., by deciding on the bitplane scan order based on coefficient "significance"), which makes model-based estimation more challenging. Secondly, certain wavelet subbands may not have enough coefficients for reliable model estimation, so that model-based techniques alone may not be sufficiently accurate. We propose solutions to these problems and, using a DSC-based hyperspectral image system as example, we demonstrate that model-based estimation can lead to efficient system implementation with lower computational and data exchange requirements, and improved parallelism, while incurring only small degradation in coding efficiency.

关键词： distributed source coding Slepian-Wolf correlation estimation hyperspectral image

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：