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.
a portable C++ class library for image loading, saving and manipulation. Images can be loaded from BMP, GIF, IFF, JPEG, PCX, PGM, PICT, PNG, PSD, SGI, TGA, TIFF and WMF files and saved in BMP, JPEG, PNG and TIFF formats.
the swiss army knife of image processing. It provides a robust collection of tools and libraries which support reading, writing, and manipulating an image in over 88 major formats including important formats like DPX, GIF, JPEG, JPEG-2000, PNG, PDF, SVG,
a high level open source portable multimedia library, built upon Sam Lantinga's SDL (<a class="linkification-ext" href="http://www.libsdl.org" title="Linkification: http://www.libsdl.org">http://www.libsdl.org</a>). Its goal is to provi
C++ Template Image Processing Library that can be used to load, save, process, and display images. It is portable (Unix/X11, Windows, MacOS X), efficient, and simple to use.
by Bill Green. using the Sobel and the Laplace methods."Edges characterize boundaries and are therefore a problem of fundamental importance in image processing"