Hierarchical motion-compensated interframe DPCM algorithm for low-bit-rate coding

Statistics – Applications

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

The block-based motion estimation algorithm we have previously proposed possesses the advantages of a high estimation accuracy and a good prediction performance. It can efficiently be employed in a motion-compensated DPCM coder to minimize the data bits for the transmission of prediction errors. However, the motion overhead data rate, although it has been compressed dramatically by the coding method we proposed, is still too high to work at very low bit-rates like 64 kb/s. In this paper, a hierarchical motion-compensated interframe DPCM algorithm is presented to cope with low bit rates coding. In the meanwhile, the motion- compensated prediction error images are encoded by a hierarchical quadtree structure coder, which is more efficient and simpler than the commonly adopted DCT transform coding for the prediction errors. Experimental results show that an excellent performance has been obtained for very low bit rate coding. The signal-to-noise ratios of the reconstructed luminance images on average are about 37.5 to 38 db at 0.05 bits/pel and 38.7 to 39.5 db at 0.09 bits/pel for the sequences examined.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Hierarchical motion-compensated interframe DPCM algorithm for low-bit-rate coding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hierarchical motion-compensated interframe DPCM algorithm for low-bit-rate coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hierarchical motion-compensated interframe DPCM algorithm for low-bit-rate coding will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-1268928

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.