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: But, you know, forever!
gollark: Also, lend us your CB silvers!
gollark: Plot twist: DC is just a testing ground for TJ09's desire sensor system.
gollark: Then when you want a mint or something it's all chronos.
gollark: Basically, see, the cave senses your intention. If you want to catch, say, chrono xenowyrms, no chronos spawn.

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.