Presentation is loading. Please wait.

Presentation is loading. Please wait.

COMP 9517 Computer Vision Segmentation 7/2/2018 COMP 9517 S2, 2017.

Published byCharleen Harrell Modified over 6 years ago

Similar presentations

Presentation on theme: "COMP 9517 Computer Vision Segmentation 7/2/2018 COMP 9517 S2, 2017."— Presentation transcript:

1 COMP 9517 Computer Vision Segmentation 7/2/2018 COMP 9517 S2, 2017

2 Introduction What can you see from this image? 7/2/2018
COMP 9517 S2, 2017

3 Introduction Image segmentation
one of the oldest and most widely studied problems in computer vision 7/2/2018 COMP 9517 S2, 2017

4 Introduction Image segmentation
the partition of an image into a set of regions Meaningful areas Border pixels grouped into structures Groups of pixels with shapes Foreground and background Background Structures, Shapes Foreground 7/2/2018 COMP 9517 S2, 2017

5 Introduction Two objectives of segmentation
Decompose the image into parts for further analysis Represent the image using meaningful and/or efficient higher-level units for further analysis Hang Ring 7/2/2018 COMP 9517 S2, 2017

6 Introduction Identifying Regions
Regions should be uniform and homogeneous with some characteristic Region interiors should be simple and without many small holes Adjacent regions should have significantly different values with respect to the characteristics on which they are uniform Boundaries of each segment should be smooth and spatially accurate 7/2/2018 COMP 9517 S2, 2017

7 Introduction Segmentation approaches Region-based Curve-based
Early techniques tend to use region splitting and/or merging Recent algorithms optimise some global criterion 7/2/2018 COMP 9517 S2, 2017

8 Introduction Issues There is no single segmentation system working well for all problems so far Special domain knowledge of the application is typically essential for the implementation of computer vision applications Source: 7/2/2018 COMP 9517 S2, 2017

9 Introduction Results from some popular segmentation techniques
Active contours Level sets Graph-based merging Mean shift Normalised cuts Binary MRF 7/2/2018 COMP 9517 S2, 2017

10 Region Split and Merge Overview
Recursively splitting the whole image into pieces based on region statistics Recursively merging pixels and regions together in a hierarchical fashion Combine both splitting and merging together 7/2/2018 COMP 9517 S2, 2017

11 Region Split and Merge The simplest possible techniques
use a threshold and then compute connected components rarely sufficient due to lighting and intra-object statistical variations 7/2/2018 COMP 9517 S2, 2017

12 Split and Merge Watershed A technique related to thresholding
Operate on a grayscale image Segment an image into several catchment basins - regions of an image where rain would flow into the same lake Start flooding the landscape at all of the local minima and to label ridges whenever different evolving components meet Often used as part of an interactive system where the user first marks seed locations that correspond to the centres of different desired components 7/2/2018 COMP 9517 S2, 2017

13 Split and Merge Watershed Meyer’s flooding algorithm
Choose a set of markers to start the flooding, each is given a different label The neighbouring pixels of each marked area are inserted into a priority queue with a priority level corresponding to the gray level of the pixel The pixel with the highest priority level is popped from the queue. If the neighbours of the popped pixel that have already been labelled all have the same label, the pixel is labelled with the label. All non-labelled neighbours that are not yet in the queue are put into the queue. Repeat step 3 until the queue is empty The non-labelled pixels are the watershed lines 7/2/2018 COMP 9517 S2, 2017

14 Split and Merge Watershed 7/2/2018 COMP 9517 S2, 2017

15 Split and Merge Region Splitting
One of the oldest techniques in computer vision First computers a histogram for the whole image Then finds a threshold that best separates the large peaks in the histogram 7/2/2018 COMP 9517 S2, 2017

16 Split and Merge Region Splitting
Repeated until regions are either fairly uniform or below a certain size More recent approach often optimise some metric of intra-region similarity and inter-region dissimilarity 7/2/2018 COMP 9517 S2, 2017

17 Split and Merge Histogram-based methods
follows a measurement-space clustering process assumes homogeneous objects in the image appear as the clusters in measurement space (histogram) The measurement-space clustering can be accomplished by determining the valleys in the histogram and declaring the clusters to be the interval of values between valleys 7/2/2018 COMP 9517 S2, 2017

18 Split and Merge Histogram-based methods
segmentation is accomplished by mapping the clusters back to the image domain maximum connected components of the cluster labels constitute the segments 7/2/2018 COMP 9517 S2, 2017

19 Split and Merge Histogram-based methods
The measurement-space clustering can be accomplished by determining the valleys in the histogram and declaring the clusters to be the interval of values between valleys ? ? ? ? 7/2/2018 COMP 9517 S2, 2017

20 Split and Merge A recursive version of histogram-based clustering
Perform histogram mode seeking first on the whole image and then on each of the regions obtained from the resultant clusters until regions obtained cannot be decomposed further 7/2/2018 COMP 9517 S2, 2017

21 Split and Merge Region Merging
Merge regions based on their relative boundary lengths and the strength of the visible edges at the boundaries Link clusters together based either on the distance between their closest points, their farthest points or some thing in between Merge adjacent regions whose average colour difference is below a threshold or whose regions are too small A useful pre-processing stage to make higher-level algorithms faster and more robust 7/2/2018 COMP 9517 S2, 2017

22 Split and Merge Graph-based Segmentation
Use relative dissimilarities between regions to merge Start with a pixel-to-pixel dissimilarity measure such as intensity differences between N8 neighbours Internal difference Difference between regions Merge any two adjacent regions whose difference is smaller than the minimum internal difference of these two regions NW N NE W C E SW S SE 7/2/2018 COMP 9517 S2, 2017

23 Split and Merge Graph-based Segmentation 7/2/2018 COMP 9517 S2, 2017

24 Region Representation
The outputs from segmentation methods need to be represented and stored Methods to represent regions: Labelled images (the most commonly used) Overlays Boundary coding Quad trees Property tables 7/2/2018 COMP 9517 S2, 2017

25 Region Representation
Labelled images Assign each detected region a unique identifier (an integer) 7/2/2018 COMP 9517 S2, 2017

26 Region Representation
Labelled images Create an image where all the pixels of a region will have its unique identifier as their pixel value 2 1 3 7/2/2018 COMP 9517 S2, 2017

27 Region Representation
Overlays Overlaying some colour or colours on top of the original image 7/2/2018 COMP 9517 S2, 2017

28 Region Representation
Boundary Coding Represents regions by their boundaries in a data structure instead of an image A linear list of the border pixels Chain code Polygon approximation 7/2/2018 COMP 9517 S2, 2017

29 Region Representation
Boundary Coding Encoding schema Start point Chain code links Chain code representation Polygon approximation 7/2/2018 COMP 9517 S2, 2017

30 Region Representation
Boundary Coding Encoding schema Start point Chain code links Chain code representation Polygon approximation 7 1 6 2 5 4 3 3 1 2 8-N 4-N 7/2/2018 COMP 9517 S2, 2017

31 Region Representation
Boundary Coding Encoding schema Start Point Chain code links Chain code representation Polygon approximation S 7/2/2018 COMP 9517 S2, 2017

32 Region Representation
Boundary Coding Encoding schema Start Point Chain code links Chain code representation Polygon approximation S 7 1 6 2 5 4 3 7/2/2018 COMP 9517 S2, 2017

33 Region Representation
Boundary Coding Encoding schema Start Point Chain code links Chain code representation Polygon approximation S 7 1 6 2 5 4 3 Chain Code: 7/2/2018 COMP 9517 S2, 2017

34 Region Representation
Quadtrees A quadtree is a tree data structure in which each internal node has exactly four children Quadtrees are most often used to partition a two dimensional space by recursively subdividing it into four quadrants or regions 7/2/2018 COMP 9517 S2, 2017

35 Region Representation
Quadtrees A space-saving representation encoding the whole region Each region of interest would be represented by a quadtree structure. A B C D A B C D I 7/2/2018 COMP 9517 S2, 2017

36 Region Representation
Quadtrees Encoding Schema Split the image Create the tree 1 2 3 4 7/2/2018 COMP 9517 S2, 2017

37 Region Representation
Quadtrees Encoding Schema Split the image Create the tree 7/2/2018 COMP 9517 S2, 2017

38 Region Representation
Quadtrees Encoding Schema Split the image Create the tree A B C D I 7/2/2018 COMP 9517 S2, 2017

39 Region Representation
Quadtrees Each node of a quadtree representing a square region in the image has one of three labels: Full, Empty or Mixed Only mixed nodes have child nodes M E F 7/2/2018 COMP 9517 S2, 2017

40 Region Representation
Property Tables Represent a region by its extracted properties rather than by its pixels Properties can be the size, shape, intensity, colour or texture of the region Region Size colour … 5 Red 1 6 Blue 2 Green 3 9 Grey 2 1 3 1 2 3 7/2/2018 COMP 9517 S2, 2016

41 References and Acknowledgements
Chapter 3, 5 Szeliski 2010 Shapiro and Stockman 2001 Some images drawn from Szeliski 2010 and other papers 7/2/2018 COMP 9517 S2, 2016

Download ppt "COMP 9517 Computer Vision Segmentation 7/2/2018 COMP 9517 S2, 2017."

Similar presentations

Segmentation by Morphological Watersheds

Segmentation by Morphological Watersheds
Nearest Neighbor Search

Nearest Neighbor Search
Hierarchical Clustering. Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree-like diagram that.

Hierarchical Clustering. Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree-like diagram that.
電腦視覺 Computer and Robot Vision I

電腦視覺 Computer and Robot Vision I
E.G.M. PetrakisImage Segmentation1 Segmentation is the process of partitioning an image into regions –region: group of connected pixels with similar properties.

E.G.M. PetrakisImage Segmentation1 Segmentation is the process of partitioning an image into regions –region: group of connected pixels with similar properties.
Searching on Multi-Dimensional Data

Searching on Multi-Dimensional Data
Clustering & image segmentation Goal::Identify groups of pixels that go together Segmentation.

Clustering & image segmentation Goal::Identify groups of pixels that go together Segmentation.
Image Segmentation Image segmentation (segmentace obrazu) –division or separation of the image into segments (connected regions) of similar properties.

Image Segmentation Image segmentation (segmentace obrazu) –division or separation of the image into segments (connected regions) of similar properties.
Lecture 07 Segmentation Lecture 07 Segmentation Mata kuliah: T0283 - Computer Vision Tahun: 2010.

Lecture 07 Segmentation Lecture 07 Segmentation Mata kuliah: T Computer Vision Tahun: 2010.
Computer Vision Lecture 16: Region Representation

Computer Vision Lecture 16: Region Representation
Human-Computer Interaction Human-Computer Interaction Segmentation Hanyang University Jong-Il Park.

Human-Computer Interaction Human-Computer Interaction Segmentation Hanyang University Jong-Il Park.
Computer Graphics1 Quadtrees & Octrees. Computer Graphics2 Quadtrees n A hierarchical data structure often used for image representation. n Quadtrees.

Computer Graphics1 Quadtrees & Octrees. Computer Graphics2 Quadtrees n A hierarchical data structure often used for image representation. n Quadtrees.
Quadtrees, Octrees and their Applications in Digital Image Processing

Quadtrees, Octrees and their Applications in Digital Image Processing
Segmentation and Region Detection Defining regions in an image.

Segmentation and Region Detection Defining regions in an image.
Lecture 6 Image Segmentation

Lecture 6 Image Segmentation
EE 7730 Image Segmentation.

EE 7730 Image Segmentation.
CS 376b Introduction to Computer Vision 04 / 08 / 2008 Instructor: Michael Eckmann.

CS 376b Introduction to Computer Vision 04 / 08 / 2008 Instructor: Michael Eckmann.
Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.

Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.
Segmentation Divide the image into segments. Each segment:

Segmentation Divide the image into segments. Each segment:
Image Segmentation. Introduction The purpose of image segmentation is to partition an image into meaningful regions with respect to a particular application.

Image Segmentation. Introduction The purpose of image segmentation is to partition an image into meaningful regions with respect to a particular application.

Similar presentations

Ads by Google