Figure 11 - uploaded by Christine Guillemot
Content may be subject to copyright.
PSNR performance and visual quality obtained, respectively, with concatenated Huffman codes and two transmission schemes using Hu-Tucker codes for low subband and Huffman codes for high subbands. These schemes use, respectively, the CMA algorithm and the SMA-stack algorithm. The channel bit error rates are 0.0001 (top images), 0.001 (middle images), and 0.01 (bottom images).
Source publication
This paper addresses the issue of robust and progressive transmission of signals (e.g., images, video) encoded with variable length codes (VLCs) over error-prone channels. This paper first describes bitstream construction methods offering good properties in terms of error resilience and progressivity. In contrast with related algorithms described i...
Similar publications
To achieve very low bit-rate transmission, many video coding papers suggest extraction of stationary objects and the background and coding only of moving objects. These techniques, which could seriously distort the output, are mostly applied to spatial domain. A novel scalable adaptive temporal segmentation algorithm for video coding is proposed in...
In order to achieve high performance in terms of compression ratio, m s t standard video coders have a high computational complexity. Motion estimation in sub-pixel accuracy and in modekbased rate distortion optimization is approached from a practical implementation perspective; then, a configurable coding scheme is proposed and analyzed with respe...
Citations
... This chapter has been submitted and accepted for publication in [JG05c]. It has been presented in part in [JG04a] and is related to the work of [JG04c] (not included in this document). ...
Some new error-resilient source coding and joint source/channel coding techniques
are proposed for the transmission of multimedia sources over error-prone channels.
First, we introduce a class of entropy codes providing unequal error-resilience, i.e.
providing some protection to the most sensitive information. These codes are then
extended to exploit the temporal dependencies.
A new state model based on the aggregation of some states of the trellis is then
proposed and analyzed for soft source decoding of variable length codes with a length
constraint. It allows the weighting of the compromise between the estimation accuracy
and the decoding complexity.
Next, some paquetization methods are proposed to reduce the error propagation
phenomenon of variable length codes.
Finally, some re-writing rules are proposed to extend the binary codetree representation
of entropy codes. The proposed representation allows in particular the design
of codes with improved soft decoding performances.
