I just need help with the code for this problem. Here are the lecture notes if that helps. We are working in Matlab

Exercise 3 Perform a k-means a clustering segmentation on the image green Screen (uploaded to Can- vas). Set k = 2. Write your own code K-means clustering algorithm in Color images 1. In the 3D color space , choose a set of k initial cluster centers. How you pick the initial cluster centers is problem-dependent. For example, if you are clustering points in a color space, where the dimensions are red, green, and blue, you might scatter all your cluster centers uniformly over this 3-space, or you might put all of them along the line from to 2. Assign each pixel in the image as belonging to the closest cluster center. That is, for the pixel at , whose color is .compute the distance to cluster mean i whose color is . 8i.b. using dixy = ir-r) + (8 - 8.) + (1 - DF The pixel at > is said to "belong to cluster iifdex