LOW BIT-RATE IMAGE SEQUENCE CODING USING SPATIAL DECOMPOSITION

The technique described has been developed from the still-picture version of the recursive binary nesting algorithm to code moving image sequences efficiently at low bit rates. The technique, based on quad-tree decomposition and spatial interpolation, had to be modified from its previous form so that it could make use of the additional time-axis redundancy available in a moving sequence, and also to remove a number of disturbing artifacts that were initially present. Once these topics were successfully dealt with, aspects of coding efficiency were considered by concentrating on controlling the degree of image decomposition. Details of these techniques are described in the paper, which concludes with comparisons with other coding techniques.