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: I have no actual powers.
gollark: I can't.
gollark: Sorry for the horrible formatting but I can't do much better.
gollark: <@293066066605768714> As detailed in infocontext.txt palaiologos also wants acknowledgement that you got this.
gollark: Hello! As you may know, I am (barely) staff in old esolangs. For transparency purposes I also share some of the staff discussion which goes on there. They recently complained about this; palaiologos apparently wants me to post *full* context for staff discussions instead of my somewhat small screenshots, including retroactively in the case of the rules change discussion since apparently people have been led to believe that the staff weren't mostly in favour of this. Thusly, here you go.

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.