Set partitioning in hierarchical trees

Set partitioning in hierarchical trees

Set Partitioning in Hierarchical Trees (SPIHT) [cite journal
last = Said|first = Amir|coauthors = Pearlman, William A.
title = A new fast and efficient image codec based upon set partitioning in hierarchical trees
journal = IEEE Transactions on Circuits and Systems for Video Technology
volume = 6
pages = 243–250
date = June 1996
issn = 1051-8215
doi = 10.1109/76.499834
] 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.

The SPIHT is considered the premier state-of-the-art algorithm in image compressionFact|date=April 2008, and has given excellent results in terms of compression performance for the natural images (and signals).

To get more information on spiht, on its other variants and for the source codes (read license agreements) please visit the [ Official Page of SPIHT] in [ Rensselaer Polytechnic Institute] .


ee also


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Binary space partitioning — (BSP) is a method for recursively subdividing a space into convex sets by hyperplanes. This subdivision gives rise to a representation of the scene by means of a tree data structure known as a BSP tree.In simpler words, it is a method of breaking …   Wikipedia

  • Space partitioning — In mathematics, space partitioning is the process of dividing a space (usually a Euclidean space) into two or more disjoint subsets (see also partition of a set). In other words, space partitioning divides a space into non overlapping regions.… …   Wikipedia

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

  • Embedded Zerotrees of Wavelet transforms — EZW (Embedded Zerotrees of Wavelet Transforms) is a lossy image compression algorithm. At low bit rates(i.e. high compression ratios) most of the coefficients produced by a subband transform (such as the wavelet transform)will be zero, or very… …   Wikipedia

  • SPIHT — abbr. comp. Set Partitioning in Hierarchical Trees …   Dictionary of English abbreviation

  • Collision detection — For collision detection on networks see CSMA/CD Collision detection typically refers to the computational problem of detecting the intersection of two or more objects. While the topic is most often associated with its use in video games and other …   Wikipedia

  • Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… …   Wikipedia

  • Ecology — For other uses, see Ecology (disambiguation). Ecology …   Wikipedia

  • India — /in dee euh/, n. 1. Hindi, Bharat. a republic in S Asia: a union comprising 25 states and 7 union territories; formerly a British colony; gained independence Aug. 15, 1947; became a republic within the Commonwealth of Nations Jan. 26, 1950.… …   Universalium

  • native American — native American, adj. a person born in the United States. [1835 45, Amer.] * * * ▪ indigenous peoples of Canada and United States Introduction also called  American Indian,  Amerindian,  Amerind,  Indian,  Aboriginal American,  or  First Nation… …   Universalium