Robust hyperspectral image coding with channel-optimizedtrellis-coded quantization

This paper presents a wavelet-based hyperspectral image coder that is optimized for transmission over the binary symmetric channel (BSC). The proposed coder uses a robust channel-optimized trellis-coded quantization (COTCQ) stage that is designed to optimize the image coding based on the channel characteristics. This optimization is performed only at the level of the source encoder and does not include any channel coding for error protection. The robust nature of the coder increases the security level of the encoded bit stream, and provides a much higher quality decoded image. In the absence of channel noise, the proposed coder is shown to achieve a compression ratio greater than 70:1, with an average peak SNR of the coded hyperspectral sequence exceeding 40 dB. Additionally, the coder is shown to exhibit graceful degradation with increasing channel errors     

Trellis-coded quantization designed for noisy channels

Trellis-coded quantization (TCQ) of memoryless sources is developed for transmission over a binary symmetric channel. The optimized TCQ coder can achieve essentially the same performance as Ayanoglu and Gray's (1987) unconstrained trellis coding optimized for the binary symmetric channel, but with a much lower implementation complexity for transmission rates above 1 b/sample. In most cases, the optimized TCQ coder also provides larger signal-to-noise ratio than Farvardin and Vaishampayan's (1991) channel-optimized vector quantization. Algorithms are developed for the joint design of trellis-coded quantization/modulation (TCQ/TCM). The jointly designed TCQ/TCM system outperforms the straightforward cascade of separately designed TCQ and TCM systems. The improvement is most significant at low channel signal-to-noise ratio. For a first-order Gauss-Markov source, the predictive TCQ/TCM performance can exceed that of optimum pulse amplitude modulation     

Joint source-channel coding using combined TCQ/CPM: iterative decoding

An iterative decoding approach to joint source and channel coding (JSCC) using combined trellis-coded quantization (TCQ) and continuous phase modulation (CPM) is proposed. The channel is assumed to be the additive white Gaussian noise channel. This iterative procedure exploits the structure of the TCQ encoder and the continuous phase modulator. The performance in terms of the signal-to-distortion ratio (SDR) is compared with that of a combined TCQ/trellis-coded modulation (TCM) system. It is shown that the combined TCQ/CPM systems are both power- and bandwidth-efficient, compared with the combined TCQ/TCM system. For source encoding rate R=2 b/sample, it is observed that the combined TCQ/CPM systems with iterative decoding working at symbol level converge faster than the systems working at bit level. The novelty of this work is the use of a soft decoder and an iterative decoding algorithm for TCQ-based JSCC systems. The combined TCQ/CPM with iterative decoding is considered for the first time.     

Speech and channel coding for digital land-mobile radio

The joint development of a medium bit-rate speech coder along with an effective channel coding technique to provide a robust, spectrally efficient, high-quality mobile communication system is described. A subband coder operating at 12 kb/s is used; in the absence of channel errors, it provides speech quality comparable to current analog land-mobile radio systems. The coder design incorporates a unique coding of the side information to facilitate the use of forward-error-correction coding without the need to code the entire bit stream. The use of excessive overhead for redundancy is avoided while the harsh effects of frequent channels are mitigated. These techniques have been used in an experimental FDMA (frequency-division multiple access) digital land-mobile radio system. The combined speech and channel coder operates at 15 kb/s and provides intelligible speech at fading channel error rates up to 8%     

Adaptive image coding with perceptual distortion control

This paper presents a discrete cosine transform (DCT)-based locally adaptive perceptual image coder, which discriminates between image components based on their perceptual relevance for achieving increased performance in terms of quality and bit rate. The new coder uses a locally adaptive perceptual quantization scheme based on a tractable perceptual distortion metric. Our strategy is to exploit human visual masking properties by deriving visual masking thresholds in a locally adaptive fashion. The derived masking thresholds are used in controlling the quantization stage by adapting the quantizer reconstruction levels in order to meet the desired target perceptual distortion. The proposed coding scheme is flexible in that it can be easily extended to work with any subband-based decomposition in addition to block-based transform methods. Compared to existing perceptual coding methods, the proposed perceptual coding method exhibits superior performance in terms of bit rate and distortion control. Coding results are presented to illustrate the performance of the presented coding scheme.     

Optimization of quadtree segmentation and hybrid two-dimensionaland three-dimensional motion estimation in a rate-distortion framework

A rate-distortion framework is used to define a very low bit-rate coding scheme based on quadtree segmentation and optimized selection of motion estimators. This technique achieves maximum reconstructed image quality under the constraint of a target bit rate for the coding of the vector field and segmentation information. First, a complete scheme is proposed for hybrid two-dimensional (2-D) and three-dimensional (3-D) motion estimation and compensation. The quadtree object segmentation is optimized for hybrid motion estimation in the rate-distortion sense. This scheme adapts to the depth of the quadtree and the technique used for motion estimation for each leaf of the tree. A more sophisticated technique, adapted to the requirements of a very low bit-rate coder, is also proposed which also considers the transmission of the prediction error corresponding to the particular choice of the motion estimator. Based on these coding schemes, two versions of a very low bit-rate image sequence coder are developed. Experimental results illustrating the performance of the proposed techniques in very low bit-rate image sequence coding application areas are presented and evaluated     

MPEG-4 image transmission using MAP source-controlled channeldecoding

In this paper, we develop an error resilient variant of the MPEG-4 embedded zerotree wavelet coder, suitable for mobile fading channels. The residual redundancy in the compressed bit stream provides implicit error protection through the use of source-controlled channel decoding; no explicit channel coding is used. We propose two slight modifications to the MPEG-4 coder. The first removes the arithmetic coding in the lowest frequency subband so that hidden Markov model-based MAP estimation of both the source index and the channel state can be easily applied. The change in bit rate is negligible, while performance during severe channel fading conditions can be greatly increased. The second modification adds variable length packetization to the compressed bit stream created from the higher frequency subbands. The individual packets are independently decodable. An optional rearrangement of the bits in each packet allows MAP estimation to be applied to these subbands as well. Simulation results show a significant performance improvement for the overall system     

Low complexity LMMSE turbo equalization for combined error control coded and linearly precoded OFDM

The turbo equalization approach is studied for Orthogonal Frequency Division Multiplexing （OFDM） system with combined error control coding and linear precoding. While previous literatures employed linear precodcr of small size for complexity reasons, this paper proposes to use a linear precoder of size larger than or equal to the maximum length of the equivalent discrete-time channel in order to achieve full frequency diversity and reduce complexities of the error control coder/decoder. Also a low complexity Linear Minimum Mean Square Error （LMMSE） turbo equalizer is derived for the receiver. Through simulation and performance analysis, it is shown that the performance of the proposed scheme over frequency selective fading channel reaches the matched filter bound; compared with the same coded OFDM without linear precoding, the proposed scheme shows an Signal-to-Noise Ratio （SNR） improvement of at least 6dB at a bit error rate of 10 6 over a multipath channel with exponential power delay profile. Convergence behavior of the proposed scheme with turbo equalization using various type of linear precoder/transformer, various interleaver size and error control coder of various constraint length is also investigated.     

Joint source/channel coding for multiple images

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.     

Codage avec information adjacente pour les canaux de diffusion MIMO

We propose several dirty paper coding schemes for the broadcast channel when both the transmitter and receivers are equipped with multiple antennas. These schemes are based on channel state information at the transmitter and inspired from information-theoretic concepts. The proposed end-to-end algorithms allows us to evaluate the performance of the broadcast channel in terms of bit error rates and not in terms of coding rates as it is usually the case in the literature. Different inner coding schemes such as the ZF-DPC and MMSE-DPC and different outer coding schemes such as the THS, SCS and TCQ are compared and discussed. We also consider the DPC idea as a way of implementing a multiple access scheme. In this respect it is compared with the well-known TDMA scheme. Sometimes our conclusions show quite surprising results in comparison to what is expected by pure information-theoretic considerations.     

Image coding using robust quantization for noisy digitaltransmission

A robust quantizer is developed for encoding memoryless sources and transmission over the binary symmetric channel (BSC). The system combines channel optimized scalar quantization (COSQ) with all-pass filtering, the latter performed using a binary phase-scrambling/descrambling method. Applied to a broad class of sources, the robust quantizer achieves the same performance as the Gaussian COSQ for the memoryless Gaussian source. This quantizer is used in image coding for transmission over a BSC. The peak signal-to-noise ratio (PSNR) performance degrades gracefully as the channel bit error rate increases.     

Low resolution region discriminator for wavelet coding

A wavelet block chain (WBC) method is used in the initial coding of the low-low subband created by a wavelet transform to separate and label homogenous regions of the image which require no additional overhead in the bitstream. This information is then used to enhance the coding performance in a modified wavelet based coder. This method uses a two stage ZTE/SPIHT entropy coder (called a homogenous connected-region interested ordered transmission coder) to create a bitstream with properties of progressive transmission, scalability, and perceptual optimisation after a minimum bit rate is reached. Simulation results show good scalable low bit rate (0.04-0.4 bpp) compression, comparable to a SPIHT coder, but with better perceptual quality due to use of the region based information acquired by the WBC method     

噪声信道中基于残留冗余的联合信源信道编码

对信源编码中的残留冗余在联合编码中的作用进行了研究,提出了一个在噪声信道中对可变长信源编码码流传输提供有效差错保护的联合信源信道编码方法,该方法利用信源编码器输出中的残留冗余为传输码流提供差错保护。与SayoodK提出的系统相比,该方法是基于改进的联合卷积软解码以及采用非霍夫曼码的通用可变长码,更接近于一般的信源和信道编码方法,并且信源符号集的大小也不受限制。仿真表明,所提出的联合编码方法可获得比传统的分离编码方法更高的性能增益。     

Feedback-based error control for mobile video transmission

We review feedback-based low bit-rate video coding techniques for robust transmission in mobile multimedia networks. For error control on the source coding level, each decoder has to make provisions for error detection, resynchronization, and error concealment, and we review techniques suitable for that purpose. Further, techniques are discussed for intelligent processing of acknowledgment information by the coding control to adapt the source coder to the channel. We review and compare error tracking, error confinement, and reference picture selection techniques for channel-adaptive source coding. For comparison of these techniques, a system for transmitting low bit-rate video over a wireless channel is presented and the performance is evaluated for a range of transmission conditions. We also show how feedback-based source coding can be employed in conjunction with precompressed video stored on a media server. The techniques discussed are applicable to a wide variety of interframe video schemes, including various video coding standards. Several of the techniques have been incorporated into the H.263 video compression standard, and this standard is used as an example throughout     

Two-layer coding of video signals for VBR networks

Two-layer conditional-replenishment coding of video signals over a variable-bit-rate (VBR) network is described. A slotted-ring network based on an Orwell protocol is assumed, where transmission of certain packets is guaranteed. The two-layer coder produces two output bit streams: the first bit stream contains all the important structural information in the image and is accommodated in the guaranteed capacity of the network, while the second adds the necessary quality finish. The performance of the coder is tested with CIF standard sequences and broadcast-quality pictures. The portion of the VBR channel allocated to the lower layer as guaranteed bandwidth is examined. Using broadcast-quality pictures, statistics were obtained on the performance of this system for different choices of bit rate in the lower layer. The effect of lost packets is shown on CIF standard picture sequences. It is shown that the coder performs well for a guaranteed channel rate as low as 10-20% of the total bit rate     

Joint trellis coded quantization/modulation

A joint source/channel coding system constructed using trellis coded quantization (TCQ) and trellis coded modulation (TCM) is described. Identical trellises are used in the TCQ and TCM systems, and a straightforward mapping of TCQ codewords to TCM symbols is presented which guarantees that Euclidean squared distance in the channel is commensurate with quantization mean-square error (MSE). Hence, likely TCM error events of small Euclidean distance cause only a small increase in overall source coding MSE     

Lossless image coding using adaptive, switching algorithm with automatic fuzzy context modelling

A switching adaptive predictor (SWAP) with automatic fuzzy context modelling is proposed for lossless image coding. Depending on the context of the coding pixel, the SWAP encoder switches between two predictors: the adaptive neural predictor (ANP) and the texture context matching (TCM) predictor. The ANP is known to perform well and gives small prediction errors except for pixels around edges. For areas with edges, TCM is used. To decide which is to be used, a switching criterion is proposed to pick out pixels around edges effectively. With the switching predictor structure, small prediction errors can be achieved in both slowly varying areas and edges. Furthermore, the use of the so-called fuzzy context clustering for prediction error refinement is proposed. The proposed compensation mechanism is proved to be very useful through experiments. It further improves the bit rates by, on average, 0.2 bpp in test images. The experiments also show that an average improvement of 0.3 and 0.05 bpp in first-order entropy can be achieved when the proposed switching predictor is compared with the gradient adjusted predictor and a six-order edge directed predictor, respectively. Moreover, the lossless image coder built upon the proposed algorithm also provides lower bit rates than the state-of-the-art context-based, adaptive, lossless image coding (CALIC) system and is comparable to that obtained by the highly complex two-pass coder called TMW     

噪声信道中基于残留冗余的联合信源信道编码.

对信源编码中的残留冗余在联合编码中的作用进行了研究，提出了一个在噪声信道中对可变长信源编码码流传输提供有效差错保护的联合信源信道编码方法，该方法利用信源编码器输出中的残留冗余为传输码流提供差错保护。与Sayood K提出的系统相比，该方法是基于改进的联合卷积软解码以及采用非霍夫曼码的通用可变长码，更接近于一般的信源和信道编码方法，并且信源符号集的大小也不受限制。仿真表明，所提出的联合编码方法可获得比传统的分离编码方法更高的性能增益。     

Robust transform image coder over noisy channel

A robust quantiser design for image coding is presented. The proposed quantiser can be viewed as the combination of compound of a quantiser, a variable length code (VLC) coder, and a channel coder. Simulation results show that our proposed scheme has a graceful distortion behaviour within the designed noise range     

A progressive transmission image coder using linear phase uniformfilterbanks as block transforms

This paper presents a novel image coding scheme using M-channel linear phase perfect reconstruction filterbanks (LPPRFBs) in the embedded zerotree wavelet (EZW) framework introduced by Shapiro (1993). The innovation here is to replace the EZWs dyadic wavelet transform by M-channel uniform-band maximally decimated LPPRFBs, which offer finer frequency spectrum partitioning and higher energy compaction. The transform stage can now be implemented as a block transform which supports parallel processing and facilitates region-of-interest coding/decoding. For hardware implementation, the transform boasts efficient lattice structures, which employ a minimal number of delay elements and are robust under the quantization of lattice coefficients. The resulting compression algorithm also retains all the attractive properties of the EZW coder and its variations such as progressive image transmission, embedded quantization, exact bit rate control, and idempotency. Despite its simplicity, our new coder outperforms some of the best image coders published previously in the literature, for almost all test images (especially natural, hard-to-code ones) at almost all bit rates.