What is Set partitioning in hierarchical trees?
'''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 [[Embedded zerotree wavelet|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 == * {{cite journal |title = A new fast and efficient image codec based upon set partitioning in hierarchical trees |journal = IEEE Transactions on Circuits and Systems for Video Technology |volume = 6 |pages = 243–250 |date = June 1996 |issue = 3|issn = 1051-8215 |doi = 10.1109/76.499834|last1 = Said|first1 = A.|last2 = Pearlman|first2 = W.A.}} {{Math-stub}} [[Category:Algorithms]] [[Category:Digital signal processing]]