Share Email Print
cover

Proceedings Paper

Optimal decomposition for quad-trees with leaf dependencies
Author(s): Guido M. Schuster; Aggelos K. Katsaggelos
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

We propose a fast and efficient algorithm which finds the optimal quad-tree (QT) decomposition with leaf dependencies in the rate distortion sense. The underlying problem is the encoding of an image by a variable block size scheme, where the block size in encoded using a QT, each block is encoded by one of the admissible quantizers and the quantizers are transmitted using a first order differential pulse code modulation (DPCM) scheme along the scanning path. First we define an optimal scanning path for a QT such that successive blocks are always neighboring blocks. Then we propose a procedure which infers such an optimal path from the QT-decomposition and introduce a special optimal path which is based on a Hilbert curve. Then we consider the case where the image is losslessly encoded using a QT- decomposition and the optimal quantizer selection. We then apply the Lagrangian multiplier method to solve the lossy case, and show that the unconstrained problem of the Lagrangian multiplier method can be solved using the algorithm introduced for the lossless case. Finally we present a mean value QT-decomposition example, where the mean values are DPCM encoded.

Paper Details

Date Published: 10 January 1997
PDF: 12 pages
Proc. SPIE 3024, Visual Communications and Image Processing '97, (10 January 1997); doi: 10.1117/12.263281
Show Author Affiliations
Guido M. Schuster, U.S. Robotics (United States)
Aggelos K. Katsaggelos, Northwestern Univ. (United States)


Published in SPIE Proceedings Vol. 3024:
Visual Communications and Image Processing '97
Jan Biemond; Edward J. Delp, Editor(s)

© SPIE. Terms of Use
Back to Top