Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/38690Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | MIHOUB, MAZOUZ | - |
| dc.contributor.author | BOUGOFFA, ASMA ZAHRAT ARABIE | - |
| dc.contributor.author | MELOUAH, MESSAOUDA | - |
| dc.contributor.author | GUERFI, SAHLA | - |
| dc.date.accessioned | 2025-11-12T10:08:10Z | - |
| dc.date.available | 2025-11-12T10:08:10Z | - |
| dc.date.issued | 2021 | - |
| dc.identifier.uri | https://dspace.univ-ouargla.dz/jspui/handle/123456789/38690 | - |
| dc.description | COMPUTER SCIENCE | en_US |
| dc.description.abstract | Image color quantization is a compression technique that aims at reducing the number of colors used to represent an image on a machine. In this work, we will present our application of the K-means algorithm on the color quantization problem. K-means is an unsupervised machine learning algorithm for clustering. The algorithm will form "k" classes (clusters) containing each of them the most homogeneous pixels (with respect to the others belonging to the other clusters) based on the Euclidean distance between them. After loading an image, choosing the number of colors (value of "k"), the tool we have developed in Python, will apply the k-means algorithm and produce another version of the initial image represented only by "k" colors. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | KASDI MERBAHUNIVERSITY OUARGLA | en_US |
| dc.subject | Image color quantization | en_US |
| dc.subject | K-means clustering algorithm | en_US |
| dc.subject | machine learning | en_US |
| dc.title | COLOR IMAGE QUANTIZATION USING K-MEANS | en_US |
| dc.type | Thesis | en_US |
| Appears in Collections: | Département d'informatique et technologie de l'information Licence | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| BOUGOFFA_MELOUAH_GUERFI.pdf | 417,78 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.