|Number of watchers on Github||52|
|Number of open issues||0|
|Open pull requests||0+|
|Closed pull requests||0+|
|Last commit||over 3 years ago|
|Repo Created||over 3 years ago|
|Repo Last Updated||over 1 year ago|
|Organization / Author||objcio|
|Do you use DominantColor? Leave a review!|
|View DominantColor activity|
|View on github|
|Fresh, new opensource launches 🚀🚀🚀|
Trendy new open source projects in your inbox! View examples
Finding the dominant colors of an image using the CIE LAB color space and the k-means clustering algorithm.
The RGB color space does not take human perception into account, so the CIELAB color space is used instead, which is designed to approximate human vision .
The conversion from RGB values to LAB values requires first transforming the RGB values to an absolute color space like sRGB. On iOS, this conversion is not necessary because sRGB is the native device color space. On OS X, the conversion can be performed using
Once the colors have been converted to sRGB, they are first converted to linear sRGB values and then to CIE XYZ values. Finally, they are converted to the CIE LAB color space using a D65 standard illuminant.
A color difference algorithm is used to group similar colors. API consumers can choose between the CIE 76, CIE 94, and CIE 2000 algorithms for low, medium, and high color grouping accuracy, respectively. The default algorithm is CIE 94, as it provides results that are close to CIE 2000 with a negligible performance impact in comparison to CIE 76.
The k-value was originally chosen based on the rule of thumb
k = sqrt(n/2) but this resulted in
k-values that were too large to run in a reasonable amount of time for large values of
n. Right now, I'm using a magic value of
16 because empirical testing showed that it yielded the best results for many different images but I'm still looking into a number of more data-driven alternate approaches.
The initial centroids are currently selected on a random basis. An alternative approach is to use the k-means++ algorithm, in which after the first centroid is selected randomly, the subsequent centroids are selected with probability proportional to the distance from the randomly selected centroid.
The k-means algorithm has a worst case runtime that is super-polynomial in the input size, so sampling large numbers of pixels is a problem. Images are automatically downsampled such that the total number of pixels is less than or equal to a specified maximum number of pixels to sample. The value I've been using is
1000, which is a good balance between accurate results and runtime.
Everything is implemented in Swift except for the functions that convert between color spaces, which use GLKit and thus must be written in C (since Swift doesn't support C unions at this time).
The project includes Mac and iOS apps that can be used to see the results of the algorithm and to run a simple benchmark.
Licensed under the MIT License.