- Begin with a decision on the value of k being the number of clusters.
- Put any initial partition that classifies the data into k clusters.
- Take every sample in the sequence; compute its distance from centroid of each of the clusters. If sample is not in the cluster with the closest centroid currently, switch this sample to that cluster and update the centroid of the cluster accepting the new sample and the cluster losing the sample.
- Priors, more specifically, the probability on distance between pairs of input pixels. The pre-trained facial landmark detector inside the dlib library is used to estimate the location of 68 (x, y)-coordinates that map to facial structures on the face.


Your reaction
Discussion
What's your take on this story?
No comments yet — be the first to share your view.