The paper compares the novel method of position based coding scheme introduced recently by the authors with Huffman coding results. The results show that Position Based Coding Scheme (PBCS) is superior in terms of image compression ratio and PSNR. In PBCS, by identifying the unique elements and by reducing redundancies the coding has been performed. The results of JPEG2000 image compression wit...

This article explores the efficiency of motion-compensated three-dimensional transform coding, a compression scheme that employs a motion-compensated transform for a group of pictures. We investigate this coding scheme experimentally and theoretically. The practical coding scheme employs in temporal direction a wavelet decomposition with motion-compensated lifting steps. Further, we compare the...

Different visual perception characteristic saliencies are the key to constitute the low-complexity video coding framework. A hierarchical video coding scheme based on human visual systems (HVS) is proposed in this paper. The proposed scheme uses a joint video coding framework consisting of visual perception analysis layer (VPAL) and video coding layer (VCL). In VPAL, effective visual perception...

We present a new image coding scheme based on an unification of fractal and transform coding. We introduce a generalization of the luminance transformation used by fractal coding schemes. By extending the luminance transformation to the frequency domain, fractal and transform coding become subsets of the proposed transformation. Our new coding scheme FTC (fractal based transform coding) combine...

In this paper, we proposed a flexible and efficient architecture for scalable video coding, namely, the macroblock (MB)-based progressive fine granularity scalable video coding with temporalSNR scalabilities (PFGST in short). The proposed architecture can provide not only much improved coding efficiency but also simultaneous SNR scalability and temporal scalability. Building upon the original f...

We investigate the superposition strategy and its usefulness in terms of achievable information theoretic rates. The achievable rate of the superposition of block Markov encoding (decode-forward) and side information encoding (compress-forward) for the three-node Gaussian relay channel is analyzed. It is generally believed that the superposition can out perform decode-forward or compress-forwar...

A novel DC-free binary convolutional coding scheme is presented. The proposed scheme achieves the DC-free and error correcting capability simultaneously. The scheme has a simple cascaded structure of the RDS(running digital sum) control encoder and the conventional convolutional encoder. A given sequence becomes DC-free if and only if the absolute RDS value of the sequence is bounded by a const...

In this study, the problem of transmitting an independent and identically distributed (i.i.d.) Gaussian source over an i.i.d. Gaussian wire-tap channel, with an i.i.d. Gaussian known interference available at the transmitter is considered. The intended receiver is assumed to have a certain minimum signal-to-noise ratio (SNR) and the eavesdropper is assumed to have a strictly lower SNR compared ...

The side-match finite-state vector quantization (SMVQ) schemes improve performance over the vector quantization by exploiting the neighboring vector correlations within the image. In this paper, we propose a neural network side-match finite-state vector quantization (NN-SMVQ) scheme that combines the techniques of neural network prediction and the SMVQ coding method. In our coding scheme, the m...

A new achievability scheme for the compound channel with discrete memoryless (DM) state noncausally available at the encoder is established. Achievability is proved using superposition coding, Marton coding, joint typicality encoding, and indirect decoding. The scheme is shown to achieve strictly higher rate than the straightforward extension of the Gelfand-Pinsker coding scheme for a single DM...