Science Fair Project Encyclopedia
SPIHT (Set Partition in Hierarchical Trees) is an image compression algorithm that exploits the inherent similarities across subbands in a wavelet decomposition of an image. It implies uniform quantization and bit allocation applied after wavelet decomposition.
The algorithm codes the most important (in the sense of MSE reduction) wavelet transform coefficients in priority, and transmits the bits so that an increasingly refined copy of the original image is obtained with time.
The order in which coefficients are transmitted is recovered on the decoder using information of comparisons and sets being examined for significance during the sort, sets are created using hierarchical tree structure, i.e. Set Partition in Hierarchical Trees.
One of the advantages with SPIHT is that it produces an (optimal) embedded bitstream. This means that the bitstream can be truncated at any instant, and is then guaranteed to yield the best possible reconstruction.
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details