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

IEEE Information Theory Workshop (ITW)

作者： Bocharova, Irina E. Kudryashov, Boris D. St Petersburg Univ Informat Technol Mech & Opt Dept Informat Syst St Petersburg 197101 Russia Univ Tartu Inst Comp Sci Tartu Estonia

ISBN: (纸本)9781538669006

In this paper, we study a classical problem of source coding with side information available at the decoder. This problem is known as the Wyner-Ahlswede-Korner (WAK) problem. Nowadays, the interest in this problem is related to the concept of distributed source coding which implies coding of correlated sources under restriction that their encoders cannot cooperate. Most of the practical coding schemes consider a specific case of the binary symmetric source with uniform distribution and side information assumed to be perfectly known to the decoder. In this paper, we concentrate on a more complicated model of the binary source. Moreover, we consider a case when side information is lossy encoded. First we generalize the approach by Gu et al. [1] in order to obtain a lower bound on the achievable rates for a general binary source. Then, a new practical "multi-class" coding scheme for this binary source with uncoded binary side information is suggested. Simulation results for LDPC-based coding for both binary symmetric and general binary sources are presented for scenarios with trellis-coded and uncoded side information, respectively. Comparisons with the previously known numerical results are presented.

关键词： distributed source coding Wyner-AhlswedeKorner problem low-density parity-check codes

来源：评论

学校读者我要写书评

暂无评论

Unified distributed source coding Frames for Interactive Multiview Video Streaming

Unified Distributed Source Coding Frames for Interactive Mul...

引用

IEEE International Conference on Communications (ICC)

作者： Liu, Zhi Cheung, Gene Ji, Yusheng Natl Inst Informat Grad Univ Adv Studies Chiyoda Ku Tokyo 1018430 Japan

ISBN: (纸本)9781457720536

Because of differential coding used in standard video compression algorithms to exploit temporal correlation in adjacent frames for coding gain, a frame lost in network will cause error propagation in subsequent frames at the decoder. Previously proposed distributed source coding (DSC) frames can be periodically inserted to halt this error propagation by overcoming the uncertainty at encoder of which frames will be correctly received at decoder, without resorting to large intra-coded I-frames. In the case of interactive multiview video streaming (IMVS), where a user watches one of M available captured views at a time but can periodically select and switch to a neighboring view, the encoder must encode multiview video to enable this view-switching interactivity without knowing the exact view trajectories taken by viewers at stream time. In this paper, we propose a unified DSC frame construction for IMVS, so that the encoder can overcome both types of uncertainty in a coding-efficient manner;i.e., halt error propagation in differentially coded multiview video and facilitate periodic interactive view-switching at the same time. Having the additional unified DSC frames, we design a multiview frame structure to maximize the expected number of correctly decoded frames at decoder for a given bandwidth constraint. We develop a fast algorithm to find locally optimal structure parameters, and packetization and packet reordering strategies for transmission. Experimental results show that our optimized frame structures using unified DSC frames outperform naive structures using I-and P-frames only by up to 49% in fraction of correctly decoded frames under typical network condition.

关键词： Frame Error propagation ENCODER FRAMES decoders FRAMED STRUCTURES distributed source coding differential coding bandwidth limitation Video streaming Differential scanning calorimetry Interactive

来源：评论

学校读者我要写书评

暂无评论

distributed source coding Using Abelian Group Codes: A New Achievable Rate-Distortion Region

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第3期57卷 1495-1519页

作者： Krithivasan, Dinesh Pradhan, S. Sandeep Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

A distributed source coding problem with a joint distortion criterion that depends on the sources and the reconstruction is considered in this work. While the prevalent trend in information theory has been to prove achievability results using Shannon's random coding arguments, using structured random codes offer rate gains over unstructured random codes for many problems. Motivated by this, a new achievable rate-distortion region (an inner bound to the performance limit) is presented for this problem for discrete memoryless sources based on "good" structured random nested codes built over abelian groups. For certain sources and distortion functions, the new rate region is shown to be strictly bigger than the Berger-Tung rate region, which has been the best known achievable rate region for this problem till now. This is done using numerical plots. Achievable rates for single-user source coding using abelian group codes are also obtained as a corollary of the main coding theorem. It is shown that nested linear codes achieve the Shannon rate-distortion function in the arbitrary discrete memoryless case.

关键词： distributed source coding structured code ensembles nested linear codes group codes abelian groups

来源：评论

学校读者我要写书评

暂无评论

Image authentication using distributed arithmetic coding

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2018年第12期77卷 15505-15520页

作者： Zhou, Junwei Liu, Fang Cheng, Lee-Ming Wuhan Univ Technol Sch Comp Sci & Technol Wuhan Hubei Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China

Image authentication using distributed arithmetic coding (DAC) is studied in this paper. The quantized random projections of the original image are compressed by a DAC encoder and the codeword is taken as the authentication data. With the help of a target image as side information, the DAC decoder could recover the projections. The authentication process is achieved by examining the Euclidean distance between the reconstructed projections and the side information. Compared with existing approaches, the proposed approach has a simpler structure without the help of an additional cryptographic hash function to verify the decoding result. Moreover, the authentication data is more compact with fewer size. Simulation results justify that the proposed approach achieves a comparable performance as existing schemes.

关键词： Security distributed arithmetic coding Image authentication distributed source coding

来源：评论

学校读者我要写书评

暂无评论

On distributed source coding Using Abelian Group Codes

On Distributed Source Coding Using Abelian Group Codes

引用

Annual Allerton Conference on Communication, Control, and Computing

作者： Aria G. Sahebi S. Sandeep Pradhan Department of Electrical Engineering and Computer Science University of Michigan

ISBN: (纸本)9781467345378

In this paper, we consider the distributed source coding problem with a joint distortion criterion. We use random structured codes, specifically nested Abelian group codes to achieve a new inner bound to the rate-distortion region. This new inner bound unifies all other known results on the distributed source coding problem and for certain sources, this inner bound is strictly larger than other known rate regions. Furthermore, we define the notion of "nested random/group codes" in which the inner code is a group code and the outer code is a random code such that the quantization operation is a random vector quantization and the binning operation is correlated. We use random/group codes to improve upon the rate region achieved using nested group codes. We define two fundamental quantities of Abelian group codes: the "channel coding group entropy" and the "source coding group entropy" to present the achievable rate region.

关键词： distributed source coding Abelian group Codes random codes achievable rate region Vector quantization

来源：评论

学校读者我要写书评

暂无评论

Joint Decoding and Estimation of S patio-Temporally Correlated Binary sources

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2018年第7期67卷 6690-6694页

作者： Izbar, Mohd Azri Mohd Aljohani, Abdullah Jeza Ng, Soon Xin Hanzo, Lajos Univ Teknol Malaysia Razak Sch Engn & Adv Technol Wireless Commun Ctr Kuala Lumpur 54100 Malaysia Univ Teknol Malaysia Razak Sch Engn & Adv Technol U BAN Grp Kuala Lumpur 54100 Malaysia Umm Alqura Univ Mecca Saudi Arabia Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England

In the context of distributed joint source-channel coding, we conceive a joint decoding and estimation scheme for binary Markov sources exhibiting spatio-temporal correlation. The proposed scheme is designed based on the serial concatenation of a trellis coded modulation (TCM) scheme and a unity-rate code. The symbol-based maximum a posteriori algorithm employed for TCM. decoding is modified in order to exploit the source correlation. The estimation of both the spatial and temporal correlation parameters is performed jointly with the iterative decoding, hence allowing the estimated parameters to he updated after each iteration. Our simulation results reveal that when both the spatial and temporal correlation parameters are unknown, the proposed joint decoding and estimation scheme approaches the performance to the ideal system relying on perfectly known correlation parameters, therefore, demonstrating the superiority of the proposed scheme.

关键词： Joint source-channel coding distributed source coding joint decoding and estimation

来源：评论

学校读者我要写书评

暂无评论

distributed source coding FOR SECURING A HAND-BASED BIOMETRIC RECOGNITION SYSTEM

DISTRIBUTED SOURCE CODING FOR SECURING A HAND-BASED BIOMETRI...

引用

18th IEEE International Conference on Image Processing (ICIP)

作者： Ramalho, Mauricio Correia, Paulo Soares, Luis Ducla Inst Telecomunicacoes P-1049001 Lisbon Portugal

ISBN: (纸本)9781457713033

distributed source coding (DSC) is typically used to compress information from multiple correlated sources that do not communicate with each other. In this paper, DSC principles are used to secure biometric data in a multimodal hand-based recognition system, introducing a novel approach for Log-Likelihood Ratio initialization and a new binarization technique. The proposed biometric recognition system relies on a new architecture using three hand-based biometric traits: palmprint, finger surface and hand geometry, being the latter used as a soft biometric to accelerate the identification process. Promising results are achieved in terms of recognition accuracy, speed and security when performing identification on large databases, like the UST Hand Image Database.

关键词： secure biometrics distributed source coding biometric template protection LDPC multimodal biometric system

来源：评论

学校读者我要写书评

暂无评论

distributed Lossy source coding Using Real-Number Codes

Distributed Lossy Source Coding Using Real-Number Codes

引用

76th IEEE Vehicular Technology Conference (VTC Fall)

作者： Vaezi, Mojtaba Labeau, Fabrice McGill Univ Dept Elect & Comp Engn Montreal PQ H3A 2A7 Canada

ISBN: (纸本)9781467318792

We show how real-number codes can be used to compress correlated sources, and establish a new framework for distributed lossy source coding, in which we quantize compressed sources instead of compressing quantized sources. This change in the order of binning and quantization blocks makes it possible to model correlation between continuous-valued sources more realistically and correct quantization error when the sources are completely correlated. The encoding and decoding procedures are described in detail, for discrete Fourier transform (DFT) codes. Reconstructed signal, in the mean-squared error sense, is seen to be better than or close to quantization error level in the conventional approach.

关键词： distributed source coding real-number codes BCH-DFT codes channel coding Wyner-Ziv coding

来源：评论

学校读者我要写书评

暂无评论

Minimum Cost distributed source coding Over a Network

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第1期57卷 461-475页

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

This paper considers the problem of transmitting multiple compressible sources over a network at minimum cost. The aim is to find the optimal rates at which the sources should be compressed and the network flows using which they should be transmitted so that the cost of the transmission is minimal. We consider networks with capacity constraints and linear cost functions. The problem is complicated by the fact that the description of the feasible rate region of distributed source coding problems typically has a number of constraints that is exponential in the number of sources. This renders general purpose solvers inefficient. We present a framework in which these problems can be solved efficiently by exploiting the structure of the feasible rate regions coupled with dual decomposition and optimization techniques such as the subgradient method and the proximal bundle method.

关键词： Convex optimization distributed source coding dual decomposition minimum cost network flow network coding

来源：评论

学校读者我要写书评

暂无评论

Some Results on distributed source coding for Interactive Function Computation

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第9期57卷 6180-6195页

作者： Ma, Nan Ishwar, Prakash Boston Univ Dept Elect & Comp Engn Boston MA 02215 USA

A two-terminal interactive distributed source coding problem with alternating messages for function computation at both locations is studied. For any number of messages, a computable characterization of the rate region is provided in terms of single-letter information measures. While interaction is useless in terms of the minimum sum-rate for lossless source reproduction at one or both locations, the gains can be arbitrarily large for function computation even when the sources are independent. For a class of sources and functions, interaction is shown to be useless, even with infinite messages, when a function has to be computed at only one location, but is shown to be useful, if functions have to be computed at both locations. For computing the Boolean AND function of two independent Bernoulli sources at both locations, an achievable infinite-message sum-rate with infinitesimal-rate messages is derived in terms of a 2-D definite integral and a rate-allocation curve. The benefit of interaction is highlighted in multiterminal function computation problem through examples. For networks with a star topology, multiple rounds of interactive coding is shown to decrease the scaling law of the total network rate by an order of magnitude as the network grows.

关键词： distributed source coding function computation interactive coding rate-distortion region Slepian-Wolf coding two-way coding Wyner-Ziv coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：