Jump to content

Set partitioning in hierarchical trees

From Simple English Wikipedia, the free encyclopedia
Revision as of 20:26, 22 February 2022 by Citation bot (talk | changes) (Add: issue. | Use this bot. Report bugs. | Suggested by AManWithNoPlan | Category:CS1 errors: unsupported parameter | #UCB_Category 306/560)

SPIHT (set partitioning in hierarchical trees) is a compression algorithm intended for compression of wavelet transform coefficients. It was introduced by Amir Said and William A. Pearlman in 1996. Its predecessor was EZW coding algorithm.

More practically, SPIHT progressively transforms these coefficients into a bit stream. This stream can be anywhere cut off. During decoding coefficients are increasingly refined.

References

  • Said, Amir (June 1996). "A new fast and efficient image codec based upon 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. {{cite journal}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)