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.
by Bill Green. using the Sobel and the Laplace methods."Edges characterize boundaries and are therefore a problem of fundamental importance in image processing"
By Oleg Krivtsov - Implementing Lucas-Kanade and Baker-Dellaert-Matthews image alignment algorithms (remember to check l8r freaking site changes the urls)
an approach to simulating very large textures using much less texture memory than they'd require in full by downloading only the data that is needed, and using a pixel shader to map from the virtual large texture to the actual physical texture.