Multiresolution motion compensation coding for video compression

Motion estimation using block matching algorithm (BMA) is frequently used to reduced the temporal redundancy found in video coding. The performance of the mean squared error (MSE) is usually better than the mean absolute difference (MAD). However, the computational complexity is higher due to the squaring operations. In this paper, we propose a multiple candidates approach to shorten the gap between the two methods with slight increase in computational complexity. Application of the proposed algorithm to subband motion-estimation is studied and simulation results demonstrate that great improvement in performance can be obtained with similar computational complexity as the MAD measure.published_or_final_versio

Codificador de vídeo baseado na transformada de ôndulas 3D

Neste artigo apresenta-se um codificador de vídeo baseado na transformada de ôndulas, com interface do tipo Windows®, desenvolvido em Borland C++ Builder v5.0. O codificador tira partido das características da estrutura hierárquica 3D de coeficientes da DWT, resultante da sua aplicação no domínio do tempo e do espaço. O utilizador escolhe a sequência a codificar (armazenada em ficheiro), o número de tramas, o nível de decisão, e a ôndula a considerar na DWT no espaço, podendo obter resultados do desempenho do codificador, e guardar esses valores em ficheiros compatíveis com Microsoft® Excel. Pode, também, visualizar alguns resultados intermédios do processo de codificação, nomeadamente a decomposição por aplicação da DWT no tempo e no espaço, conferindo a este trabalho, também, um cariz didáctico

Evaluation of transform based image coders, using different transforms and techniques in the transform domain

This paper addresses the most relevant aspects of lossy image coding techniques, and presents an evaluation study on this subject, using several transforms and different methods in the transform domain. We developed different transform based image coders/decoders (codecs) using different transforms, such as the discrete cosine transform, the discrete wavelet transform and the S transform. Besides JPEG Baseline, we also use other techniques and methods in the transform domain such as a DWT based JPEG-like (JPEG DWT), a JPEG DWT with visual threshold (JPEG-VT), a JPEG–like coder based on the ST, and an EZW coder. The codecs were programmed in MATLAB™, using custom and built-in functions. The structures of the codecs are presented, also as some experimental results which allow us evaluate them, and support this study

Lossy to lossless object-based coding of 3-D MRI data

We propose a fully three-dimensional object-based coding system exploiting the diagnostic relevance of the different regions of the volumetric data for rate allocation. The data are first decorrelated via a 3D discrete wavelet transform. The implementation via the lifting steps scheme allows to map integer-to-integer values, enabling lossless coding, and facilitates the definition of the object-based inverse transform. The coding process assigns disjoint segments of the bitstream to the different objects, which can be independently accessed and reconstructed at any up-to-lossless quality. Two fully 3D coding strategies are considered: Embedded Zerotree Coding (EZW-3D) and Multidimensional Layered Zero Coding (MLZC), both generalized for Region of Interest (ROI) based processing. In order to avoid artifacts along region boundaries, some extra coefficients must be encoded for each object. This gives rise to an overheading of the bitstream with respect to the case where the volume is encoded as a whole. The amount of such extra information depends on both the filter length and the decomposition depth. The system is characterized on a set of head magnetic resonance images. Results show that MLZC and EZW-3D have competitive performances. In particular, the best MLZC mode outperforms the other state-of-the-art techniques on one of the datasets for which results are available in the literature

Video Coding with Motion-Compensated Lifted Wavelet Transforms

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 experimental results to that of a predictive video codec with single-hypothesis motion compensation and comparable computational complexity. The experiments show that the 5/3 wavelet kernel outperforms both the Haar kernel and, in many cases, the reference scheme utilizing single-hypothesis motion-compensated predictive coding. The theoretical investigation models this motion-compensated subband coding scheme for a group of K pictures with a signal model for K motion-compensated pictures that are decorrelated by a linear transform. We utilize the Karhunen-Loeve Transform to obtain theoretical performance bounds at high bit-rates and compare to both optimum intra-frame coding of individual motion-compensated pictures and single-hypothesis motion-compensated predictive coding. The investigation shows that motion-compensated three-dimensional transform coding can outperform predictive coding with single-hypothesis motion compensation by up to 0.5 bits/sample