Set partitioning in hierarchical trees

Source: Wikipedia, the free encyclopedia.

Set partitioning in hierarchical trees (SPIHT)

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

coefficients
first, and transmits the bits so that an increasingly refined copy of the original image can be obtained progressively.

See also

References