Distributed transform coding via source-splitting

被引:0
作者
Yahampath, Pradeepa [1 ]
机构
[1] Univ Manitoba, Dept Elect & Comp Engn, Winnipeg, MB R3T 5V6, Canada
来源
EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING | 2012年
关键词
distributed transform coding; Wyner-Ziv quantization; multi-terminal quantization; Karhunen-Loeve transform (KLT); optimal bit-allocation; INFORMATION;
D O I
10.1186/1687-6180-2012-78
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Transform coding (TC) is one of the best known practical methods for quantizing high-dimensional vectors. In this article, a practical approach to distributed TC of jointly Gaussian vectors is presented. This approach, referred to as source-split distributed transform coding (SP-DTC), can be used to easily implement two terminal transform codes for any given rate-pair. The main idea is to apply source-splitting using orthogonal-transforms, so that only Wyner-Ziv (WZ) quantizers are required for compression of transform coefficients. This approach however requires optimizing the bit allocation among dependent sets of WZ quantizers. In order to solve this problem, a low-complexity tree-search algorithm based on analytical models for transform coefficient quantization is developed. A rate-distortion (RD) analysis of SP-DTCs for jointly Gaussian sources is presented, which indicates that these codes can significantly outperform the practical alternative of independent TC of each source, whenever there is a strong correlation between the sources. For practical implementation of SP-DTCs, the idea of using conditional entropy constrained (CEC) quantizers followed by Slepian-Wolf coding is explored. Experimental results obtained with SP-DTC designs based on both CEC scalar quantizers and CEC trellis-coded quantizers demonstrate that actual implementations of SP-DTCs can achieve RD performance close to the analytically predicted limits.
引用
收藏
页数:15
相关论文
共 50 条
  • [21] Uniform Distributed Source Coding for the Multiple Access Wiretap Channel
    Chou, Remi A.
    Bloch, Matthieu R.
    2014 IEEE CONFERENCE ON COMMUNICATIONS AND NETWORK SECURITY (CNS), 2014, : 127 - 132
  • [22] Distributed source coding using chaos-based cryptosystem
    Zhou, Junwei
    Wong, Kwok-Wo
    Chen, Jianyong
    COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2012, 17 (12) : 5110 - 5116
  • [23] A Content-Aware Quantisation Mechanism for Transform Domain Distributed Video Coding
    Mahmood, Asif
    Dooley, Laurence S.
    Wong, Patrick
    PROCEEDINGS 2017 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND COMPUTATIONAL INTELLIGENCE (CSCI), 2017, : 547 - 553
  • [24] Unidirectional Encoder Rate Control Scheme for Transform Domain Distributed Video Coding
    Kumar, Vijay
    Sengupta, Somnath
    2012 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO WORKSHOPS (ICMEW), 2012, : 89 - 94
  • [25] A distributed coding approach for stereo sequences in the Tree Structured Haar Transform domain
    Cancellaro, M.
    Carli, M.
    Neri, A.
    IMAGE PROCESSING: ALGORITHMS AND SYSTEMS VII, 2009, 7245
  • [26] Distributed Joint Source-Channel Coding-Based Adaptive Dynamic Network Coding
    Aljohani, Abdulah Jeza
    Ng, Soon Xin
    IEEE ACCESS, 2020, 8 : 86715 - 86731
  • [27] Near lossless compression of hyperspectral images based on distributed source coding
    Nian YongJian
    Wan JianWei
    Tang Yi
    Chen Bo
    SCIENCE CHINA-INFORMATION SCIENCES, 2012, 55 (11) : 2646 - 2655
  • [28] Non-Binary Serially Concatenated Codes for Distributed Source Coding
    Nakagawa, Satoru
    Isaka, Motohiko
    2012 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2012), 2012, : 56 - 60
  • [29] Skip block based distributed source coding for hyperspectral image compression
    Banu, Masoodhu N. M.
    Sujatha, S.
    Pathan, Al-Sakib Khan
    MULTIMEDIA TOOLS AND APPLICATIONS, 2016, 75 (18) : 11267 - 11289
  • [30] Distributed Source Coding Using Raptor Codes for Hidden Markov Sources
    Fresia, M.
    Vandendorpe, L.
    Poor, H. V.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2009, 57 (07) : 2868 - 2875