By Topic

Transform/Time domain coding using the method of projection onto convex sets

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
$33 $13
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)
Faryar, A. ; North Carolina State University, Raleigh, North Carolina ; Rajala, S.A.

In image coding, image information can often be transmitted with relatively little bandwidth requirement. This is the case in the pixel domain if there are large blocks of homogeneous intensity within a single frame, or when comparing adjacent frames there are large blocks of unchanged pixels. In the frequency domain, this is the case when only a few of the frequency coefficients are deemed significant. This paper presents an algorithm for improving the bandwidth compression of the error pattern generated by typical motion-compensated coding techniques. The algorithm involves two well established techniques; conventional transform coding and the method of successive Projection onto Convex Sets.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '85.  (Volume:10 )

Date of Conference:

Apr 1985