Image sequence coding by split and merge

Author

Willemin, Patrice ; Reed, Todd R. ; Kunt, Murat

Author_Institution

Signal & Image Process. Lab., Swiss Federal Inst. of Technol., Lausanne, Switzerland

Volume

39

Issue

12

fYear

1991

fDate

12/1/1991 12:00:00 AM

Firstpage

1845

Lastpage

1855

Abstract

A method is described for reducing the information contained in an image sequence, while retaining the information necessary for the interpretation of the sequence by a human observer. The method consists of first locating the redundant information, reducing the degree of redundancy, and coding the result. The sequence is treated as a single 3D data volume, the voxels of which are grouped into several regions, obtained by a 3D split and merge algorithm. The information is coded by representing the borders of the regions using a pyramidal structure in the x, y, t space. The coefficients of the approximating polynomials are coded in a straightforward manner. For 256×256 pixel, 25 frame/s image sequences, compressions allowing transmission rates near 64 kbit/s are obtained

Keywords

data compression; encoding; picture processing; 256 pixels; 3D data volume; 3D split and merge algorithm; 64 Kbit/s; 65536 pixels; approximating polynomials; data compression; human observer; image sequence coding; pyramidal structure; redundant information; region borders; sequence interpretation; voxel regions; Bandwidth; Helium; Humans; ISDN; Image coding; Image processing; Image segmentation; Image sequences; Layout; Pixel; Polynomials;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.120170

Filename

120170