Video coding using a fast non-separable matching pursuits algorithm

This paper presents a fast matching pursuits algorithm. In addition to a fast implementation, the algorithm also allows the efficient use of non-separable dictionary basis functions. The use of non-separable components allows basis functions which provide a better match to diagonally orientated imag...

Full description

Saved in:
Bibliographic Details
Main Authors: Redmill, D.W., Bull, D.R., Czerepinki, P.
Format: Conference Proceeding
Language:English
Subjects:
Bit rate
Decoding
Dictionaries
Encoding
Equations
Error correction codes
Iterative algorithms
Matching pursuit algorithms
Pursuit algorithms
Video coding
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a fast matching pursuits algorithm. In addition to a fast implementation, the algorithm also allows the efficient use of non-separable dictionary basis functions. The use of non-separable components allows basis functions which provide a better match to diagonally orientated image features. In order to demonstrate the proposed method, a simple dictionary is developed and used. Even without any sophisticated entropy coding, the proposed system gives performance exceeding that of H.263.
DOI:10.1109/ICIP.1998.723608