Lattice Vector Quantization Applied to Speech and Audio Coding

Lattice vector quantization(LVQ) has been used for real-time speech and audio coding systems.Compared with conventional vector quantization,LVQ has two main advantages:It has a simple and fast encoding process,and it significantly reduces the amount of memory required.Therefore,LVQ is suitable for use in low-complexity speech and audio coding.In this paper,we describe the basic concepts of LVQ and its advantages over conventional vector quantization.We also describe some LVQ techniques that have been used in speech and audio coding standards of international standards developing organizations(SDOs).     

Sample selection for visual domain adaptation via sparse coding

Visual domain adaptation has attracted much attention and has made great achievement in recent years. It deals with the problem of distribution divergence between source and target domains. Current methods mostly focus on transforming images from different domains into a common space to minimize the distribution divergence. However, there are many irrelevant source samples for target domain even after the transformation. In order to eliminate the irrelevant samples, we develop a sample selection algorithm using sparse coding theory. We do the sample selection in a common subspace of source and target data to find as many as relevant source samples. In the common subspace, data characteristics are preserved by using graph regularization. Therefore, we can select the most relevant samples for our target image classification task. Moreover, in order to build a discriminative classifier for the target domain, we use not only the common part of source and target domains learned in the common subspace but also the specific part of target domain. The algorithm can be extended to handle samples from multiple source domains. Experimental results show that our visual domain adaptation method on the image classification tasks can be very effective for the state-of-the-art datasets.     

A new coding scheme of QC-LDPC codes for optical transmission systems

Based on Galois Field (GF(q)) multiplicative group, a new coding scheme for Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes is proposed, and the new coding scheme has some advantages such as the simpler construction, the easier implementation encoding, the lower complexity of the encoding and decoding, the more flexible adjustment of the code length as well as the code rate and so forth. Under the condition of considering the characteristics of optical transmission systems, an irregular QC-LDPC (3843,3603) code to be suitable for optical transmission systems is constructed by applying the proposed new coding scheme. The simulation result shows that the net coding gain (NCG) of the irregular QC-LDPC (3843,3603) code is respectively improved 2.14 dB, 1.19 dB, 0.24 dB and 0.14 dB more than those of the classic RS (255,239) code in ITU-T G.975, the LDPC (32640,30592) code in ITU-T G.975.1, the regular SCG-LDPC (3969,3720) code constructed by the Systematically Constructed Gallager (SCG) coding scheme and the regular QC-LDPC (4221,3956) code at the bit error rate (BER) of 10-8. Furthermore, all the five codes have the same code rate of 93.7%. Therefore, the irregular QC-LDPC (3843,3603) code constructed by the proposed new coding scheme has the more excellent error-correction performance and can be better suitable for optical transmission systems.     

Improved macroblock level rate control for the spatially scalable extension of H.264/AVC

An improved rate control algorithm, designed for scalable video coders incorporating interlayer prediction, is proposed. Firstly, a Rate Distortion (RD) model for interlayer prediction involving the spatial enhancement layers is devised. An optimised Mean Absolute Difference (MAD) prediction model for the spatial enhancement layers that considers both the MAD from the spatial base layer in the same frame and the MAD from the corresponding macroblock in previous frames is also proposed. Simulation results show that the resulting algorithm produces accurate rate control with an average bit rate error of less than 0.26%. Compared with the JVT-W043 default rate control algorithm of the JSVM, the proposed algorithm improves the average PSNR by up to 0.53 dB or reduces the bit rate by an average of 10.95%. Furthermore, the proposed algorithm can be combined with the existing rate control scheme for H.264/AVC, resulting in further improvements.     

Temporal information based GoP adaptation for linear video delivery schemes

An original wireless video transmission scheme called SoftCast has been recently proposed to deal with the issues encountered in conventional wireless video broadcasting systems (e.g. cliff effect). In this paper, we evaluate and optimize the performance of the SoftCast scheme according to the transmitted video content. Precisely, an adaptive coding mechanism based on GoP-size adaptation, which takes into account the temporal information fluctuations of the video, is proposed. This extension denoted Adaptive GoP-size mechanism based on Content and Cut detection for SoftCast (AGCC-SoftCast) significantly improves the performance of the SoftCast scheme. It consists in modifying the GoP-size according to the shot changes and the spatio-temporal characteristics of the transmitted video. When hardware capacities, such as buffer or processor performance are limited, an alternative method based only on the shot changes detection (AGCut-SoftCast) is also proposed. Improvements up to 16 dB for the PSNR and up to 0.55 for the SSIM are observed with the proposed solutions at the cut boundaries. In addition, temporal visual quality fluctuations are reduced under 1dB in average, showing the effectiveness of the proposed methods.     

A novel chaotic image encryption scheme using DNA sequence operations

In this paper, we propose a novel image encryption scheme based on DNA (Deoxyribonucleic acid) sequence operations and chaotic system. Firstly, we perform bitwise exclusive OR operation on the pixels of the plain image using the pseudorandom sequences produced by the spatiotemporal chaos system, i.e., CML (coupled map lattice). Secondly, a DNA matrix is obtained by encoding the confused image using a kind of DNA encoding rule. Then we generate the new initial conditions of the CML according to this DNA matrix and the previous initial conditions, which can make the encryption result closely depend on every pixel of the plain image. Thirdly, the rows and columns of the DNA matrix are permuted. Then, the permuted DNA matrix is confused once again. At last, after decoding the confused DNA matrix using a kind of DNA decoding rule, we obtain the ciphered image. Experimental results and theoretical analysis show that the scheme is able to resist various attacks, so it has extraordinarily high security.     

CARTscans: A Tool for Visualizing Complex Models

We present CARTscans, a graphical tool that displays predicted values across a fourdimensional subspace. We show how these plots are useful for understanding the structure and relationships between variables in a wide variety of models, including (but not limited to) regression trees, ensembles of trees, and linear regressions with varying degrees of interactions. In addition, the common visualization framework allows diverse complex models to be visually compared in a way that illuminates the similarities and differences in the underlying methods, facilitates the choice of a particular model structure, and provides a useful check for implausible predictions of future observations in regions with little or no data.     

Noise Feedback Coding Revisited： Refurbished Legacy Codecs and New Coding Models

Noise feedback coding(NFC) has attracted renewed interest with the recent standardization of backward-compatible enhancements for ITU-T G.711 and G.722.It has also been revisited with the emergence of proprietary speech codecs,such as BV16,BV32,and SILK,that have structures different from CELP coding.In this article,we review NFC and describe a novel coding technique that optimally shapes coding noise in embedded pulse-code modulation(PCM) and embedded adaptive differential PCM(ADPCM).We describe how this new technique was incorporated into the recent ITU-T G.711.1,G.711 App.III,and G.722 Annex B(G.722B) speech-coding standards.     

Efficient disparity vector prediction schemes with modified P frame for 2D camera arrays

An efficient disparity estimation algorithm for multi-view video sequences, recorded by a two-dimensional camera array in which the cameras are spaced equidistantly, is presented. Because of the strong geometrical relationship among views, the disparity vectors of a certain view can for most blocks be derived from the disparity vectors of other views. A frame constructed using that idea is called a D frame in this work. Three new prediction schemes which contain D frames are proposed for encoding 5 × 3 multi-view video sequences. The schemes are applied to several multi-view image sequences taken from a camera-array and they are compared in terms of quality, bit-rate and complexity. The experimental results show that the proposed prediction schemes significantly decrease the complexity of the encoder at a very low cost of quality and/or bit-rate.