N.M. Rajpoot, F.G. Meyer, R.G. Wilson, and R.R. Coifman, "Wavelet packet image coding using compatible zerotree quantization," Tech. Rep., YALEU/DCS/RR1187, Deptt. of Comp. Sc., Yale Uni., USA, Sep. 1999.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A New Basis Selection Paradigm for Wavelet Packet Image.. - Rajpoot, Wilson, Meyer.. (2001) (2 citations) Self-citation (Rajpoot Meyer Wilson Coifman) (Correct)
No context found.
N.M. Rajpoot, F.G. Meyer, R.G. Wilson, and R.R. Coifman, "Wavelet packet image coding using compatible zerotree quantization," Tech. Rep., YALEU/DCS/RR1187, Deptt. of Comp. Sc., Yale Uni., USA, Sep. 1999.
Adaptive Wavelet Packet Basis Selection for Zerotree.. - Rajpoot, Wilson.. (2003) Self-citation (Rajpoot Meyer Wilson Coifman) (Correct)
No context found.
N. M. Rajpoot, F. G. Meyer, R. G. Wilson, and R. R. Coifman, "Wavelet Packet Image Coding Using Compatible Zerotree Quantization," Dept. Comput. Sci., Yale Univ., New Haven, CT, YALEU/DCS/RR-1187, Sept. 1999.
On Zerotree Quantization for Embedded Wavelet Packet Image.. - Rajpoot Meyer Wilson (1999) (5 citations) Self-citation (Rajpoot Meyer Coifman) (Correct)
....nearest scale and having the nearest orientation, and glues the bunch under this newly found compatible parent. The parent offspring dependencies for the primary compatible zerotree T 1 are shown in Figure 1. For more details of the algorithm to construct the compatible zerotrees, please refer to [5]. Given an arbitrarily segmented wavelet packet basis, the compatible zerotrees are constructed using the set of rules described as above. In order to be able to make predictions for wavelet packet coefficients at finer scale subbands, the compatible zerotree hypothesis is defined as follows: If ....
.... requires only one list of detected coefficients (LDC) to be maintained, as opposed to two (three) lists kept by the EZW (SPIHT) The decoder first reads geometry of the best basis and generates the compatible zerotrees, and then proceeds by entropy decoding and interpreting the codewords (see [5] for more details of the algorithm) 4 Experiments and Conclusions The idea of compatible zerotree quantization was coupled with the wavelet packet transform for progressive image coding and its performance was tested against the fast adaptive wavelet packet (FAWP) 4] image codec algorithm. A ....
N.M. Rajpoot, F.G. Meyer, and R.R. Coifman, Wavelet packet image coding using compatible zerotree quantization, Technical Report, Dept. of Computer Science, Yale University, New Haven (1999).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC