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.
The SPIHT is considered the premier state-of-the-art algorithm in image compression[citation needed], and has given excellent results in terms of compression performance for the natural images (and signals).
To get more information on spiht, on its other variants and for the source codes (read license agreements) please visit the Official Page of SPIHT in Rensselaer Polytechnic Institute.
[edit] References
[edit] See also
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
