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

32nd IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Yahampath, Pradeepa Univ Manitoba Dept Elect & Comp Engn Winnipeg MB R3T 5V6 Canada

ISBN: (纸本)1424407281

This paper investigates the design of a system of predictive vector quantizers for distributed sources with memory, in which linear prediction is used to exploit the source memory, while distributed quantization is used to exploit the correlation between sources. A training-based algorithm is proposed for jointly designing the predictors, binning functions, and reconstruction codebooks of the given system to match the intra and inter-source correlations. In order to demonstrate the effectiveness of the algorithm, experimental results obtained by designing both scalar and vector quantizers for a set of distributed Gauss-Markov sources are presented. While the optimality of these designs is unknown, it is shown that they convincingly outperform several other alternatives.

关键词： distributed source coding vector quantization predictive coding

来源：评论

学校读者我要写书评

暂无评论

An efficient predictive coding of integers with real-domain predictions using distributed source coding techniques

引用

13th International Multimedia Modeling Conference (MMM 2007)

作者： Ali, Mortuza Murshed, Manzur Monash Univ Gippsland Sch Informat Technol Churchill Vic 3842 Australia

ISBN: (纸本)9783540694212

By exploiting the commonly observed Laplacian probability distribution of audio, image, and video prediction residuals, many researchers proposed low complexity prefix codes to compress integer residual data. All these techniques treated predictions as integers despite being drawn from the real domain in lossless compression. Among these, Golomb coding is widely used for being optimal with non-negative integers that follow geometric distribution, a two-sided extension of which is the discrete analogue of Laplacian distribution. This paper for the first time presents a novel predictive codec which treats real-domain predictions without rounding to the nearest integers and thus avoids any coding loss due to rounding. The proposed codec innovatively uses the concept of distributed source coding by replacing the reminder part of Golomb code with the index of the coset containing the actual value.

关键词： predictive coding prediction residual lossless coding Laplacian distribution distributed source coding and coset

来源：评论

学校读者我要写书评

暂无评论

Variable-rate distributed source coding in the presence of Byzantine sensors

Variable-rate distributed source coding in the presence of B...

引用

IEEE International Symposium on Information Theory

作者： Kosut, Oliver Tong, Lang Cornell Univ Sch Elect & Comp Engn Ithaca NY 14853 USA

ISBN: (纸本)9781424413973

The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack;that is, an unknown number of sensors have been reprogrammed by a malicious intruder to undermine the reconstruction at the fusion center. Three different forms of the problem are considered. The first is a variable-rate setup, in which the decoder adaptively chooses the rates at which the sensors transmit. An explicit characterization of the variable-rate minimum achievable sum rate is stated, given by the maximum entropy over the set of distributions indistinguishable from the true source distribution by the decoder. In addition, two forms of the fixed-rate problem are considered, one with deterministic coding and one with randomized coding. The achievable rate regions are given for both these problems, with a larger region achievable using randomized coding, though both are suboptimal compared to variable-rate coding.

关键词： distributed source coding Byzantine attack sensor fusion network security

来源：评论

学校读者我要写书评

暂无评论

distributed Scalar Quantization for Computing: High-Resolution Analysis and Extensions

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第8期57卷 5298-5325页

作者： Misra, Vinith Goyal, Vivek K. Varshney, Lav R. MIT Dept Elect Engn & Comp Sci Elect Res Lab Cambridge MA 02139 USA MIT Lab Informat & Decis Syst Cambridge MA 02139 USA

Communication of quantized information is frequently followed by a computation. We consider situations of distributed functional scalar quantization: distributed scalar quantization of (possibly correlated) sources followed by centralized computation of a function. Under smoothness conditions on the sources and function, companding scalar quantizer designs are developed to minimize mean-squared error (MSE) of the computed function as the quantizer resolution is allowed to grow. Striking improvements over quantizers designed without consideration of the function are possible and are larger in the entropy-constrained setting than in the fixed-rate setting. As extensions to the basic analysis, we characterize a large class of functions for which regular quantization suffices, consider certain functions for which asymptotic optimality is achieved without arbitrarily fine quantization, and allow limited collaboration between source encoders. In the entropy-constrained setting, a single bit per sample communicated between encoders can have an arbitrarily large effect on functional distortion. In contrast, such communication has very little effect in the fixed-rate setting.

关键词： Asymptotic quantization theory distributed source coding optimal point density function rate-distortion theory

来源：评论

学校读者我要写书评

暂无评论

Centralized and distributed Semiparametric Compression of Piecewise Smooth Functions

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2011年第7期59卷 3071-3085页

作者： Chaisinthop, Varit Dragotti, Pier Luigi Univ London Imperial Coll Sci Technol & Med Dept Elect & Elect Engn Commun & Signal Proc Grp London SW7 2AZ England

This paper introduces novel wavelet-based semi-parametric centralized and distributed compression methods for a class of 1-D piecewise smooth functions. Classical centralized compression schemes are based on a relatively complex, nonlinear encoder and a simple, linear decoder. Recently, a new paradigm in compression called distributed source coding has emerged. This setup involves multiple encoders, where each one partially observes the source, and a centralized decoder. First, we focus on the dual situation of the centralized compression with a simple encoder and a complex decoder. We show that, by incorporating parametric estimation into the decoding procedure, it is possible to achieve the same rate-distortion performance as that of a conventional wavelet-based compression scheme. Second, we consider the distributed compression scenario, where each independent encoder partially observes the 1-D piecewise smooth function. We propose a new wavelet-based distributed compression scheme that uses parametric estimation to perform joint decoding. Our analysis shows that it is possible for the proposed scheme to achieve the same compression performance as that of a joint encoding scheme.

关键词： Approximations compression distributed source coding parametric estimation piecewise smooth functions wavelets

来源：评论

学校读者我要写书评

暂无评论

Robust Communication via Decentralized Processing With Unreliable Backhaul Links

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第7期57卷 4187-4201页

作者： Simeone, Osvaldo Somekh, Oren Erkip, Elza Poor, H. Vincent Shamai (Shitz), Shlomo New Jersey Inst Technol CWCSPR Newark NJ 07102 USA Princeton Univ Dept Elect Engn Princeton NJ 08544 USA Polytech Inst New York Univ Dept ECE Brooklyn NY 11201 USA Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

A source communicates with a remote destination via a number of distributed relays. Communication from source to relays takes place over a (discrete or Gaussian) broadcast channel, while the relays are connected to the receiver via orthogonal finite-capacity links. Unbeknownst to the source and relays, link failures may occur between any subset of relays and the destination in a nonergodic fashion. Upper and lower bounds are derived on average achievable rates with respect to the prior distribution of the link failures, assuming the relays to be oblivious to the source code-book. The lower bounds are obtained by proposing strategies that combine the broadcast coding approach, previously investigated for quasi-static fading channels, and different robust distributed compression techniques. Numerical results show that lower and upper bounds are quite close over most operating regimes, and provide insight into optimal transmission design choices for the scenario at hand. Extension to the case of nonoblivious relays is also discussed.

关键词： Broadcast coding distributed source coding erasure channel relay channel robust channel coding

来源：评论

学校读者我要写书评

暂无评论

Linear Interactive Encoding and Decoding for Lossless source coding With Decoder Only Side Information

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第8期57卷 5281-5297页

作者： Meng, Jin Yang, En-Hui He, Da-Ke Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada Res In Mot SlipStream Waterloo ON N2L 5Z5 Canada

Linear interactive encoding and decoding (IED) for near lossless source coding with decoder only side information is considered, where the interactive encoder uses linear codes (described by parity-check matrices over a finite field chi) for encoding. It is first demonstrated how to convert any classical universal lossless code C(n) (with block length n and with side information available to both the encoder and decoder) into a universal random linear IED scheme based on Gallager's parity check ensemble. It is then shown that there is no performance loss by restricting IED to linear IED, and that the universal random linear IED scheme based on Gallager's parity check ensemble achieves essentially the same rate performance as does C(n) for each and every individual sequence pair (x(n), y(n)) while the word decoding error probability goes to 0 as n --> infinity. Define the density of a linear IED scheme as the percentage of nonzero entries in its parity-check matrix. To reduce the encoding complexity of linear IED, low density linear IED is further investigated in terms of the trade-off among its rate, decoding error probability, and density.

关键词： distributed source coding entropy and conditional entropy individual sequences interactive encoding and decoding parity-check matrix Slepian-Wolf coding stationary and ergodic sources

来源：评论

学校读者我要写书评

暂无评论

On the Rate Loss of Multiple sources Codes in the Wyner-Ziv Setting

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第3期57卷 1457-1465页

作者： Lu, Jian Wang, Qiao SE Univ Dept Radio Engn Sch Informat Sci & Engn Nanjing 210096 Peoples R China

In this paper, we consider the rate loss and achievable region of multiple sources codes (also named multiterminal source codes) in the Wyner-Ziv setting (WZ-MSC), in which two stationary memoryless sources (X, Y) are compressed separately from each other at respective rates and R-1 and R-2, and the joint decoder, having access to the side information S which is correlated with sources (X, Y), reconstructs X and Y with distortion and D-1 and D-2, respectively. We define the rate loss L-1 = R-1 - R-X vertical bar Y,R- S (D-1), L-2 = R-2 - R-Y vertical bar X,R- S (D-2) and L-0 = R-1 + R-2 - R-X,R-Y vertical bar S(D-1, D-2). For general real-valued stationary memoryless sources and mean squared error distortion measure, we show that the rate loss can be bounded by L-i <= K-i + 1,i = 1, 2, and L-0 <= 1, where K-1 = R-X,R-Y vertical bar(S)(D-1, D-2) - R-Y vertical bar S(D-1) - R-X vertical bar Y,R-S(D-1) and K-2 = R-X,R-Y vertical bar(S)(D-1, D-2) - R-X vertical bar S(D-1) - R-Y vertical bar X,R-S(D-2). When the sources and side information have a jointly Gaussian distribution, we give upper bounds of K-1 and K-2 by a function of conditional correlation coefficient rho(XY vertical bar S). For a special case when there is no side information, our result tightens Feng's rate loss bounds. Using our upper bounds of the rate loss, we give good approximations of the achievable region.

关键词： distributed source coding multiple sources multiterminal source code rate loss rate-distortion function side information Wyner-Ziv problem

来源：评论

学校读者我要写书评

暂无评论

coding of Image Feature Descriptors for distributed Rate-efficient Visual Correspondences

引用

INTERNATIONAL JOURNAL OF COMPUTER VISION 2011年第3期94卷 267-281页

作者： Yeo, Chuohao Ahammad, Parvez Ramchandran, Kannan Inst Infocomm Res Signal Proc Dept Singapore 118936 Singapore Howard Hughes Med Inst Ashburn VA 20147 USA Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

Establishing visual correspondences is a critical step in many computer vision tasks involving multiple views of a scene. In a dynamic environment and when cameras are mobile, visual correspondences need to be updated on a recurring basis. At the same time, the use of wireless links between camera motes imposes tight rate constraints. This combination of issues motivates us to consider the problem of establishing visual correspondences in a distributed fashion between cameras operating under rate constraints. We propose a solution based on constructing distance preserving hashes using binarized random projections. By exploiting the fact that descriptors of regions in correspondence are highly correlated, we propose a novel use of distributed source coding via linear codes on the binary hashes to more efficiently exchange feature descriptors for establishing correspondences across multiple camera views. A systematic approach is used to evaluate rate vs visual correspondences retrieval performance;under a stringent matching criterion, our proposed methods demonstrate superior performance to a baseline scheme employing transform coding of descriptors.

关键词： distributed source coding Camera calibration Camera networks Visual correspondences distributed feature matching

来源：评论

学校读者我要写书评

暂无评论

Wyner-Ziv Video coding With Classified Correlation Noise Estimation and Key Frame coding Mode Selection

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2011年第9期20卷 2463-2474页

作者： Esmaili, Ghazaleh Rais Cosman, Pamela C. Univ Calif San Diego Dept Elect & Comp Engn San Diego CA 92093 USA

We improve the overall rate-distortion performance of distributed video coding by efficient techniques of correlation noise estimation and key frame encoding. In existing transform-domain Wyner-Ziv video coding methods, blocks within a frame are treated uniformly to estimate the correlation noise even though the success of generating side information is different for each block. We propose a method to estimate the correlation noise by differentiating blocks within a frame based on the accuracy of the side information. Simulation results show up to 2 dB improvement over conventional methods without increasing encoder complexity. Also, in traditional Wyner-Ziv video coding, the intercorrelation of key frames is not exploited since they are simply intracoded. In this paper, we propose a frequency band coding mode selection for key frames to exploit similarities between adjacent key frames at the decoder. Simulation results show significant improvement especially for low-motion and high frame rate sequences. Furthermore, the advantage of applying both schemes in a hierarchical order is investigated. This method achieves additional improvement.

关键词： Correlation channel distributed source coding key frame encoding Wyner-Ziv coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：