A significant improvement of block-based motion estimation strategies is presented, which provides fast computation and very low bitrate coding. For each block, a spatio-temporal context is defined based on nearest neighbors in the current and previous frames, and a prediction list is built. Then, the best matching vector within the list is chosen as an estimation of the block motion. Since coder and decoder are synchronous, only the index of the selected vector is needed at the decoder to reconstruct the motion field. To avoid the propagation of the error, an additional correction vector can be sent when prediction error exceeds a threshold. Furthermore, bitrate saving is achieved through an adaptive sorting of the prediction list of each block, which allows to reduce the entropy of the motion indexes. Tests demonstrate that the proposed method ensures a speed up over 1:200 as compared to full search, and a coding gain above 2, with a negligible loss of accuracy. This allows real-time implementation of VLBR software video coders on conventional PC platforms.

Low-Complexity Context-Based Motion Compensation for VLBR Video Encoding / De Natale, Francesco G. B.; Granelli, Fabrizio. - ELETTRONICO. - (2002).

Low-Complexity Context-Based Motion Compensation for VLBR Video Encoding

Granelli, Fabrizio
2002-01-01

Abstract

A significant improvement of block-based motion estimation strategies is presented, which provides fast computation and very low bitrate coding. For each block, a spatio-temporal context is defined based on nearest neighbors in the current and previous frames, and a prediction list is built. Then, the best matching vector within the list is chosen as an estimation of the block motion. Since coder and decoder are synchronous, only the index of the selected vector is needed at the decoder to reconstruct the motion field. To avoid the propagation of the error, an additional correction vector can be sent when prediction error exceeds a threshold. Furthermore, bitrate saving is achieved through an adaptive sorting of the prediction list of each block, which allows to reduce the entropy of the motion indexes. Tests demonstrate that the proposed method ensures a speed up over 1:200 as compared to full search, and a coding gain above 2, with a negligible loss of accuracy. This allows real-time implementation of VLBR software video coders on conventional PC platforms.
2002
Trento, Italia
Università degli Studi di Trento. DEPARTMENT OF INFORMATION AND COMMUNICATION TECHNOLOGY
Low-Complexity Context-Based Motion Compensation for VLBR Video Encoding / De Natale, Francesco G. B.; Granelli, Fabrizio. - ELETTRONICO. - (2002).
De Natale, Francesco G. B.; Granelli, Fabrizio
File in questo prodotto:
File Dimensione Formato  
03.PDF

accesso aperto

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 153.71 kB
Formato Adobe PDF
153.71 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/358370
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact