Set partitioning in hierarchical trees

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. The algorithm was developed by Brazilian engineer Amir Said with William A. Pearlman in 1996.[1]

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.

gollark: He *is* explicitly saying he's not going to tell me, which is... problematic.
gollark: Great, so you're basically mildly evil.
gollark: I mean, I figure that with significant work people probably could uniquely identify me and/or get my location. If someone does that, they should NOTIFY ME OF IT and PROVIDE STEPS TO STOP THAT, not just sort of boast about it.
gollark: He is edgy™ and apparently does not listen to others' moral standards™.
gollark: Probably.

See also

References
  1. Said, A.; Pearlman, W. A. (1996). "A new, fast, and efficient image codec based on set partitioning in hierarchical trees" (PDF). IEEE Transactions on Circuits and Systems for Video Technology. 6 (3): 243–250. doi:10.1109/76.499834. ISSN 1051-8215. Retrieved 18 October 2019.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.