THE WATERSHED SEGMENTATION 1 NADINE GARAISY. GENERAL DEFINITION 2 A drainage basin or watershed is an extent or an area of land where surface water from.

Slides:



Advertisements
Similar presentations
Segmentation by Morphological Watersheds
Advertisements

A Graph based Geometric Approach to Contour Extraction from Noisy Binary Images Amal Dev Parakkat, Jiju Peethambaran, Philumon Joseph and Ramanathan Muthuganapathy.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Smart Markers for Watershed-Based Cell Segmentation Can Fahrettin Koyuncu1, Salim Arslan1, Irem Durmaz2, Rengul Cetin-Atalay2, Cigdem Gunduz-Demir1* Present.
Image Processing in Matlab An Introductory Approach by Sabih D. Khan
DREAM PLAN IDEA IMPLEMENTATION Introduction to Image Processing Dr. Kourosh Kiani
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
CDS 301 Fall, 2009 Image Visualization Chap. 9 November 5, 2009 Jie Zhang Copyright ©
Image Segmentation Image segmentation (segmentace obrazu) –division or separation of the image into segments (connected regions) of similar properties.
Automatic measurement of pores and porosity in pork ham and their correlations with processing time, water content and texture JAVIER MERÁS FERNÁNDEZ MSc.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Introduction to Morphological Operators
Texture Segmentation Based on Voting of Blocks, Bayesian Flooding and Region Merging C. Panagiotakis (1), I. Grinias (2) and G. Tziritas (3)
September 10, 2013Computer Vision Lecture 3: Binary Image Processing 1Thresholding Here, the right image is created from the left image by thresholding,
Provides mathematical tools for shape analysis in both binary and grayscale images Chapter 13 – Mathematical Morphology Usages: (i)Image pre-processing.
Quadtrees, Octrees and their Applications in Digital Image Processing
EE 7730 Image Segmentation.
Thresholding Otsu’s Thresholding Method Threshold Detection Methods Optimal Thresholding Multi-Spectral Thresholding 6.2. Edge-based.
Chapter 10 Image Segmentation.
Segmentation Divide the image into segments. Each segment:
Robust Object Segmentation Using Adaptive Thresholding Xiaxi Huang and Nikolaos V. Boulgouris International Conference on Image Processing 2007.
Quadtrees, Octrees and their Applications in Digital Image Processing
Chapter 10 Image Segmentation.
Detecting Vehicles from Satellite Images Presented By: Dr. Fernando Rios Dr. Rocio Alba Flores Sumalatha Kuthadi Prashant Jain.
E.G.M. PetrakisBinary Image Processing1 Binary Image Analysis Segmentation produces homogenous regions –each region has uniform gray-level –each region.
Lecture 5. Morphological Image Processing. 10/6/20152 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of animals.
Chapter 9.  Mathematical morphology: ◦ A useful tool for extracting image components in the representation of region shape.  Boundaries, skeletons,
1Ellen L. Walker Segmentation Separating “content” from background Separating image into parts corresponding to “real” objects Complete segmentation Each.
An efficient method of license plate location Pattern Recognition Letters 26 (2005) Journal of Electronic Imaging 11(4), (October 2002)
CS 6825: Binary Image Processing – binary blob metrics
Under Supervision of Dr. Kamel A. Arram Eng. Lamiaa Said Wed
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
September 23, 2014Computer Vision Lecture 5: Binary Image Processing 1 Binary Images Binary images are grayscale images with only two possible levels of.
Digital Image Processing CCS331 Relationships of Pixel 1.
Morphological Image Processing
Quadtrees, Octrees and their Applications in Digital Image Processing.
Image Segmentation and Morphological Processing Digital Image Processing in Life- Science Aviad Baram
AdeptSight Image Processing Tools Lee Haney January 21, 2010.
EECS 274 Computer Vision Segmentation by Clustering II.
Mathematical Morphology Mathematical morphology (matematická morfologie) –A special image analysis discipline based on morphological transformations of.
Image Segmentation in Color Space By Anisa Chaudhary.
L7 - Raster Algorithms L7 – Raster Algorithms NGEN06(TEK230) – Algorithms in Geographical Information Systems.
Mathematical Morphology
References Books: Chapter 11, Image Processing, Analysis, and Machine Vision, Sonka et al Chapter 9, Digital Image Processing, Gonzalez & Woods.
图像处理技术讲座(11) Digital Image Processing (11) 灰度的数学形态学(3) Mathematical morphology in gray scale (3) 顾 力栩 上海交通大学 计算机系
Digital Image Processing
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
Allan Hanbury Mathematical Morphology: from Erosion to Watersheds PRIP, Vienna University of Technology Favoritenstraße 9/1832 A-1040 Vienna, Austria
Wonjun Kim and Changick Kim, Member, IEEE
CDS 301 Fall, 2008 Image Visualization Chap. 9 November 11, 2008 Jie Zhang Copyright ©
1 Mathematic Morphology used to extract image components that are useful in the representation and description of region shape, such as boundaries extraction.
Region Detection Defining regions of an image Introduction All pixels belong to a region Object Part of object Background Find region Constituent pixels.
Morphological Image Processing Robotics. 2/22/2016Introduction to Machine Vision Remember from Lecture 12: GRAY LEVEL THRESHOLDING Objects Set threshold.
 Mathematical morphology is a tool for extracting image components that are useful in the representation and description of region shape, such as boundaries,
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Machine Vision ENT 273 Hema C.R. Binary Image Processing Lecture 3.
Lecture(s) 3-4. Morphological Image Processing. 3/13/20162 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of.
Morphological Image Processing (Chapter 9) CSC 446 Lecturer: Nada ALZaben.
Application 2 Detect Filarial Worms SourceBTTRemove NoisesThreshold Skeleton Eliminate short structures ReconstructionFinal result.
Chapter 10 Image Segmentation
COMP 9517 Computer Vision Segmentation 7/2/2018 COMP 9517 S2, 2017.
Computer Vision Lecture 5: Binary Image Processing
Computer Vision Lecture 16: Texture II
Maximally Stable Extremal Regions
CS Digital Image Processing Lecture 5
Binary Image processing بهمن 92
Maximally Stable Extremal Regions
to understand what is in the water…
Region-Based Segmentation
CS654: Digital Image Analysis
Presentation transcript:

THE WATERSHED SEGMENTATION 1 NADINE GARAISY

GENERAL DEFINITION 2 A drainage basin or watershed is an extent or an area of land where surface water from rain melting snow or ice converges to a single point at a lower elevation, usually the exit of the basin, where the waters join another waterbody, such as a river, lake, wetland, sea, or ocean

INTRODUCTION 3  The watershed concept was first applied by Beucher and Lantuejoul at 1979, they used it to segment images of bubbles and SEM metallographic pictures  The Watershed transformation is a powerful tool for image segmentation, it uses the region- based approach and searches for pixel and region similarities.

IMAGE REPRESENTATION 4

REMINDER-IMAGE GRADIENT 5 An image gradient is a directional change in the intensity or color in an image. Image gradients may be used to extract information from images.

IMAGE GRADIENT 6 an intensity image a gradient image in the x direction measuring horizontal change in intensity a gradient image in the y direction measuring vertical change in intensity

IMAGE GRADIENT 7

GEODESIC DISTANCE 8

GEODESIC ZONE OF INFLUENCE 9

GEODESIC SKELETON BY ZONES OF INFLUENCE 10

MINIMA AND MAXIMA 11

MINIMA AND MAXIMA 12

13 ASCENDING PATH

14 NON-ASCENDING PATH

THE WATERSHED TRANSFORMATION 15

16 THE WATERSHED TRANSFORMATION

17  THE WATERSHED TRANSFORMATION

BUILDING THE WATERSHED 18

BUILDING THE WATERSHED 19

BUILDING THE WATERSHED 20  Visual illustration Visual illustration

OVER-SEGMENTATION PROBLEM 21 Unfortunately, most times the real watershed transform of the gradient present many catchment basins, Each one corresponds to a minimum of the gradient that is produced by small variations, mainly due to noise.

OVER-SEGMENTATION: SOLUTION 22 The over-segmentation could be reduced by appropriate filtering, but the best results is obtained by marking the patterns to be segmented before preforming the watershed transformation of the gradient.

OVER-SEGMENTATION: SOLUTION FIRST: we mark each blob of protein of the original image (by extracting the minima of the image function) 23

OVER-SEGMENTATION: SOLUTION 24

HOMOTOPY MODIFICATION 25

OVER-SEGMENTATION: SOLUTION Now we look at the final result of the marking as a topographic surface, but in the flooding process instead of piercing the minima, we only make holes through the components of the marker set that we produced 26

OVER-SEGMENTATION: SOLUTION 27

OVER-SEGMENTATION: SOLUTION 28

OVERLAPING GRAINS OVERLAPING GRAINS 29  In some cases we have an image with overlapping figures, that we need to segment, in order to do that we need to point out the overlapping regions.  For example the figure here is a TEM (transmission electron microscopy) image of grains of silver nitrate scattered on a photographic plate.

30 OVERLAPING GRAINS OVERLAPING GRAINS To point out the overlapping regions we first threshold the initial image to a binary image with only two gray values

REMINDER: DISTANCE FUNCTION 31

32 OVERLAPING GRAINS OVERLAPING GRAINS By calculation the maxima of the distance function of the binary image we can provide the markers of the grains

33 OVERLAPING GRAINS OVERLAPING GRAINS

34 OVERLAPING GRAINS OVERLAPING GRAINS Finally after marking the background and calculation the gradient function we run the homotopy modification and the watershed construction are preformed

THE SEGMENTATION PARADIGM 35 I.Finding the markers and the segmentation. II.Performing a marker- controlled watershed with these two elements The segmentation process is divided into two steps:

WATERSHED TRANSFOTMATION PROCESS 36 Source: A gray scale image Step 1: Use the Gradient Magnitude as the Segmentation Function - The gradient is high at the borders of the objects and low (mostly) inside the objects. Step 2: Mark the foreground objects FROM -

37 Step 3: computing the opening-by- reconstruction of the image : Step 4: Following the opening with a closing can remove the dark spots and stem marks. Step 5: Calculate the regional maxima to obtain good foreground markers. WATERSHED TRANSFOTMATION PROCESS FROM -

38 Step 6: Superimpose the foreground marker image on the original image, Notice that the foreground markers in some objects go right up to the objects' edge cleaning the Step 7: cleaning the edges of the marker blobs and then shrinking them a bit Step 8: Compute Background Markers, Starting with thresholding operation WATERSHED TRANSFOTMATION PROCESS FROM -

39 Step 9: Compute Background Markers, using the watershed transform of the distance transform and then looking for the watershed ridge lines of the result Step 10: Visualize the Result, one of the techniques is to superimpose the foreground markers, background markers, and segmented object boundaries. WATERSHED TRANSFOTMATION PROCESS FROM -

WATERSHED TRANSFOTMATION PROCESS – ADVANCE OPTIONS 40 We can use transparency to superimpose this pseudo- color label matrix on top of the original intensity image. *Another useful visualization technique is to display the label matrix as a color image FROM -

ROAD SEGMENTATION 41  In this study they use the watershed algorithm among others to extract vehicle position on the road and possible obstacles ahead.  The algorithms have been tested on a small database representing different driving situations.

ROAD SEGMENTATION 42 The morphological gradient image The original road image

ROAD SEGMENTATION 43 Due to noise and inhomogeneities in the gradient image, the watershed will produce a lot of minima which leads to over-segmentation of the image

ROAD SEGMENTATION 44 We can enhance the watershed on the gradient image by modifying the gradient function by defining new markers which will be imposed as the new minima.

ROAD SEGMENTATION 45 The difference between watershed on simple gradient and watershed on the gradient after modifying using the regularized gradient

ROAD SEGMENTATION 46

ROAD SEGMENTATION 47

ROAD SEGMENTATION 48

ROAD SEGMENTATION 49  To obtain the road markers we do a simplification on the image using its gradient, the result is an image made of catchment basins tiles of constant gray values- this image is called the mosaic-image.  The gradient of this image will be null everywhere except on the divide lines where it will be equal to the absolute difference of the gray-tone values of the to catchment basins.

50 ROAD SEGMENTATION Watershed of the mosaic-image points out only the regions surrounded by higher contrast edges, and we can still extract a marker for the road

ROAD SEGMENTATION 51 The result – Road borders, corresponding to the watershed of the modified gradient image

LANE BY LANE ROAD SEGMENTATION 52 Original image Mosaic- image Watershed of mosaic- image Lanes markers enhancement Final result

POTENTIAL OBSTACLES DETECTION 53 The second part of this study was identifying obstacles on the road, but this detection is useless without a good definition of the nature of the obstacles, the problem in this part was distinguishing a dangerous obstacle from a light variation in intensity due, for instance to a shading. Black marker- the edges of the road White marker- obstacles-free zone

POTENTIAL OBSTACLES DETECTION 54 Difficulties in this segmentation:  false detection due to the shadows, because they are considered as obstacles, this can be solved if given complementary information by telemetry or stereovision

VISUAL EXAMPLES  Illustration of watershed road segmentation:  Road Detection Using Region Growing and Segmentation: 55

REFERENCES  THE WATERSHED TRANSFORMATION APPLIED TO IMAGE SEGMENTATION – S.Beucher  ROAD SEGMENTATION BY WATERSHEDS ALGORITHEMS – S.Beucher, M.Billodeau and X.Yu  USE OF WATERSHEDS IN CONTOUR DETECTION- S.Beucher and C.Lantuejoul  MATHWORKS.COM  WIKIPEDIA 56

57

TOPOGRAPHIC MAP 58