Median cut

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Median cut is an algorithm to sort data of an arbitrary number of dimensions into series of sets by recursively cutting each set of data at the median point along the longest dimension. Median cut is typically used for color quantization. For example, to reduce a 64k-colour image to 256 colours, median cut is used to find 256 colours that match the original data well. [1]

See also[edit]


  1. ^ Steven Segenchuk (5 May 1997). "An Overview of Color Quantization Techniques". p. 4. Retrieved 24 April 2014. 

External links[edit]