Dominant Color Palette Extraction by K-Means Clustering Algorithm and Reconstruction of Image

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

Abstract

In our present age, there are numerous applications and devices for converting a standard picture into a picture, which is built from its predominant shading palettes. ‘predominant colors’ are the hues in the picture, in which the pixels of the picture contain the particular shading. These hues are then removed and another picture is then framed from this picture. However, this is just a speculation of the issue. In this undertaking, we dive into much more proficient techniques with a specific end goal to remove the prevailing shading palettes from the picture. In this manner, utilizing a grouping calculation and a significantly more ideal instatement technique, effective shading palette is extracted. The grouping calculation being utilized here is K-implies bunching calculations which is much more effective calculation than the other bunching calculations out there. The bunching calculation groups the pixels in bunches in view of their shading. The palettes separated from the picture are then utilized and another picture is reproduced.

Cite

CITATION STYLE

APA

Pavan Kumar, I., Hara Gopal, V. P., Ramasubbareddy, S., Nalluri, S., & Govinda, K. (2020). Dominant Color Palette Extraction by K-Means Clustering Algorithm and Reconstruction of Image. In Advances in Intelligent Systems and Computing (Vol. 1079, pp. 921–929). Springer. https://doi.org/10.1007/978-981-15-1097-7_78

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