In many hybrid video compression algorithms there is a clear distinction between motion estimation and compensation (MEMC) on the one hand, and transform coding of the residue on the other hand. By translating MEMC into the framework of matching pursuit (MP), we will show that unification of both steps is possible. Moreover, adapting the MP approach to the small size dictionaries involved in MEMC, it is shown that unification may in principle lead to a better performance of hybrid coding schemes. We close with a discussion on the practical obstacles of the technique, and how to avoid them.<>
Matching pursuit for compression and application to motion compensated video coding
Proceedings of 1st International Conference on Image Processing ; 1 ; 725-729 vol.1
1994-01-01
506350 byte
Conference paper
Electronic Resource
English
Matching Pursuit for Compression and Application to Motion Compensated Video Coding
British Library Conference Proceedings | 1994
|Tree Based Motion Compensated Video Coding
British Library Conference Proceedings | 1994
|Tree based motion compensated video coding
IEEE | 1994
|Multiple Blocks Update Algorithm for Matching Pursuit Video Coding
British Library Conference Proceedings | 2005
|