Median Cut Algorithm

N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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 ...

Cite

CITATION STYLE

APA

Median Cut Algorithm. (2008). In Encyclopedia of Multimedia (pp. 417–418). Springer US. https://doi.org/10.1007/978-0-387-78414-4_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free