Set partitioning in hierarchical trees
From Wikipedia, the free encyclopedia
Set partitioning in hierarchical trees (SPIHT)[1] is an image compression algorithm that exploits the inherent similarities across the subbands in a wavelet decomposition of an image.
[edit] General description
The algorithm codes the most important wavelet transform coefficients first, and transmits the bits so that an increasingly refined copy of the original image can be obtained progressively.
[edit] References
- ^ Said, Amir; Pearlman, William A. (June 1996). "A new fast and efficient image codec based on set partitioning in hierarchical trees". IEEE Transactions on Circuits and Systems for Video Technology 6 (3): 243–250. doi:10.1109/76.499834. ISSN 1051-8215.
[edit] See also
|
||||||||||||||||||||||||||||||||||||||||||||||||||||
