Set partitioning in hierarchical trees

From Wikipedia, the free encyclopedia
Revision as of 00:53, 6 December 2024 by imported>IznoRepeat (References: add WP:TEMPLATECAT to remove from template; genfixes)
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description 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

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

References

Template:Reflist


Template:Compression Methods

  1. a b Script error: No such module "Citation/CS1".