Inst. of Commun. Eng., National Taiwan Univ.J. L. LinW. L. HwangSOO-CHANG PEI2018-09-102018-09-102005-0915224880http://scholars.lib.ntu.edu.tw/handle/123456789/317600https://www.scopus.com/inward/record.uri?eid=2-s2.0-33749595636&doi=10.1109%2fICIP.2005.1530041&partnerID=40&md5=27d854783c36084cb71e5b24569f531fMatching 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.application/pdf177652 bytesapplication/pdfMatching pursuit (MP) video coding; Multiple blocks; Subspaces; Update algorithms; Algorithms; Approximation theory; Block codes; Computational complexity; Image processing; Image codingconference paper10.1109/ICIP.2005.15300412-s2.0-33749595636