Set partitioning in hierarchical trees

<h2 id="general-description">General description</h2>
<p>The algorithm <a href="/facts/Code/CSntvnEo">codes</a> the most important <a href="/facts/Wavelet_transform/4vk3W5be">wavelet transform</a> <a href="/facts/Coefficients/5Hwq2Wuq">coefficients</a> first, and transmits the bits so that an increasingly refined copy of the original image can be obtained progressively.
</p>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Embedded_Zerotrees_of_Wavelet_transforms/KPjuEj2y">Embedded Zerotrees of Wavelet transforms</a> (EZW)</li>
<li><a href="/facts/Wavelet/3XcX4uIP">Wavelet</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Said, A.; Pearlman, W. A. (1996). "A new, fast, and efficient image codec based on 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. Retrieved 18 October 2019. <a href="https://www.researchgate.net/publication/2835826" target="_blank">https://www.researchgate.net/publication/2835826</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Said, A.; Pearlman, W. A. (1996). "A new, fast, and efficient image codec based on 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. Retrieved 18 October 2019. <a href="https://www.researchgate.net/publication/2835826" target="_blank">https://www.researchgate.net/publication/2835826</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
</ol>

Set partitioning in hierarchical trees open-in-new

Set partitioning in hierarchical trees