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: Should they though? Should they *really*?
gollark: Computers are in fact capable of at least three things. Turtles are the ones which can do most in-world automation tasks, since they can move around and break blocks and stuff.
gollark: That is a bad question. Ask a better one.
gollark: In actual Lua multiple returns can only go to a few thousand.
gollark: Not in CC:T as far as I know.

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.