Image coding with robust channel-optimized trellis-codedquantization

This paper presents a wavelet-based 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. A phase scrambling stage is also used to further increase the coding performance and robustness to nonstationary signals and channels. The resilience to channel errors is obtained by optimizing the coder performance only at the level of the source encoder with no explicit channel coding for error protection. For the considered TCQ trellis structure, a general expression is derived for the transition probability matrix. In terms of the TCQ encoding rat and the channel bit error rate, and is used to design the COTCQ stage of the image coder. The robust nature of the coder also increases the security level of the encoded bit stream and provides a much more visually pleasing rendition of the decoded image. Examples are presented to illustrate the performance of the proposed robust image coder     

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     

Joint source-channel coding using real BCH codes for robust image transmission.

In this paper, a new still image coding scheme is presented. In contrast with standard tandem coding schemes, where the redundancy is introduced after source coding, it is introduced before source coding using real BCH codes. A joint channel model is first presented. The model corresponds to a memoryless mixture of Gaussian and Bernoulli-Gaussian noise. It may represent the source coder, the channel coder, the physical channel, and their corresponding decoder. Decoding algorithms are derived from this channel model and compared to a state-of-art real BCH decoding scheme. A further comparison with two reference tandem coding schemes and the proposed joint coding scheme for the robust transmission of still images has been presented. When the tandem scheme is not accurately tuned, the joint coding scheme outperforms the tandem scheme in all situations. Compared to a tandem scheme well tuned for a given channel situation, the joint coding scheme shows an increased robustness as the channel conditions worsen. The soft performance degradation observed when the channel worsens gives an additional advantage to the joint source-channel coding scheme for fading channels, since a reconstruction with moderate quality may be still possible, even if the channel is in a deep fade.     

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

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

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

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

Layered Wyner-Ziv video coding.

Following recent theoretical works on successive Wyner-Ziv coding (WZC), we propose a practical layered Wyner-Ziv video coder using the DCT, nested scalar quantization, and irregular LDPC code based Slepian-Wolf coding (or lossless source coding with side information at the decoder). Our main novelty is to use the base layer of a standard scalable video coder (e.g., MPEG-4/H.26L FGS or H.263+) as the decoder side information and perform layered WZC for quality enhancement. Similar to FGS coding, there is no performance difference between layered and monolithic WZC when the enhancement bitstream is generated in our proposed coder. Using an H.26L coded version as the base layer, experiments indicate that WZC gives slightly worse performance than FGS coding when the channel (for both the base and enhancement layers) is noiseless. However, when the channel is noisy, extensive simulations of video transmission over wireless networks conforming to the CDMA2000 1X standard show that H.26L base layer coding plus Wyner-Ziv enhancement layer coding are more robust against channel errors than H.26L FGS coding. These results demonstrate that layered Wyner-Ziv video coding is a promising new technique for video streaming over wireless networks.     

Layered Wyner–Ziv Video Coding

Following recent theoretical works on successive Wyner-Ziv coding (WZC), we propose a practical layered Wyner-Ziv video coder using the DCT, nested scalar quantization, and irregular LDPC code based Slepian-Wolf coding (or lossless source coding with side information at the decoder). Our main novelty is to use the base layer of a standard scalable video coder (e.g., MPEG-4/H.26L FGS or H.263+) as the decoder side information and perform layered WZC for quality enhancement. Similar to FGS coding, there is no performance difference between layered and monolithic WZC when the enhancement bitstream is generated in our proposed coder. Using an H.26L coded version as the base layer, experiments indicate that WZC gives slightly worse performance than FGS coding when the channel (for both the base and enhancement layers) is noiseless. However, when the channel is noisy, extensive simulations of video transmission over wireless networks conforming to the CDMA2000 1X standard show that H.26L base layer coding plus Wyner-Ziv enhancement layer coding are more robust against channel errors than H.26L FGS coding. These results demonstrate that layered Wyner-Ziv video coding is a promising new technique for video streaming over wireless networks     

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%     

A High-Performance Codec Suitable for the GSM Half-Rate Coding System

1IntroductionTheGSMpanEuropeandigitalradiosystemhas-beendesignedwithaparticularTDMAframestfllcturewhichenablestheusingofeitherfull-rateorhalf-ratechannels.Speechandchannelcodingalgorithmsforfull-ratechannelshavebeenindependentlystandardized,leadingrespectivelytotheRPE-LTPalgorithmandprotectionschemebasedonaconvolutionalcodewithaCRCforerrordetection.StandardiZationofacombinedspeechandchannelhalf-ratecodecataglobalrateofII.4kbpshasstartedunderthecontrolofETSI.Theobjectiveisverychalleng…     

A Comparison of Digital Speech Coding Methods for Mobile Radio Systems

Subjective quality measurements on three digital speech coders, simulated with mobile radio channel transmission, were performed using the "mean opinion score (MOS)" method. The three speech coding methods tested were: continuously variable slope deltamodulation (CVSD) coding, adaptive predictive coding (APC), and residually excited linear predictive (RELP) coding. Several versions of each coder, with transmission rates in the range of 7.3 to 16.1 kbits/s, were simulated. Five different channel conditions, including three derived from land mobile radio field experiments, were applied to the speech coders' encoded output to study the effects. The results show that of the three coders, the CVSD coder is the most robust to channel errors, but produces reconstructed output speech of unacceptable quality. The 14.4 kbit/s RELP coder produces relatively good Output speech quality, exhibits a mild degree of robustness to mobile radio channel errors, and is slightly less complex than the APC coder. Of the three digital speech coders tested, the RELP coder appears the most suitable for use with land mobile radio. However none of the three coders was able to produce speech of telephone toll quality in a mobile radio environment.     

Tradeoffs of Source Coding, Channel Coding and Spreading in Frequency Selective Rayleigh Fading Channels

This paper investigates the tradeoffs of source coding, channel coding and spreading in CDMA systems. We consider a system consisting of an image source coder, a convolutional channel coder, an interleaver, and a direct sequence spreading module. With different allocations of bandwidth to source coding, channel coding and spreading, the system is analyzed over a frequency selective Rayleigh fading channel. The performance of the system is evaluated using the cumulative distribution function of peak signal-to-noise ratio. Tradeoffs of different components of the system are determined through simulations. We show that, for a given bandwidth, an optimal allocation of that bandwidth can be found. Tradeoffs among the parameters allow us to tune the system performance to specific requirements.     

Progressive Video Coding for Noisy Channels

We extend the work of Sherwood and Zeger to progressive video coding for noisy channels. By utilizing a three-dimensional (3D) extension of the set partitioning in hierarchical trees (SPIHT) algorithm, we cascade the resulting 3D SPIHT video coder with the rate-compatible punctured convolutional channel coder for transmission of video over a binary symmetric channel. Progressive coding is achieved by increasing the target rate of the 3D embedded SPIHT video coder as the channel condition improves. The performance of our proposed coding system is acceptable at low transmission rate and bad channel conditions.     

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.     

Near-lossless and lossy compression of imaging spectrometer data: comparison of information extraction performance

We investigate the ability to derive meaningful information from decompressed imaging spectrometer data. Hyperspectral images are compressed with near-lossless and lossy coding methods. Linear prediction between the bands is used in both cases. Each band is predicted by a previously transmitted band. The residual is formed by subtracting the prediction from the original data and then is compressed either with a near-lossless bit-plane coder or with the lossy JPEG2000 algorithm. We study the effects of these two types of compression on hyperspectral image processing such as mineral and vegetation content classification using whole- and mixed pixel analysis techniques. The results presented in this paper indicate that an efficient lossy coder outperforms near-lossless method in terms of its impact on final hyperspectral data applications.     

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     

Low-rate and flexible image coding with redundant representations.

New breakthroughs in image coding possibly lie in signal decomposition through nonseparable basis functions that can efficiently capture edge characteristics, present in natural images. The work proposed in this paper provides an adaptive way of representing images as a sum of two-dimensional features. It presents a low bit-rate image coding method based on a matching pursuit (MP) expansion, over a dictionary built on anisotropic refinement and rotation of contour-like atoms. This method is shown to provide, at low bit rates, results comparable to the state of the art in image compression, represented here by JPEG2000 and SPIHT, with generally a better visual quality in the MP scheme. The coding artifacts are less annoying than the ringing introduced by wavelets at very low bit rate, due to the smoothing performed by the basis functions used in the MP algorithm. In addition to good compression performances at low bit rates, the new coder has the advantage of producing highly flexible streams. They can easily be decoded at any spatial resolution, different from the original image, and the bitstream can be truncated at any point to match diverse bandwidth requirements. The spatial adaptivity is shown to be more flexible and less complex than transcoding operations generally applied to state of the art codec bitstreams. Due to both its ability for capturing the most important parts of multidimensional signals, and a flexible stream structure, the image coder proposed in this paper represents an interesting solution for low to medium rate image coding in visual communication applications.     

Multiframe video coding for improved performance over wirelesschannels

We propose and evaluate a multi-frame extension to block motion compensation (BMC) coding of videoconferencing-type video signals for wireless channels. The multi-frame BMC (MF-BMC) coder makes use of the redundancy that exists across multiple frames in typical videoconferencing sequences to achieve additional compression over that obtained by using the single frame BMC (SF-BMC) approach, such as in the base-level H.263 codec. The MF-BMC approach also has an inherent ability of overcoming some transmission errors and is thus more robust when compared to the SF-BMC approach. We model the error propagation process in MF-BMC coding as a multiple Markov chain and use Markov chain analysis to infer that the use of multiple frames in motion compensation increases robustness. The Markov chain analysis is also used to devise a simple scheme which randomizes the selection of the frame (amongst the multiple previous frames) used in BMC to achieve additional robustness. The MF-BMC coders proposed are a multi-frame extension of the base level H.263 coder and are found to be more robust than the base level H.263 coder when subjected to simulated errors commonly encountered on wireless channels.     

局部非负稀疏编码的高光谱目标检测方法研究

基于稀疏编码的高光谱图像处理算法能够挖掘高光谱高维数据空间中潜在的数据相关性,能自然地贴近光谱信号的本质特征。本文提出基于非负稀疏编码的高光谱目标检测算法。与经典稀疏编码模型相比,非负稀疏编码对编码系数进行非负约束,一方面使得线性编码具有明确的物理解释,另一方面增强了系数的可分性与稳健性。算法首先通过双窗口设计构造局部动态字典,然后利用目标和背景在动态字典上编码的稀疏性差异进行阈值分割最后通过统计判决实现目标检测。仿真数据以及真实数据实验结果证明了算法的有效性。