A new approch to quad-tree analysis in EZW algorithm

TLDR: The developed scheme can be applied to any iterative zero-tree based image coding procedure and generates information bitwise variable values for the whole set of quad-tree roots and gathers data on the significance of respective descendants (wavelet coefficients comprising quad-trees on the view).

Abstract: In this paper, a new approach (scheme) to the analysis of quad-trees in the discrete wavelet spectrum of a digital image is proposed. The developed scheme can be applied to any iterative zero-tree based image coding procedure, i.e. to the EZW (embedded zero-tree wavelet) algorithm, to the SPIHT (set partitioning in hierarchical trees) algorithm, etc. The key point of the proposal - on each iteration, the scheme generates information bitwise variable values for the whole set of quad-tree roots (wavelet coefficients) and gathers data on the significance (with respect to a current threshold) of respective descendants (wavelet coefficients comprising quad-trees on the view). Exceptionally high-performance of the proposed approach is demonstrated using the EZW algorithm and the reversible Le Gall wavelet transform.