Video coding using a fast non-separable matching pursuits algorithm

D.W. Redmill, David Bull, P. Czerepinki · 2002

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.

Read the paper · More papers on PaperTik