Skip to content

This is an implementation of k means algorithm for image segmentation

Notifications You must be signed in to change notification settings

maryamhagui/image_segmentation_using_K_means

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

k-means-implementation

The k-means method is a classic classification tool which allows a data set to be divided into k homogeneous classes. Most of the images (photos, 2D vector drawings, 3D syntheses, etc.) locally verify properties of homogeneity, in particular in terms of light intensity. The k-means algorithm therefore makes it possible to provide a solution to the segmentation of images. The K-Means algorithm can be used to segment an image that has areas of relatively uniform color. We represent all the pixels of the image in a three-dimensional space based on their Red / Green / Blue components. We thus obtain a point cloud on which we apply the k-means algorithm. To illustrate the use of k-means, we use a synthetic image made up of two zones with clearly distinct colors.

About

This is an implementation of k means algorithm for image segmentation

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages