Skip to content

Clustering of a cerebral MRI image. The image is in grid level (grayscale image) where the value of each pixel is between 0 and 255 (0 represents the black color and 255 represents the white color). The image shows three parts of the brain namely white matter, gray matter and cerebrospinal fluid, the objective is to know the pixels of each part.

License

Notifications You must be signed in to change notification settings

ElyousfiMohamed/ClustringOfBrainMRI

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Clustring Of Brain MRI With Kmeans & MapReduce

Description :This project consist of Clustering of a cerebral MRI image. The image is in grid level (grayscale image) where the value of each pixel is between 0 and 255 (0 represents the black color and 255 represents the white color). The image shows three parts of the brain namely white matter, gray matter and cerebrospinal fluid, the objective is to know the pixels of each part.

Kmeans ?

Its a classic clustering algorithm that relies on the concept of centroids and their Euclidean distances from the observed data points. The basic concept works on the following set of rules:

  1. Assign a fixed number of centroids randomly in the parameter space (the number of centroids will define the number of clusters formed at the end of execution of the algorithm). These centroids need not be one of the points in the observation set, and can literally be random coordinates in the multi-dimensional space that we have.
  2. Calculate the closest centroid from each data point in the observation set and assign the data point to that centroid's cluster.
  3. Move the centroid to the 'center-of-mass' of the cluster that it has created with help of our data points from observation set.
  4. Repeat Step 2 and see if any points have changed their clusters, from the ones they were previously assigned. If the condition holds true then move to Step 3 otherwise proceed to Step 5.
  5. Finish

MapReduce ?

Its a programming model or pattern within the Hadoop framework that is used to access big data stored in the Hadoop File System (HDFS). It is a core component, integral to the functioning of the Hadoop framework.

MapReduce facilitates concurrent processing by splitting petabytes of data into smaller chunks, and processing them in parallel on Hadoop commodity servers. In the end, it aggregates all the data from multiple servers to return a consolidated output back to the application. The Map Reduce algorithm basically consists of two main functions Map and Reduce. Between these two main functions executed in parallel we find different steps that the code must execute, being as follows:

Input -> Splitting -> Mapping -> Shuffling -> Reducing -> Final result

Implementation

Clustering of a cerebral MRI image. The image is in grid level (grayscale image) where the value of each pixel is between 0 and 255 (0 represents the black color and 255 represents the white color). The image shows three parts of the brain namely white matter, gray matter and cerebrospinal fluid, the objective is to know the pixels of each part.

Original Image White Matter Gray Matter Cerebrospinal Fluid

About

Clustering of a cerebral MRI image. The image is in grid level (grayscale image) where the value of each pixel is between 0 and 255 (0 represents the black color and 255 represents the white color). The image shows three parts of the brain namely white matter, gray matter and cerebrospinal fluid, the objective is to know the pixels of each part.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages