National Taiwan University Dept Commun EngnLin, Jian-LiangJian-LiangLinHwang, Wen-LiangWen-LiangHwangPei, Soo-ChangSoo-ChangPei2006-11-142018-07-052006-11-142018-07-052006-03http://ntur.lib.ntu.edu.tw//handle/246246/200611150121792Matching pursuit (MP) is a greedy algorithm that decomposes a signal into a linear combination of bases within an overcomplete dictionary. The MP algorithm is usually only approximated due to its massive computational complexity. By approximating a residual in a subspace, we propose a multiple blocks MP update algorithm for video coding that achieves a faster and better MP approximation than traditional algorithms. As the subspace is dependent on a residual, our algorithm is content-dependent. We evaluate the coding performance, including the peak signal-tonoise ratio, runtime, and subjective quality, of our algorithm and compare it with traditional MP algorithms.application/pdf898728 bytesapplication/pdfzh-TWContent based video codingfast algorithmmatching pursuit (MP)video codingjournal articlehttp://ntur.lib.ntu.edu.tw/bitstream/246246/200611150121792/1/1417.pdf