State of the art video compression algorithms use motion compensation. Using such method gives better results by increasing the temporal correlation between pixels from consecutive frames. Most of the effort in increasing the performance of existing algorithms concentrates on the improvement of motion vector uses and residual coding. In this paper we propose a motion vectors computation and coding scheme for video compression which combines constrained block matching and scalable coding based on a three-step search-like decomposition.
Scalable context-based motion vector coding for video compression
Cagnazzo M.;
2003
Abstract
State of the art video compression algorithms use motion compensation. Using such method gives better results by increasing the temporal correlation between pixels from consecutive frames. Most of the effort in increasing the performance of existing algorithms concentrates on the improvement of motion vector uses and residual coding. In this paper we propose a motion vectors computation and coding scheme for video compression which combines constrained block matching and scalable coding based on a three-step search-like decomposition.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
