Median Cut Algorithm. Furht, B., editor In Encyclopedia of Multimedia, pages 417–418. Springer US, 2008. 00000
Median Cut Algorithm [link]Paper  abstract   bibtex   
SynonymsOptimized palette generationDefinitionMedian cut algorithm is an adaptive algorithm for color quantization to select the best representative subset of colors. It is used, for example, in the palette generation process.The median cut algorithm is a popular solution for optimized palette generation [1]. The idea behind the median cut algorithm is to use each of the colors in the synthesized look-up table to represent the equal number of pixels in the original image. The algorithm subdivides the color space interactively into smaller and smaller boxes. In contrast to uniform subdivision, optimized palette generation algorithms divide the color space based on the distribution of the original colors. The algorithm starts with a box that encloses all the different color values from the original image. The dimensions of the box are given by the minimum and maximum of each of the color coordinates that encloses the box under consideration. The box is split just choosi ...
@incollection{furht_median_2008,
	title = {Median {Cut} {Algorithm}},
	copyright = {©2008 Springer-Verlag},
	isbn = {978-0-387-74724-8 978-0-387-78414-4},
	url = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_36},
	abstract = {SynonymsOptimized palette generationDefinitionMedian cut algorithm is an adaptive algorithm for color quantization to select the best representative subset of colors. It is used, for example, in the palette generation process.The median cut algorithm is a popular solution for optimized palette generation [1]. The idea behind the median cut algorithm is to use each of the colors in the synthesized look-up table to represent the equal number of pixels in the original image. The algorithm subdivides the color space interactively into smaller and smaller boxes. In contrast to uniform subdivision, optimized palette generation algorithms divide the color space based on the distribution of the original colors. The algorithm starts with a box that encloses all the different color values from the original image. The dimensions of the box are given by the minimum and maximum of each of the color coordinates that encloses the box under consideration. The box is split just choosi ...},
	language = {en},
	urldate = {2016-05-03},
	booktitle = {Encyclopedia of {Multimedia}},
	publisher = {Springer US},
	editor = {Furht, Borko},
	year = {2008},
	note = {00000},
	pages = {417--418}
}
Downloads: 0