Editing Set partitioning in hierarchical trees

{{Short description|Image compression algorithm}}
'''Set partitioning in hierarchical trees''' ('''SPIHT''')<ref name="Said">{{cite journal |last1=Said |first1=A. |last2=Pearlman |first2=W. A. |title=A new, fast, and efficient image codec based on set partitioning in hierarchical trees |journal=IEEE Transactions on Circuits and Systems for Video Technology |date=1996 |volume=6 |issue=3 |pages=243–250 |doi=10.1109/76.499834 |issn=1051-8215 |url=https://www.researchgate.net/publication/2835826 |accessdate=18 October 2019}}</ref> is an [[image compression|image]] [[compression algorithm]] that exploits the inherent similarities across the subbands in a [[wavelet transform|wavelet decomposition]] of [[digital image|an image]]. The algorithm was developed by Brazilian engineer Amir Said with William A. Pearlman in 1996.<ref name="Said"/>

== General description ==
The algorithm [[code]]s 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.

== See also ==
* [[Embedded Zerotrees of Wavelet transforms]] (EZW)
* [[Wavelet]]

== References ==
{{reflist}}

<!-- == External links ==
-->

{{Clear}}
{{Compression Methods}}

[[Category:Image compression]]
[[Category:Wavelets]]
[[Category:Brazilian inventions]]
[[Category:Data compression]]