Jump to content

Set partitioning in hierarchical trees

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Rene.puchinger (talk | contribs) at 11:11, 1 August 2009 (→See also). 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.

The SPIHT is considered the premier state-of-the-art algorithm in image compression [2], and has given excellent results in terms of compression performance for the natural images (and signals).

References

  1. ^ Said, Amir (June 1996). "A new fast and efficient image codec based upon set partitioning in hierarchical trees". IEEE Transactions on Circuits and Systems for Video Technology. 6: 243–250. doi:10.1109/76.499834. ISSN 1051-8215. {{cite journal}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)
  2. ^ Embedded Image Coding Using Zerotrees of Wavelet Coefficients [1]

See also

  • [2] SPIHT implementation in C++, by René Puchinger
Retrieved from "https://en.wikipedia.org/w/index.php?title=Set_partitioning_in_hierarchical_trees&oldid=305439628"