Set partitioning in hierarchical trees
From Infogalactic: the planetary knowledge core
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.
See also
References
<templatestyles src="Reflist/styles.css" />
Cite error: Invalid <references> tag; parameter "group" is allowed only.
<references />, or <references group="..." />|
Data compression methods
|
|||||||
|---|---|---|---|---|---|---|---|
| Lossless |
|
||||||
| Audio |
|
||||||
| Image |
|
||||||
| Video |
|
||||||
| Theory | |||||||
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ http://reference.kfupm.edu.sa/content/n/e/a_new_fast_and_e_cient_image_codec_based_661859.pdf
