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 [ edit ]

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.

References [ edit ]

^ ^a ^b 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 .

[Said-1] 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 .

[1]

General description [ edit ]

See also [ edit ]

References [ edit ]