In this paper, a segmentation-based subband video coding algorithm is proposed. In this algorithm, each encoding frame is first compared with the associated prediction frame (outputed from a motion estimation based predictor) and the variant blocks (those blocks with variation larger than a given threshold) in the encoding frame are located. And the successive QMF decompositions and entropy coding are applied to encode each variant block. Simulations show that, by using the proposed coding scheme, the picture quality of the reconstructed frames is better than that of the other two well-known subband coding schemes while the resultant data rates are nearly the same. The computational complexities involved in the proposed approach are also shown to be less than that of the others. Moreover, the segmented nature of the proposed algorithm makes it more suitable for parallel implementation.

Date Published: 21 April 1995
PDF: 11 pages
Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); doi: 10.1117/12.206687

Published in SPIE Proceedings Vol. 2501:
Visual Communications and Image Processing '95
Lance T. Wu, Editor(s)