By Topic

Coding of image sequences using coarse quantization and feature based hierarchical block matching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lai, M.M.L. ; Cambridge Univ., UK ; Kingsbury, N.G.

Today, there are many different algorithms for compression of images and image sequences. They can be categorized into different types according to Netravali and Limb (1980). One of the coding methods under the group `other methods' is contour coding methods. Contour coding methods, or coarse quantization methods, for image coding have been investigated since the early 1960's. In 1961, Gabor and Hill proposed a one dimensional contour coding method for encoding television signals. In 1967, Graham introduced a two-dimensional contour coding scheme. In the paper, a three-dimensional contour coding scheme is proposed, with the third dimension being the temporal dimension. A feature based motion compensation technique is used to exploit the temporal redundancies of image sequences. This coding scheme is directed at transmission rates of 64 kbits per second or lower. The artifacts introduced by this coding scheme are significantly different from those of typical DCT or subband coding schemes

Published in:

Image Processing and its Applications, 1992., International Conference on

Date of Conference:

7-9 Apr 1992