Sharma, Shreeniwas and Tandukar, Jyoti and Bista, Rabindra (2023) Generating Harmonious Colors through the Combination of n-Grams and K-means. Journal of Computing Theories and Applications, 1 (2). pp. 140-150. ISSN 3024-9104
9470-Article Text-30474-3-10-20240615.pdf - Published Version
Download (940kB) | Preview
Abstract
Among the many approaches to studying color harmony tried so far, a relatively recent method is to leverage a large number of human-created and ranked color palettes, such as those hosted at colourlovers.com. Analysis of these large datasets could provide insights into the nature of color harmony but is usually overwhelming because of the sheer number of slightly differing colors. It is possible to quantize the colors in these color palettes to a manageable set of discrete colors without significantly affecting the harmony perception of the palette. Considering the quantized colors as words and the palettes as sentences, it is possible to form and compute the probabilities of n-Grams in the sentences. In this study, we create bigrams and trigrams from the corpus of highly ranked color palettes and use them to predict new color combinations. Respondents were asked to like or dislike the patterns colored with these color combinations. It was found that the new color combinations thus formed were almost as harmonious and pleasing as the originals.
Item Type: | Article |
---|---|
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Depositing User: | dl fts |
Date Deposited: | 29 Nov 2024 14:55 |
Last Modified: | 29 Nov 2024 14:55 |
URI: | https://dl.futuretechsci.org/id/eprint/78 |