• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Scalable image and video transmission using irregular repeat–accumulate codes with fast algorithm for optimal unequal error protection (2004)

by C Lan, T Chu, K R Narayanan, Z Xiong
Venue:IEEE Trans. Commun
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 10

Iterative Source-Channel Decoding With Markov Random Field Source Models

by Jörg Kliewer, Senior Member, Norbert Goertz, Senior Member, Alfred Mertins, Senior Member
"... Abstract—We propose a joint source-channel decoding approach for multidimensional correlated source signals. A Markov random field (MRF) source model is used which exemplarily considers the residual spatial correlations in an image signal after source encoding. Furthermore, the MRF parameters are se ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
Abstract—We propose a joint source-channel decoding approach for multidimensional correlated source signals. A Markov random field (MRF) source model is used which exemplarily considers the residual spatial correlations in an image signal after source encoding. Furthermore, the MRF parameters are selected via an analysis based on extrinsic information transfer charts. Due to the link between MRFs and the Gibbs distribution, the resulting soft-input soft-output (SISO) source decoder can be implemented with very low complexity. We prove that the inclusion of a high-rate block code after the quantization stage allows the MRF-based decoder to yield the maximum average extrinsic information. When channel codes are used for additional error protection the MRF-based SISO source decoder can be used as the outer constituent decoder in an iterative source-channel decoding scheme. Considering an example of a simple image transmission system we show that iterative decoding can be successfully employed for recovering the image data, especially when the channel is heavily corrupted. Index Terms—EXIT charts, iterative source-channel decoding, joint source-channel coding, Markov random fields. I.
(Show Context)

Citation Context

..., they exhibit a graceful-degradation behavior and thus often yield similar or better performance for strongly distorted channels than the combination of strong source and channel encoding (e.g., [6]–=-=[8]-=-). On the other hand, postprocessing error concealment methods have become part of most decoders for noisy environments and channels with erasures [9]–[12]. Techniques applicable to blockwise transmis...

SYMMETRIC INTERPOLATORY FRAMELETS AND THEIR ERASURE RECOVERY PROPERTIES

by Ofer Amrani, Amir Averbuch, Tamir Cohen, Valery A. Zheludev , 2006
"... A new class of wavelet-type frames in signal space that uses (anti)symmetric waveforms is presented. The construction employs interpolatory filters with rational transfer functions. These filters have linear phase. They are amenable either to fast cascading or parallel recursive implementation. Robu ..."
Abstract - Cited by 4 (4 self) - Add to MetaCart
A new class of wavelet-type frames in signal space that uses (anti)symmetric waveforms is presented. The construction employs interpolatory filters with rational transfer functions. These filters have linear phase. They are amenable either to fast cascading or parallel recursive implementation. Robust error recovery algorithms are developed by utilizing the redundancy inherent in frame expansions. Experimental results recover images when (as much as) 60 % of the expansion coefficients are either lost or corrupted. The proposed approach inflates the size of the image through framelet expansion and multilevel decomposition thus providing redundant representation of the image. Finally, the frame-based error recovery algorithm is compared with a classical coding approach.
(Show Context)

Citation Context

...on codes. Due to the growing importance in rich multimedia data transmission, unequal error protection methods have attracted research efforts, see e.g. [23] and the references therein. For example, (=-=[22, 23]-=-) irregular repeat accumulate (IRA) codes [20] of different rates are designed and applied for scalable image transmission over binary symmetric channel (BSC). The different rates are obtained by punc...

Source-optimized irregular repeat accumulate codes with inherent unequal error protection capabilities and their application to progressive image transmission,” presented at

by Ching-fu Lan, Zixiang Xiong, Senior Member, Krishna R. Narayanan - the 37th Asilomar Conf. Signals, Systems, Computers , 2003
"... Abstract—The common practice for achieving unequal error protection (UEP) in scalable multimedia communication systems is to design rate-compatible punctured channel codes before computing the UEP rate assignments. This paper proposes a new approach to designing powerful irregular repeat accumulate ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract—The common practice for achieving unequal error protection (UEP) in scalable multimedia communication systems is to design rate-compatible punctured channel codes before computing the UEP rate assignments. This paper proposes a new approach to designing powerful irregular repeat accumulate (IRA) codes that are optimized for the multimedia source and to ex-ploiting the inherent irregularity in IRA codes for UEP. Using the end-to-end distortion due to the first error bit in channel decoding as the cost function, which is readily given by the operational distortion-rate function of embedded source codes, we incorporate this cost function into the channel code design process via density evolution and obtain IRA codes that minimize the average cost function instead of the usual probability of error. Because the resulting IRA codes have inherent UEP capabilities due to irregu-larity, the new IRA code design effectively integrates channel code optimization and UEP rate assignments, resulting in source-opti-mized channel coding or joint source-channel coding. We simulate our source-optimized IRA codes for transporting SPIHT-coded images over a binary symmetric channel with crossover proba-bility. When = 0 03 and the channel code length is long (e.g., with one codeword for the whole 512 512 image), we are able to operate at only 9.38 % away from the channel capacity with code length 132380 bits, achieving the best published results in terms of average peak signal-to-noise ratio (PSNR). Compared to conventional IRA code design (that minimizes the probability of error) with the same code rate, the performance gain in average PSNR from using our proposed source-optimized IRA code design is 0.8759 dB when = 0 1 and the code length is 12800 bits. As predicted by Shannon’s separation principle, we observe that this performance gain diminishes as the code length increases. Index Terms—Irregular repeat accumulate (IRA) codes, scalable source coding, source-channel coding, source-optimized channel coding, unequal error protection (UEP). I.
(Show Context)

Citation Context

... amount of introduced redundancy to the significance of the source bits. For scalable multimedia transmission, this approach usually involves two steps: rate-compatible channel code design [14], [25]–=-=[27]-=- and UEP optimization algorithms [28]–[31]. The former provides different levels of error protection for source bits by puncturing the same mother code at different degrees; the latter performs optima...

Joint Source-Channel Coding with Unequal Error Protection using Asymmetric Turbo Codes

by Hanxin Wang, Cuitao Zhu, Chengyi Xiong, Shaoping Chen
"... Abstract—In this paper, we devise an efficient joint source-channel coding scheme for robust image transmission over noisy channels. We firstly present a novel interleaver, named unequal row column cyclic cross interleaver, which could improve the error correction capability of turbo codes effective ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract—In this paper, we devise an efficient joint source-channel coding scheme for robust image transmission over noisy channels. We firstly present a novel interleaver, named unequal row column cyclic cross interleaver, which could improve the error correction capability of turbo codes effectively. Secondly, we devise two types of asymmetric turbo codes which consist of the parallel concatenated turbo codes using two non-identical component encoders with the different constraint lengths and mixed types of generator polynomials. The presented asymmetric turbo codes can optimize the bit error rate of both water-fall region at low signal to noise ratio and error-floor region at high signal to noise ratio, they outperform the conventional symmetric turbo codes but with reduced decoding complexity. Finally, we propose a joint source-channel coding scheme based on unequal error protection using asymmetric
(Show Context)

Citation Context

..., the data bits are grouped according to some criteria capable of determining their importance to the restored source data, and the different channel codes are assigned to different source bit groups =-=[4]-=- [5] [6]. In recognition of the fact that the effects of bit errors in encoded sources are usually more detrimental in some bit groups than in others, several UEP schemes for image transmission using ...

Symmetric interpolatory framelets and their error correction properties

by T. Cohen, O. Amrani, A. Z. Averbuch, V. A. Zheludev
"... When transmitting images over practical communication channels, they are subject to packet loss and random errors due to the noisy nature of the channel. Errors and data loss are customarily recovered by means of error correction coding/decoding. In this paper, robust error-recovery algorithms are d ..."
Abstract - Add to MetaCart
When transmitting images over practical communication channels, they are subject to packet loss and random errors due to the noisy nature of the channel. Errors and data loss are customarily recovered by means of error correction coding/decoding. In this paper, robust error-recovery algorithms are developed by utilizing the redundancy inherent in frame expansions. A new class of wavelet-type frames in signal space using (anti)symmetric waveforms is presented. The construction employs interpolatory filters with rational transfer functions. These filters have linear-phase. They are amenable to fast cascading or parallel recursive implementation. Experimental results recover images when (as much as) 60 % of the packets are either lost or corrupted. The proposed approach inflates the size of the image through framelet expansion thus providing redundant representation of the image; this transform may be followed by compression. Finally, the frame-based error recovery algorithm is compared with a classical coding approach. 1
(Show Context)

Citation Context

...tion codes. Due to the growing importance in rich multimedia data transmission, unequal error protection methods have attracted research efforts, see e.g. [12] and the references therein. For example =-=[11, 12]-=- irregular repeat accumulate (IRA) codes [9] of different rates are designed and applied for scalable image transmission over binary symmetric channel (BSC). The different rates are obtained by punctu...

Contents

by Yichao Tian, Liang Xiao
"... ar ..."
Abstract - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...frame into subsets of varying quality lends itself naturally to employing a UEP scheme, in which the base layer is better protected than the enhanced layers. Examples of this approach can be found in =-=[45, 46]-=-. Our work in Chapter 6, where transmission power is allocated to a single layer of video packets according to their error sensitivity, can also be classified into this category. In channel-optimized ...

Robust Image Transmission with Rate- Compatible Low-Density Parity-Check codes over Noisy Channels

by Xiang Pan, Xiang Pan , 2004
"... © Copyright ..."
Abstract - Add to MetaCart
© Copyright
(Show Context)

Citation Context

...5], [23]. In the second approach, transmitted packets have all the same length (L1 = … = LN = L) and thus depending on 23 n isthe channel coding rate, source packets would have different lengths [2], =-=[3]-=-, [22]. Although the algorithm of [2] has been designed for the latter scenario, we notice that one may apply it equally effectively to the former. The only difference is that the final nodes of the s...

Source-channel Coding for Robust Image Transmission and for Dirty-paper Coding.

by Yong Sun , 2005
"... In this dissertation, we studied two seemingly uncorrelated, but conceptually related problems in terms of source-channel coding: 1) wireless image transmission and 2) Costa (“dirty-paper”) code design. In the first part of the dissertation, we consider progressive image transmission over a wireless ..."
Abstract - Add to MetaCart
In this dissertation, we studied two seemingly uncorrelated, but conceptually related problems in terms of source-channel coding: 1) wireless image transmission and 2) Costa (“dirty-paper”) code design. In the first part of the dissertation, we consider progressive image transmission over a wireless system employing space-time coded OFDM. The space-time coded OFDM system based on a newly built broadband MIMO fading model is theoretically evaluated by assuming perfect channel state information (CSI) at the receiver for coherent detection. Then an adaptive modulation scheme is proposed to pick the constellation size that offers the best reconstructed image quality for each average signal-to-noise ratio (SNR). A more practical scenario is also considered without the assumption of perfect CSI. We employ low-complexity decision-feedback decoding for differentially space-time coded OFDM systems to exploit transmitter diversity. For JSCC, we adopt a product channel code structure that is proven to provide powerful error protection and bursty error correction. To further improve the system performance, we also apply

ROBUST IMAGE TRANSMISSION BASED ON PRODUCT-CODE OPTIMIZATION FOR DETERMINATE STATE LDPC DECODING

by N. Thomos, N. V. Boulgouris, M. G. Strintzis
"... We propose a novel scheme for error resilient image transmission. The proposed scheme employs a product coder consisting of LDPC codes and RS codes in order to deal effectively with bit errors. The efficiency of the proposed scheme is based on the exploitation of determinate symbols in Tanner graph ..."
Abstract - Add to MetaCart
We propose a novel scheme for error resilient image transmission. The proposed scheme employs a product coder consisting of LDPC codes and RS codes in order to deal effectively with bit errors. The efficiency of the proposed scheme is based on the exploitation of determinate symbols in Tanner graph decoding of LDPC codes and a novel product code optimization technique based on error estimation. Experimental evaluation demonstrates the superiority of the proposed system in comparison to recent state-of-the art techniques for image transmission. Index Terms — Image transmission, Product codes, LDPC codes.
(Show Context)

Citation Context

...rmation and the decoding of satisfactory quality images. A variety of error-resilient techniques for transmission of images over error-prone channels have been recently proposed in the literature. In =-=[1]-=-, irregular repeat accumulate codes (IRA) [2] were proposed for the transmission of JPEG2000 and SPIHT streams over Binary Symmetric Channels (BSC). The scheme in [1] showed performance superior to th...

Correspondence LDPC-Based Iterative Joint Source-Channel Decoding for JPEG2000

by Lingling Pu, Student Member, Zhenyu Wu, Ali Bilgin, Michael W. Marcellin, Bane Vasic
"... Abstract—A framework is proposed for iterative joint source-channel de-coding of JPEG2000 codestreams. At the encoder, JPEG2000 is used to per-form source coding with certain error-resilience (ER) modes, and LDPC codes are used to perform channel coding. During decoding, the source decoder uses the ..."
Abstract - Add to MetaCart
Abstract—A framework is proposed for iterative joint source-channel de-coding of JPEG2000 codestreams. At the encoder, JPEG2000 is used to per-form source coding with certain error-resilience (ER) modes, and LDPC codes are used to perform channel coding. During decoding, the source decoder uses the ER modes to identify corrupt sections of the codestream and provides this information to the channel decoder. Decoding is carried out jointly in an iterative fashion. Experimental results indicate that the proposed method requires fewer iterations and improves overall system performance. Index Terms—Error resilience (ER), joint source/channel coding, JPEG2000, LDPC. I.
(Show Context)

Citation Context

... Arizona, Tucson, AZ 85721 USA. He is now with Thomson, Inc., Corporate Research, Princeton, NJ 08540 USA. Digital Object Identifier 10.1109/TIP.2006.888329 the distortion in reconstructed images. In =-=[7]-=-, the authors consider the design of punctured irregular repeat-accumulate codes, and their application to a UEP scheme for scalable image and video coders. In [8], the authors investigate the design ...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University