Sciweavers

ICIP
2002
IEEE

Matching pursuits video coding using generalized bit-planes

14 years 5 months ago
Matching pursuits video coding using generalized bit-planes
The Matching Pursuits (MP) coding method has been employed successfully in video coding. In it, the motion compensated frame difference is decomposed on an overcomplete dictionary of atoms, generating a sequence of pairs specifying the atoms used and their corresponding coefficients. A particular rate ?distortion trade-off is achieved by setting both the number of atoms and the quantizers of their coefficients. Several strategies have been presented in order to set this trade-off. In this paper we propose a novel method for performing matching pursuits quantization, based on the notion of decomposition in generalized bit-planes. Such decompositions generate just a sequence of indexes. They provide an elegant solution to the trade-off between quantization of coefficients and number of passes in the MP algorithm. We show that they can be regarded as generalizations of decompositions followed by linear quantization of the coefficients. In addition, we state a theorem that sets bounds for...
Alexandre G. Ciancio, Eduardo A. B. da Silva, Rog&
Added 24 Oct 2009
Updated 24 Oct 2009
Type Conference
Year 2002
Where ICIP
Authors Alexandre G. Ciancio, Eduardo A. B. da Silva, Rogèrio Caetano
Comments (0)