A hierarchical coding of reduced picture information

The coding of a reduced amount of picture information for a high speed transmission is discussed. The authors present a recursive algorithm ZETA, which scans the elements of a 2-D picture P(N,N) implementing the basis of a hierarchical pyramid. A simple average procedure is also provided, which accepts as input the N² pixels produced by the ZETA algorithm and constructs the exponential pyramid data structure of (4N²-1)/3 elements for the picture P. This pyramidal scheme is used to produce the minimal picture tree by applying the regular decomposition methodology. A hierarchical orthogonal transformation is applied on the minimal picture tree realizing the reduced picture coding