Digital Image Processing Lecture 18: Segmentation: Thresholding & Region-Based Prof. Charlene Tsai.

Slides:



Advertisements
Similar presentations
E.G.M. PetrakisImage Segmentation1 Segmentation is the process of partitioning an image into regions –region: group of connected pixels with similar properties.
Advertisements

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.
Lecture 07 Segmentation Lecture 07 Segmentation Mata kuliah: T Computer Vision Tahun: 2010.
Segmentation and Region Detection Defining regions in an image.
Content Based Image Retrieval
Lecture 6 Image Segmentation
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.
Machinen Vision and Dig. Image Analysis 1 Prof. Heikki Kälviäinen CT50A6100 Lectures 8&9: Image Segmentation Professor Heikki Kälviäinen Machine Vision.
Segmentation Divide the image into segments. Each segment:
Chapter 10 Image Segmentation.
Segmentation (Section 10.3 & 10.4) CS474/674 – Prof. Bebis.
Image Segmentation Using Region Growing and Shrinking
CS292 Computational Vision and Language Segmentation and Region Detection.
Thresholding Thresholding is usually the first step in any segmentation approach We have talked about simple single value thresholding already Single value.
DIGITAL IMAGE PROCESSING Instructors: Dr J. Shanbehzadeh M.Yekke Zare M.Yekke Zare ( J.Shanbehzadeh M.Yekke Zare )
Image Segmentation CIS 601 Fall 2004 Longin Jan Latecki.
Chapter 10: Image Segmentation
What is Image Segmentation?
Lecture 5. Morphological Image Processing. 10/6/20152 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of animals.
1Ellen L. Walker Segmentation Separating “content” from background Separating image into parts corresponding to “real” objects Complete segmentation Each.
Lecture 16 Image Segmentation 1.The basic concepts of segmentation 2.Point, line, edge detection 3.Thresh holding 4.Region-based segmentation 5.Segmentation.
Digital Image Processing In The Name Of God Digital Image Processing Lecture8: Image Segmentation M. Ghelich Oghli By: M. Ghelich Oghli
Digital Image Processing CSC331
University of Kurdistan Digital Image Processing (DIP) Lecturer: Kaveh Mollazade, Ph.D. Department of Biosystems Engineering, Faculty of Agriculture,
Segmentation.
Chap. 9: Image Segmentation Jen-Chang Liu, Motivation Segmentation subdivides an image into its constituent regions or objects Example: 生物細胞在影像序列中的追蹤.
Introduction to Image Processing Grass Sky Tree ? ? Image Segmentation.
Chapter 10 Image Segmentation.
Image Segmentation Chapter 10.
Chapter 10, Part II Edge Linking and Boundary Detection The methods discussed in the previous section yield pixels lying only on edges. This section.
G52IVG, School of Computer Science, University of Nottingham 1 Edge Detection and Image Segmentation.
EECS 274 Computer Vision Segmentation by Clustering II.
Pixel Connectivity Pixel connectivity is a central concept of both edge- and region- based approaches to segmentation The notation of pixel connectivity.
CS654: Digital Image Analysis
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Image Segmentation by Histogram Thresholding Venugopal Rajagopal CIS 581 Instructor: Longin Jan Latecki.
主講者 : 陳建齊. Outline & Content 1. Introduction 2. Thresholding 3. Edge-based segmentation 4. Region-based segmentation 5. conclusion 2.
Digital Image Processing
Machine Vision ENT 273 Regions and Segmentation in Images Hema C.R. Lecture 4.
EE4328, Section 005 Introduction to Digital Image Processing Image Segmentation Zhou Wang Dept. of Electrical Engineering The Univ. of Texas at Arlington.
November 5, 2013Computer Vision Lecture 15: Region Detection 1 Basic Steps for Filtering in the Frequency Domain.
1 Mathematic Morphology used to extract image components that are useful in the representation and description of region shape, such as boundaries extraction.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities May 2, 2005 Prof. Charlene Tsai.
Image Segmentation Nitin Rane. Image Segmentation Introduction Thresholding Region Splitting Region Labeling Statistical Region Description Application.
Thresholding Foundation:. Thresholding In A: light objects in dark background To extract the objects: –Select a T that separates the objects from the.
Lecture(s) 3-4. Morphological Image Processing. 3/13/20162 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of.
BYST Seg-1 DIP - WS2002: Segmentation Digital Image Processing Image Segmentation Bundit Thipakorn, Ph.D. Computer Engineering Department.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Unit-VII Image Segmentation.
Chapter 10: Image Segmentation The whole is equal to the sum of its parts. Euclid The whole is greater than the sum of its parts. Max Wertheimer.
Lecture z Chapter 10: Image Segmentation. Segmentation approaches 1) Gradient based: How different are pixels? 2) Thresholding: Converts grey-level images.
Digital Image Processing Lecture 15: Morphological Algorithms April 27, 2005 Prof. Charlene Tsai.
Digital Image Processing (DIP)
Machine Vision ENT 273 Lecture 4 Hema C.R.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
IMAGE SEGMENTATION USING THRESHOLDING
Image Segmentation.
Computer Vision Lecture 13: Image Segmentation III
Image Segmentation – Edge Detection
Digital Image Processing
Computer Vision Lecture 12: Image Segmentation II
ECE 692 – Advanced Topics in Computer Vision
Digital Image Processing
Digital Image Processing
Image Segmentation.
Digital Image Processing Lecture 15: Morphological Algorithms
Digital Image Processing Week III
Image Segmentation Using Region Growing and Shrinking
Presentation transcript:

Digital Image Processing Lecture 18: Segmentation: Thresholding & Region-Based Prof. Charlene Tsai

2 What is thresholding? Can be as simple as Any point (x,y) for which f(x,y)>T is called an object point; otherwise, the point is called a background point. Important for segmentation

3 Example

4 General Formulation When T depends only on f(x,y), the threshold is called global. If T depends on both f(x,y) and p(x,y), the threshold is local. If T depends on the spatial coordinates x & y, the threshold is called adaptive. Some local property Grayscale value

5 Basic Global Thresholding 1. Select an initial estimate for T 2. Segment the image using T to generate 2 regions, G 1 & G Compute the average gray level values m 1 and m 2 for regions G 1 and G 2, respectively. 4. Compute the new T as 0.5(m 1 +m 2 ). 5. Repeat the steps 2-4 until the T converges.

6 Selection of Initial T If foreground and background occupy comparable areas, average graylevel might be good. If the areas not comparable, midway between max and min graylevel might be better.

7 Example Initial T is the average graylevel The final T is with 3 iterations 127

8 Otsu’s Method (graythresh in Matlab) A popular method that maximizes inter-class variance. Let’s remind ourselves again that the image histogram is a probability distribution of the gray levels where n i is the # of pixels of gray level i, and N is the total number of pixels. The image average is

9 (con’d) If we threshold at level k, we get We would like to maximize the inter-class variance, i.e. the difference between k is set to the value that maximize

10 Basic Adaptive Thresholding Global thresholding often fails in the case of uneven illumination. global thresholding

11 (con’d) The simplest fix is to  Divide the image into subimages (but how?)  Determine T for each subimage (but how?) subimages

12 How to deal with the Subimages Observation:  Type 1: For all subimages, if the graylevel variance is < 75 do not contain object boundary  Type 2: For all subimages, if the graylevel variance is > 100 contain object boundary All subimages of type 1 are merged and thresholded using a single threshold value Each subimage of type 2 is thresholded independently. All thresholding is done using basic global method.

13 Result How can the result be improved? There is no the-solution that handles all thresholding problems (hard research topic) Better?

14 Use of Boundary Characteristics It is easier to select T if the histogram peaks are tall, narrow, symmetric and separated by deep valley. If relying on only graylevel information, the result is susceptible to relative sizes of the object and background. One possible solution: using only pixels on or near the edges.  Problem: edges are only know after segmentation, which is what we’re trying to achieve now …

15 Using Gradient/Laplacian There is no need to have the edges extracted first Review:  The gradient reveals whether a pixel is on edge or not  Laplacian indicates the transition of the graylevel on the edge

16 Thresholding on Gradient Information Threshold is applied to the gradient instead. Pixels on edge Dark side of edge Bright side of edge Dark object, light background

17 How to turn this into a binary image? For dark object, look for the following pattern in the scan line (horizontal or vertical) (…)(-,+)(0 or +)(+,-)(…) 0 0 1

18 Region-Based Segmentation Different from previous techniques, algorithms of this category find regions directly, instead of the boundaries dividing the regions. There are few such algorithms  Region growing  Region splitting and merging We’ll briefly discuss the 2 nd one.

19 Basic Formulation Let R be the entire region partitioned into n subregions, R 1, R 2, …, R n such that   Ri is a connected region  P(R k ) is a logical predicate defined over the points in R k.

20 Region Splitting & Merging Splitting:  Starting with the entire region.  If P(R)=FALSE, divide the image into quadrant  If P is FALSE for any quadrant, divide that quadrant into subquadrants.  The result is a quadtree

21 (con’d) If only splitting, it is likely that adjacent regions have identical properties. Adjacent regions whose combined region satisfies P should be merged. Algorithm  Splitting into 4 disjoint quadrants if P(R)=FALSE  Merging any adjacent quadrants for which P is TRUE  Stop when no further merging and splitting is possible

22 Example P(R i )=TRUE if at least 80% of the pixels in R i have the property Can specify P(R) based on texture content for texture segmentation Std deviation Mean of the region Pixel intensity value

23 Summary Thresholding  Global  Adaptive  Using boundary characteristics Region-based segmentation  Splitting and merging