|Contact: Fernando Alonso-Fernandez|
Welcome to this lecture on Image Segmentation Techniques
(page created in November 2015, last modification November 2016)
In this lecture we will give an overview of algorithms for image segmentation. Segmentation consists of finding groups of pixels that "go together", so that the image is partitioned into regions of connected pixels that are similar according to some property.
Segmentation can be seen complementary to edge detection (see lecture on edge detection here). Edges define boundaries of objects, while segmentation looks for regions occupied by objects. However, not all edges define an object (our object of interest may have many edges inside), and not all objects are defined by clear edges.
We will start with simple segmentation algorithms, describing basic thresholding algorithm, seed growing, and split and merge algorithms. These are based on the assumption that the objects of interest have clear "uniform" gray level, and they only make use of pixel intensities. For this reason, a more complex segmentation algorithm is presented, the mean-shift algorithm. This allows to make use of many local properties at a pixel location, which are then used to find different "modes" or clusters of pixels in the joint histogram of features.
Finding "meaningful" regions in images via segmentation have countless uses in Computer Vision, rather than just visualization. It enables higher reasoning levels of analysis leading towards the analysis of objects and interpretation of scenes.
Get slides from Google docs (ppt) here
See here a Youtube video commenting the slides (November 2014): http://youtu.be/ScGmiRO84HE
See the lecture in Youtube (November 2014): http://youtu.be/CLO_Iaq7CZI
References and sources
|R. Klette, “Concise Computer Vision”, Springer, 2014|
|R. Szeliski, “Computer Vision: Algorithms and Applications”, Springer 2010
|M. Shah, “Fundamentals of Computer Vision”, 1997