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

16th Canadian Workshop on Information Theory (CWIT)

作者： Elzouki, Dania Dumitrescu, Sorina Chen, Jun McMaster Univ Dept Elect & Comp Engn Hamilton ON Canada

ISBN: (纸本)9781728109541

In this paper, we propose a lattice-based robust distributed source coding system for three correlated sources and provide a detailed performance analysis under the high resolution assumption. The analysis implies, among other things, that for the degenerate case where the three sources are identical Gaussian, the performance of our scheme is close to the information theoretic limit of quadratic symmetric Gaussian multiple description coding with central and individual decoders, when the side distortion and the ratio between the central and side distortions both approach 0. Specifically, our scheme can achieve within an asymptotic gap of 0.069 bits from the theoretical limit in terms of rate per description.

关键词： distributed source coding lattice quantization high resolution analysis

来源：评论

学校读者我要写书评

暂无评论

Tradeoff between compression ratio and decoding delay of distributed source coding for uplink transmissions in machine-type communication

引用

INTERNATIONAL JOURNAL OF distributed SENSOR NETWORKS 2018年第7期14卷

作者： Wang, Wen Zhu, Jinkang Zhang, Sihai Zhou, Wuyang Univ Sci & Technol China Chinese Acad Sci Key Lab Wireless Opt Commun Hefei 230017 Anhui Peoples R China Univ Sci & Technol China Dept Elect Engn & Informat Sci Personal Commun & Spread Spectrum Lab Hefei Anhui Peoples R China

Rapid growth of machine-type communications devices challenges the future network with a significant aggregated data traffic. distributed source coding is a promising technique that compresses data sources and decreases required aggregated data transmission rate. In this article, we discuss the merits and demerits of deploying distributed source coding in machine-type communications uplink transmissions. We analyze how the decoding delay and storage consumption scale with the number of users and prove that the average decoding delay grows linearly with the user number under some assumptions. A machine-type communications uplink transmission scheme adopting clustered distributed source coding is proposed to balance the compression ratio and decoding delay of distributed source coding where users are divided into independently encoded and decoded clusters. We evaluate three clustering algorithms, grid dividing, Weighted Pair Group Method with Arithmetic Mean, and K-medoids in our system model. The grid dividing algorithm clusters users based on their locations, while Weighted Pair Group Method with Arithmetic Mean and K-medoids cluster users using the correlation intensity between them. Our simulation results show that Weighted Pair Group Method with Arithmetic Mean and K-medoids outperform grid dividing on compression ratio and K-medoids and grid dividing have a more balanced delay distribution among different clusters than Weighted Pair Group Method with Arithmetic Mean.

关键词： distributed source coding machine-type communication uplink transmission clustering K-medoids Weighted Pair Group Method with Arithmetic Mean

来源：评论

学校读者我要写书评

暂无评论

distributed Joint source coding and Trellis Coded Modulation for Symbol-Based Markov sources

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2018年第5期67卷 4031-4041页

作者： Izhar, Mohd Azri Mohd Aljohani, Abdulah Jeza Ng, Soon Xin Hanzo, Lajos Univ Teknol Malaysia UTM Razak Sch Engn & Adv Technol Wireless Commun Ctr Kuala Lumpur 54100 Malaysia Univ Teknol Malaysia UTM Razak Sch Engn & Adv Technol Ubiquitous Broadband Access Network Grp Kuala Lumpur 54100 Malaysia Umm Alqura Univ Engn Fac Elect Engn Dept Mecca 21955 Saudi Arabia Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England

A distributed joint source-channel coding scheme based on a unity-rate code (URC) assisted trellis coded modulation (TCM) is proposed, which exploits the spatiotemporal correlation of symbol-based sources. More specifically, asymmetric distributed source coding of two spatially correlated Markov sources is considered, where one of the sources is assumed to be perfectly decoded and to be available at the receiver of the other source as side information. In order to exploit the temporal correlation statistics, an iterative decoding process exchanging extrinsic information between the amalgamated URC-assisted TCM and a soft-symbol source decoder employing a modified symbol-based maximum a posteriori algorithm is invoked. Furthermore, the Slepian-Wolf (SW) bound of symbol-based sources having spatiotemporal correlation is derived and the benefits of exploiting the spatiotemporal correlation using the proposed coding scheme are demonstrated by our extrinsic information transfer chart analysis. It is shown from our simulation results that upon exploiting the spatiotemporal correlation of the sources, the proposed coding scheme is capable of operating within 0.02 b of the SW bound.

关键词： Joint source-channel coding distributed source coding distributed source-channel coding coded modulation iterative decoding Slepian-Wolf coding

来源：评论

学校读者我要写书评

暂无评论

distributed source coding and Its Applications in Relaying-Based Transmission

引用

IEEE ACCESS 2016年 4卷 1940-1970页

作者： Aljohani, Abdulah Jeza Ng, Soon Xin Hanzo, Lajos Univ Southampton Southampton SO17 1BJ Hants England Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England

distributed source coding (DSC) schemes rely on separate encoding but joint decoding of statistically dependent sources, which exhibit correlation. DSC has numerous promising applications ranging from reduced-complexity handheld video communications to onboard hyperspectral image coding under computational limitations. The concept of separate encoding at the first sight compromises the attainable encoding performance. However, the DSC theory proves that independent encoding can in fact be designed as efficiently as joint encoding, as long as joint decoding is allowed. More specifically, distributed joint source-channel coding (DJSC) is associated with the scenario, where the correlated source signals are transmitted through a noisy channel. In this paper, we present a concise historic background of DSC concerning both its theory and its practical aspects. In addition, a series of turbo trellis-coded modulation (TTCM)-aided DJSC-based cooperative transmission schemes are proposed. DJSC scheme is conceived for the transmission of a pair of correlated sources to a destination node (DN). The first source sequence is TTCM encoded, and then, it is compressed before it is transmitted both over a Rayleigh fading channel, where the second source signal is assumed to be perfectly decoded side-information at the DN for the sake of improving the achievable decoding performance of the first source. The proposed scheme is capable of performing reliable communications for various levels of correlation near to the theoretical Slepian-Wolf/Shannon (SW/S) limit. Pursuing our objective of designing practical DJSC schemes, we further extended the above-mentioned arrangement to a more realistic cooperative communication system, where the pair of correlated sources are transmitted to a DN with the aid of a relay node (RN). Explicitly, the pair of correlated source sequences are TTCM encoded and compressed before transmission over a Rayleigh fading multiple access channel, where our propo

关键词： distributed joint source coding distributed source coding Slepian-Wolf coding joint source-channel decoding TTCM superposition modulation

来源：评论

学校读者我要写书评

暂无评论

Wave atom transform based image hashing using distributed source coding

引用

JOURNAL OF INFORMATION SECURITY AND APPLICATIONS 2016年 31卷 75-82页

作者： Yang, Yanchao Zhou, Junwei Duan, Feipeng Liu, Fang Cheng, Lee-Ming Wuhan Univ Technol Sch Comp Sci & Technol Hubei Key Lab Transportat Internet Things Wuhan Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China

To reduce the size of hash code and enhance the security of wave atom transform (WAT) based image authentication system, a low-density parity-check code based distributed source coding (DSC) is employed to compress the hash code. With the help of a legitimately modified image, the compressed hash value could be correctly decoded while it will fail with the help of a maliciously attacked image. Therefore, the employed DSC provides a desired robustness to image authentication. Simulation results indicate that the proposed scheme provides a better performance with less hash code than existing WAT based image hash without using DSC. Moreover, the proposed scheme outperforms the random projection based approach in terms of authentication accuracy and data size. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Perceptual hashing Image authentication distributed source coding Wave atom transform

来源：评论

学校读者我要写书评

暂无评论

Skip block based distributed source coding for hyperspectral image compression

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2016年第18期75卷 11267-11289页

作者： Banu, Masoodhu N. M. Sujatha, S. Pathan, Al-Sakib Khan Sethu Inst Technol Dept Elect & Commun Engn Virudunagar India Anna Univ Reg Engn Coll Dept Comp Applicat Tiruchirappalli India Int Islamic Univ Malaysia Dept Comp Sci Kuala Lumpur Malaysia

Due to the involvement of massive amount of information in processing and transmission operations, reduction of encoder complexity is a key requirement for lossy compression methods of hyperspectral images. distributed source coding (DSC) is the enabling technology which reverses the encoder-decoder complexity and provides error resilience. In this work, for complexity reduction, the adaptability of block based design to spatially varying characteristics is exploited and combined with DSC. Blocks of size 8x8 with Mean Absolute Error (MeanAE) less than 3.0 and Maximum Absolute Error (MaxAE) less than 4 are identified and skipped from coding, and the remaining portion has been 2D (2-Dimensional) DCT (Discrete Cosine Transform)/SPIHT (Set Partitioning in Hierarchical Trees) coded. Skip block based DSC scheme results in variable source statistics and this is handled with rate adaptive Low Density Parity Check (LDPC) codes. This new block based algorithm, together with rate adaptive codes results in better compression with reduced coding complexity. Our experimental results show that skip block based DSC coded scheme, in addition to being very flexible, retains all the desirable features of compared well-known algorithms. This is also highly competitive to 3D-SPIHT, and better than 2D SPIHT both in terms of compression efficiency and classification.

关键词： distributed source coding Entropy Hyperspectral Rate Spectral Syndrome Wavelet

来源：评论

学校读者我要写书评

暂无评论

MULTI-VIEW distributed source coding OF BINARY FEATURES FOR VISUAL SENSOR NETWORKS 41

MULTI-VIEW DISTRIBUTED SOURCE CODING OF BINARY FEATURES FOR ...

引用

41st IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

作者： Monteiro, Nuno Brites, Catarina Pereira, Fernando Ascenso, Joao Inst Super Tecn Inst Telecomunicacoes Lisbon Portugal

ISBN: (纸本)9781479999880

Visual analysis algorithms have been mostly developed for a centralized scenario where all visual data is acquired and processed at a central location. However, in visual sensor networks (VSN), several constraints in computational power, energy and bandwidth require a radically different approach, notably a paradigm shift from centralized to distributed visual processing. In the new paradigm, visual data is acquired and features are extracted at the sensing nodes locations to be after transmitted to enable further analysis at some central location. In such scenario, one of the key challenges is to design suitable feature coding schemes that are able to exploit the correlation among the features corresponding to (partially) overlapped views of the same visual scene. To achieve efficient coding, it is proposed to employ the distributed source coding paradigm as it does not require any communication between the sensing nodes (rather expensive in VSN) and it is parsimonious in terms of computational resources. Experimental results show that significant accuracy and compression gains (up to 37.36%) can be achieved when coding features extracted from multiple views.

关键词： distributed source coding feature coding multi-view coding visual sensor networks

来源：评论

学校读者我要写书评

暂无评论

A distributed Privacy-Utility Tradeoff Method Using distributed Lossy source coding with Side Information

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2017年第5期11卷 2778-2791页

作者： Gu, Yonghao Wang, Yongfei Yang, Zhen Gao, Yimu Beijing Univ Posts & Telecommun Sch Comp Sci Beijing Key Lab Intelligent Telecommun Software & Beijing 100876 Peoples R China Univ Delaware Dept Comp & Informat Sci Newark DE 19716 USA

In the age of big data, distributed data providers need to ensure the privacy, while data analysts need to mine the value of data. Therefore, how to find the privacy-utility tradeoff has become a research hotspot. Besides, the adversary may have the background knowledge of the data source. Therefore, it is significant to solve the privacy-utility tradeoff problem in the distributed environment with side information. This paper proposes a distributed privacy-utility tradeoff method using distributed lossy source coding with side information, and quantitatively gives the privacy-utility tradeoff region and Rate-Distortion-Leakage region. Four results are shown in the simulation analysis. The first result is that both the source rate and the privacy leakage decrease with the increase of source distortion. The second result is that the finer relevance between the public data and private data of source, the finer perturbation of source needed to get the same privacy protection. The third result is that the greater the variance of the data source, the slighter distortion is chosen to ensure more data utility. The fourth result is that under the same privacy restriction, the slighter the variance of the side information, the less distortion of data source is chosen to ensure more data utility. Finally, the provided method is compared with current ones from five aspects to show the advantage of our method.

关键词： Privacy-utility tradeoff rate distortion distributed source coding side information

来源：评论

学校读者我要写书评

暂无评论

Loss less and near-lossless compression of hyperspectral images based on distributed source coding

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2015年 28卷 113-119页

作者： Nian, Yongjian He, Mi Wan, Jianwei Third Mil Med Univ Sch Biomed Engn Chongqing 400038 Peoples R China Natl Univ Def Technol Coll Elect Sci & Engn Changsha 410073 Hunan Peoples R China

This paper addresses the problem of the lossless and near-lossless compression of hyperspectral images and presents two efficient algorithms based on distributed source coding, which perform the lossless compression by means of multilevel scalar codes. The proposed algorithms are implemented on the co-located blocks in the spectral orientation. A novel multiband spectral predictor is proposed to construct the side information of each block. The back-up side information is introduced for the second algorithm to recover the images when the original side information is corrupted by errors. The encoder only requires the transmission of the least significant bit (LSB) bit-planes to the decoder, and the number of bits is computed by the maximum error between the block and its side information. The proposed algorithms are also extended to near-lossless compression. The experimental results show that the proposed algorithms have a competitive compression performance with the existing distributed compression algorithms. Moreover, the proposed algorithms can provide low complexity and different degrees of error resilience, which is suitable for onboard compression. (C) 2014 Elsevier Inc. All rights reserved.

关键词： Hyperspectral images Lossless compression Near-lossless compression distributed source coding Error resilience Low complexity Peak error Linear prediction

来源：评论

学校读者我要写书评

暂无评论

A joint resource allocation-channel coding design based on distributed source coding

引用

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2015年第2期15卷 389-400页

作者： Khoshroo, Sasan Wang, Honggang Xing, Liudong Kasilingam, Dayalan Univ Massachusetts Dartmouth Dept Elect & Comp Engn N Dartmouth MA 02747 USA

Wireless sensor networks (WSNs) have found a wide variety of applications recently. However, the challenges in WSNs still remain in improving the sensor energy efficiency and information quality (distortion reduction) of the sensing data transmissions. In this paper, we propose a novel cross-layer design of resource allocation and channel coding to protect distributed source coding (DSC)-based data transmission. Resource allocation strategies include rate adaptation and automatic repeat-request retransmissions. Our proposed joint design of resource allocation, channel coding, and DSC can improve the network energy efficiency and information quality while meeting the data transmission latency requirements. Further, we investigate how the resource allocation enables the network to achieve unequal error protection among correlated DSC streams. Our simulation studies demonstrate that the proposed joint design significantly improves the DSC-based data transmission quality and the network energy efficiency. Copyright (c) 2013 John Wiley & Sons, Ltd.

关键词： channel coding cross-layer optimization distributed source coding energy efficiency information efficiency wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：