Set partitioning in hierarchical trees

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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[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.

See also[edit]

References[edit]

  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

External links[edit]