Set partitioning in hierarchical trees
Set partitioning in hierarchical trees (SPIHT)[1][2] is an image compression algorithm that exploits the inherent similarities across the subbands in a wavelet decomposition of an image.
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.
See also
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.
- ↑ http://reference.kfupm.edu.sa/content/n/e/a_new_fast_and_e_cient_image_codec_based_661859.pdf
Data compression methods | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Lossless |
| ||||||||||
| Audio |
| ||||||||||
| Image |
| ||||||||||
| Video |
| ||||||||||
| Theory | |||||||||||
| |||||||||||
This article is issued from Wikipedia - version of the 9/18/2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.