Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Set partitioning in hierarchical trees

From Wikipedia, the free encyclopedia
Image compression algorithm

Set partitioning in hierarchical trees (SPIHT)[1] is animagecompression algorithm that exploits the inherent similarities across the subbands in awavelet decomposition ofan image. The algorithm was developed by Brazilian engineer Amir Said with William A. Pearlman in 1996.[1]

General description

[edit]

The algorithmcodes the most importantwavelet transformcoefficients 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. ^abSaid, 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. Retrieved18 October 2019.


Lossless
type
Entropy
Dictionary
Other
Hybrid
Lossy
type
Transform
Predictive
Audio
Concepts
Codec
parts
Image
Concepts
Methods
Video
Concepts
Codec
parts
Theory
Community
People
Retrieved from "https://en.wikipedia.org/w/index.php?title=Set_partitioning_in_hierarchical_trees&oldid=1261421550"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp