Set partitioning in hierarchical trees
Image compression algorithm
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
- Embedded Zerotrees of Wavelet transforms (EZW)
- Wavelet
References
- ^ a b Said, A.; Pearlman, W. A. (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. Retrieved 18 October 2019.
- v
- t
- e
Data compression methods
| Entropy type |
|
|---|---|
| Dictionary type | |
| Other types | |
| Hybrid |
| Transform type | |
|---|---|
| Predictive type |
| Concepts | |
|---|---|
| Codec parts |
| Concepts | |
|---|---|
| Methods |
|
| Concepts | |
|---|---|
| Codec parts |
- Compressed data structures
- Entropy
- Information theory
- Kolmogorov complexity
- Prefix code
- Quantization
- Rate–distortion
- Redundancy
- Symmetry
- Smallest grammar problem
- Hutter Prize
- Global Data Compression Competition
- encode.su
- Matt Mahoney
- Mark Adler
Compression formats- Compression software (codecs)
