In k-means clustering we are given a set of n data points in d-dimensional space and an integer k, and the problem is to determine a set of k points in d-space, called centers, so as to minimize the mean squared distance from each data point to its neares
Anat Levin, Dani Lischinski, Yair Weiss - a computer-assisted process of adding color to a monochrome image or movie with a relatively modest amount of user input.