This paper proposes an enhanced method for multiple description coding (MDC) using whitening transform. The MDC using correlating transform is an error resilient coding technique that explicitly adds correlation between two descriptions to enable the estimation of one set from the other when one set is dropped in channel. This paper proposes a method to overcome practical problems that decoder must know statistics of original image in the conventional correlating transform method. The MDC using whitening transform does not need additional statistical information to reconstruct a image because the coefficients whitening transformed have uni-variance statistics. Our experimental results show that the proposed method achieves a good trade-off between the coding efficiency and the reconstruction quality. We obtain that PSNR of image reconstructed from two descriptions is about 0.93 dB higher at the 1.0BPP and PSNR from only one description is about 1.88 dB higher than conventional method at the same rate of 'Lena' image.

The technique of the digital watermarking is one of the ways to resolve copyright ownership and verify originality of digital contents (e.g. text documents, audio, still images, video, etc.). In this paper, we obtained global robustness and minimal error through using frame based watermarking and including DC and AC coefficients of DCT transform, which extended conventional watermarking method having local robustness and error through using block based and/or AC coefficients only. As a result, the high robustness and quality of our method were proved by several attacks such as lossy image compression, linear filtering, additive noise, scaling, cropping and so on. Watermarks embedded by our method are survived most of JPEG compressions.

Traditional watermarking methods based on spectrum manipulation use watermark bit as a colored noise. However, those methods show poor robustness for filtering and audio compression because of only a few spectrum coefficients being modified. In this paper, we propose a new algorithm for robust audio watermarking by using spectrum warping. Our watermark-embedding scheme is not based on spectrum coefficient manipulation, but based on warping spectrum that shifts a block of spectrum coefficients nonlinearly. The host audio signal is divided appropriately into small segments and then a non-orthogonal transform, such as bi-linear transform, is used for each segment to embed as well as to extract watermarks. Because the proposed scheme uses small segment length, we can afford to embed signature information many times into audio signal without severe degradation of SNR. Our multiple embedding scheme increases robustness against abnormal distortion of watermarked signal and has no bit error rate in MPEG1 Layer-3 128 kbps and 96 kbps compression as well as low/high pass filtering.

This paper proposes a new method, EC-MDC that can detect and correct bit errors in the bitstream generated by multiple description coding. The proposed method generates two sub-bitstreams having a few redundancies as much as conventional multiple description coding. If a sub-bitstream at one side has bit error, the bit error can be corrected by using sub-bitstream of the other side. In BER-SNR experiments, reconstruction quality of the proposed method shows about 11dB higher than that of the conventional MDC at BER < 10-3 when a sub-bitstream is corrupted.

Many image and video compression algorithms work by splitting the image into blocks and producing variable-length code bits for each block data. If variable-length code data are transmitted consecutively over error-prone channel without any error protection technique, the receiving decoder cannot decode the stream properly. So the standard image and video compression algorithms insert some redundant information into the stream to provide some protection against channel errors. One of such redundancy is resynchronization marker, which enables the decoder to restart the decoding process from a known state in the event of transmission errors, but its frequent use should be restricted not to consume bandwidth too much. The Error Resilient Entropy Code (EREC) is well known method which can regain synchronization without any redundant information. It can work with the overall prefix codes, which many image compression methods use. This paper proposes an improvement to FEREC (Fast Error-Resilient Entropy Coding). It first calculates initial searching position according to bit lengths of consecutive blocks. Second, initial offset is decided using statistical distribution of long and short blocks, and initial offset is adjusted to insure all possible offset value can be examined. The proposed algorithm can speed up the construction of EREC slots, and can preserve compressed image quality in the event of transmission errors. The simulation result shows that the quality of transmitted image is enhanced about 0.3-3.5 dB compared with the existing FEREC when random channel error happens.