Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Adaptive dictionaries for matching pursuit with seperable decomposition

Authors

[ 1 ] Instytut Elektroniki i Telekomunikacji (IEt), Wydział Elektryczny, Politechnika Poznańska | [ P ] employee

Year of publication

2005

Chapter type

paper

Publication language

english

Abstract

EN This paper presents a learning scheme for dictionaries of two-dimensional functions for matching pursuit applied in low-bitrate video coding. The motivation is to improve the coding performance of matching pursuit compression by adapting the structure of the dictionary functions to specific types of sequences. The proposed scheme is based on separable decomposition and vector quantization. The experiments with test video sequences prove that AVC/H.264 video encoder with the proposed variant of matching pursuit coding of interframe residual exhibits improved compression performance.

Pages (from - to)

1 - 4

URL

https://ieeexplore.ieee.org/document/7078484

Book

13th European Signal Processing Conference : EUSIPCO 2005

Presented on

13th European Signal Processing Conference EUSIPCO 2005, 4-8.09.2005, Antalya, Turkey

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.