Jump to content

Set partitioning in hierarchical trees

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by ClueBot NG (talk | contribs) at 09:26, 11 November 2011 (Reverting possible vandalism by 202.65.142.218 to version by Citation bot 1. False positive? Report it. Thanks, ClueBot NG. (718538) (Bot)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

General description

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

  1. ^ Said, Amir (June 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. {{cite journal}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)

See also

Retrieved from "https://en.wikipedia.org/w/index.php?title=Set_partitioning_in_hierarchical_trees&oldid=460103843"