Multiple blocks update algorithm for matching pursuit video Coding
Journal
Proceedings - International Conference on Image Processing, ICIP
Journal Volume
2
Pages
261-264
Date Issued
2005-09
Author(s)
Abstract
Matching pursuit (MP) video coding has been demonstrated to attain a better coding performance than DCT-based video coding in terms of PSNR and perceptual quality at very low bit rates. However, because of its massive computational complexity, the MP algorithm is usually only approximated. By approximating a residual in a subspace, we propose a multiple blocks search and update algorithm in MP video coding to achieve a faster and better MP approximation. In this paper, we evaluate the performance and compare it to the traditional one-block search algorithms. The experimental results show that our proposed algorithm can significantly improve the coding performance and encoding time. © 2005 IEEE.
Other Subjects
Matching pursuit (MP) video coding; Multiple blocks; Subspaces; Update algorithms; Algorithms; Approximation theory; Block codes; Computational complexity; Image processing; Image coding
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
01530041.pdf
Size
173.49 KB
Format
Adobe PDF
Checksum
(MD5):6a4dc59174c4a6296b065501b63b49f1