Multiple blocks matching pursuit update algorithm for low bit rate video coding

Matching pursuit (MP) is a greedy algorithm that decomposes a signal into a linear combination of bases within an over-complete 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-to-noise ratio, runtime, and subjective quality, of our algorithm and compare it with traditional MP algorithms.