Jump to content

Set partitioning in hierarchical trees

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Freedom4U (talk | contribs) at 03:31, 7 March 2017. 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][2] 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. {{citation}}: Empty citation (help)

See also

References

  1. ^ Said, Amir; Pearlman, William A. (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.
  2. ^ http://reference.kfupm.edu.sa/content/n/e/a_new_fast_and_e_cient_image_codec_based_661859.pdf
Retrieved from "https://en.wikipedia.org/w/index.php?title=Set_partitioning_in_hierarchical_trees&oldid=769023290"