The scalable extension of the H.264/AVC video coding standard (SVC) demonstrates superb adaptability in video communications. jointsource and channelcoding (JSCC) has been shown to be very effective for such scalabl...
详细信息
The scalable extension of the H.264/AVC video coding standard (SVC) demonstrates superb adaptability in video communications. jointsource and channelcoding (JSCC) has been shown to be very effective for such scalable video consisting of parts of different significance. In this paper, a new JSCC scheme for SVC transmission over packet loss channels is proposed which performs two-dimensional optimization on the quality layers of each frame in a rate-distortion (R-D) sense as well as on the temporal hierarchical structure of frames under dependency constraints. To compute the end-to-end R-D points of a frame, a novel reduced trellis algorithm is developed with a significant reduction of complexity from the existing Viterbi-based algorithm. The R-D points of frames are sorted under the hierarchical dependency constraints and optimal JSCC solution is obtained in terms of the best R-D performance. Experimental results show that our scheme outperforms the existing scheme of [13] with average quality gains of 0.26 dB and 0.22 dB for progressive and non-progressive modes respectively.
A joint source/channel coding algorithm is proposed for the transmission of multiple image sources over memoryless channels. The proposed algorithm uses a quality scalable image coder to optimally allocate a limited b...
详细信息
A joint source/channel coding algorithm is proposed for the transmission of multiple image sources over memoryless channels. The proposed algorithm uses a quality scalable image coder to optimally allocate a limited bit budget among all the sources to achieve the optimal overall distortion reduction for the multiple reconstructed images. In addition to the conventional un gain, it provides channel multiplexing gain, which can be much more significant. Furthermore, an extended scheme is proposed to provide flexibility between the optimization performance and complexity.
In this paper a method of joint source/channel coding is *** on the statistics of a source with N different symbols,we select N codes having a desired minimum Hamming distance d between *** decoder utilizes the d and ...
详细信息
ISBN:
(纸本)0780363949
In this paper a method of joint source/channel coding is *** on the statistics of a source with N different symbols,we select N codes having a desired minimum Hamming distance d between *** decoder utilizes the d and the corresponding relationship between code and symbol to recover the original sequence of symbols without the use of channel *** introduced scheme is suitable for bandwidth-limited binary symmetric channel(BSC) with moderate to high error rates.
QoS-guarantee in real-time communication for multimedia applications is significantly important. An architectural framework for multimedia networks based on substreams or flows is effectively exploited for combining s...
详细信息
ISBN:
(纸本)0819431249
QoS-guarantee in real-time communication for multimedia applications is significantly important. An architectural framework for multimedia networks based on substreams or flows is effectively exploited for combining source and channelcoding for multimedia data. But the existing frame by frame approach which includes Moving Pictures Expert Group (MPEG) cannot be neglected because it is a standard. In this paper, firstly, we designed an MPEG transcoder which converts an MPEG coded stream into variable rate packet sequences to be used for our joint source/channel coding (JSCC) scheme. Secondly, we designed a classification scheme to partition the packet stream into multiple substreams which have their own Quality of Service (QoS) requirements. Finally, we designed a management (reservation and scheduling) scheme for substreams to support better perceptual video quality such as the bound of end-to-end jitter. We have shown that our JSCC scheme is better than two other popular techniques by simulation and real video experiments on the TCP/IP environment.
Block-based video coders rely on motion compensated block prediction for more data compression. With the introduction of video coding over packet-switched networks such as the Internet and the resulting packet loss th...
详细信息
ISBN:
(纸本)0819427497
Block-based video coders rely on motion compensated block prediction for more data compression. With the introduction of video coding over packet-switched networks such as the Internet and the resulting packet loss that occurs on congested networks, coding mode selection for each macro-block is significant in determining the overall distortion on the decoded video sequence. In this work, ae examine the problem of mode selection for macro-blocks in tl-ie presence of loss and a channel rate constraint. We present and evaluate several methods for mode selection that attempt to minimize perceptual distortion from packet loss. We formulate a simplified problem which is useful for gaining some insight, and present an efficient algorithm to finding an optimal solution.
The combination of sourcecoding with decoder side information (the Wyner-Ziv problem) and channelcoding with encoder side information (the Gel'fand-Pinsker problem) can be optimally solved using the separation p...
详细信息
The combination of sourcecoding with decoder side information (the Wyner-Ziv problem) and channelcoding with encoder side information (the Gel'fand-Pinsker problem) can be optimally solved using the separation principle. In this work, we show an alternative scheme for the quadratic-Gaussian case, which merges source and channelcoding. This scheme achieves the optimal performance by applying a modulo-lattice modulation to the analog source. Thus, it saves the complexity of quantization and channel decoding, and remains with the task of "shaping" only. Furthermore, for high signal-to-noise ratio (SNR), the scheme approaches the optimal performance using an SNR-independent encoder, thus it proves for this special case the feasibility of universal jointsource-channelcoding.
We consider the problem of coding images for transmission over error-prone channels. The impairments we target are transient channel shutdowns, as would occur in a packet network when a packet is lost, or in a wireles...
详细信息
We consider the problem of coding images for transmission over error-prone channels. The impairments we target are transient channel shutdowns, as would occur in a packet network when a packet is lost, or in a wireless system during a deep fade: when data is delivered it is assumed to be error-free, but some of the data may never reach the receiver. The proposed algorithms are based on a combination of multiple description scalar quantizers with techniques successfully applied to the construction of some of the most efficient subband coders. A given image is encoded into multiple independent packets of roughly equal length. When packets are lost, the quality of the approximation computed at the receiver depends only on the number of packets received, but does not depend on exactly which packets are actually received. When compared with previously reported results on the performance of robust image coders based on multiple descriptions, on standard test images, our coders attain similar PSNR values using typically about 50-60% of the bit rate required by these other state-of-the-art coders, while at the same time providing significantly more freedom in the mechanism for allocation of redundancy among descriptions.
Multimedia transmission has to handle a variety of compressed and uncompressed source signals such as data, text, image, audio, and video. On wireless channels the error rates are high and joint source/channel coding ...
详细信息
Multimedia transmission has to handle a variety of compressed and uncompressed source signals such as data, text, image, audio, and video. On wireless channels the error rates are high and joint source/channel coding and decoding methods are advantageous. Also, the system architecture has to adapt to the bad channel conditions. Several examples of a joint design are given. We especially advocate the use of rate-compatible punctured systematic recursive convolutional (RCPRSC) codes which are shown to lead to a straightforward and versatile unequal error protection (UEP) design. In addition, the high-end receiver could use soft outputs and source-controlled channel decoding for even better performance.
We present the unequal loss protection (ULP) framework in which unequal amounts of forward error correction are applied to progressive data to provide graceful degradation of image quality as packet losses increase. W...
详细信息
We present the unequal loss protection (ULP) framework in which unequal amounts of forward error correction are applied to progressive data to provide graceful degradation of image quality as packet losses increase. We develop a simple algorithm that can find a good assignment within the ULP framework. We use the Set Partitioning in Hierarchical Trees coder in this work, but our algorithm can protect any progressive compression scheme. In addition, we promote the use of a PMF of expected channel conditions so that our system can work with almost any model or estimate of packet losses, We fmd that when optimizing for an exponential packet loss model with a mean loss rate of 20% and using a total rate of 0.2 bits per pixel on the Lenna image, good image quality can be obtained even when 40% of transmitted packets are lost.
In this paper, we propose a combined source/channelcoding scheme for transmission of images over fading channels. The proposed scheme employs rate-compatible low-density parity-check codes along with embedded image c...
详细信息
In this paper, we propose a combined source/channelcoding scheme for transmission of images over fading channels. The proposed scheme employs rate-compatible low-density parity-check codes along with embedded image coders such as JPEG2000 and set partitioning in hierarchical trees (SPIHT). The assignment of channelcoding rates to source packets is performed by a fast trellis-based algorithm. We examine the performance of the proposed scheme over correlated and uncorrelated Rayleigh flat-fading channels with and without side information. Simulation results for the expected peak signal-to-noise ratio of reconstructed images, which are within I dB of the capacity upper bound over a wide range of channel signal-to-noise ratios, show considerable improvement compared to existing results under similar conditions. We also study the sensitivity of the proposed scheme in the presence of channel estimation error at the transmitter and demonstrate that under most conditions our scheme is more robust compared to existing schemes.
暂无评论