Skip to Main Content
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.