Video compression based on orthonormal matching pursuits
Video coding schemes based on matching pursuits have been shown to have better coding efficiency and perceptual quality at low bit rates than DCT-based video coding schemes. Matching pursuit is a greedy algorithm that decomposes a signal into a linear combination of bases within an over complete dictionary. However, as the bases are not independent, the redundancy in linear combinations increases as the number of iterations of matching pursuit increases. In this paper, we introduce an orthonormal matching pursuit algorithm that reduces the redundancy between bases and represents a signal by a linear combination of bases more efficiently. Our proposed updated full search matching pursuit algorithm has been shown to be effective in both coding performance and computational complexity. Based on this algorithm, we present an orthonormal matching pursuit video coding scheme that achieves a more efficient coding performance. The coding efficiency and perceptual quality are evaluated and compared to traditional matching pursuit video coding schemes