H04N 19/96 - Definition

Definition statement

This subclass covers:

Video compression using tree coding.

Two-dimensional tree coding is called quad-tree coding and is performed by partitioning an image or a video frame by recursively subdividing it into four quadrants or regions, until each region may be represented by a single colour or codeword, and coding the resulting tree data structure in which each internal node has exactly four children and each termination node (leaf) corresponds to a resulting region with the colour or codeword associated to it, cf. R. Finkel and J.L. Bentley (1974). "Quad Trees: A Data Structure for Retrieval on Composite Keys". Acta Informatica 4 (1): 1-9.

Tree coding in higher dimension is defined correspondingly (e.g. octree, performed in three-dimensions by subdivision into eight volumetric regions).

Informative references

Attention is drawn to the following places, which may be of interest for search:

Image coding using tree coding, e.g. quadtree, octree

G06T 9/40