Scribd
Upload
154 views

Chapter 9

Uploaded by

Mohamed Riyaz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
154 views

Chapter 9

Uploaded by

Mohamed Riyaz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 73

Digital Image Processing

2nd Edition
S. Sridhar

© Oxford University Press 2016. All rights reserved.


Chapter 9

Image
Segmentation

© Oxford University Press 2016. All rights reserved.


Image Segmentation

• Segmentation is the process of partitioning a


digital image into multiple regions and
extracting meaningful regions known as
regions of interest (ROI) for further image 

© Oxford University Press 2016. All rights reserved.


Formal Definition of Image Segmentation

© Oxford University Press 2016. All rights reserved.


CLASSIFICATION OF ALGORITHMS

© Oxford University Press 2016. All rights reserved.


Types of Segmentation Algorithms

• Contextual (region-based or global) algorithms


• Non-contextual (pixel-based or local)
algorithms

© Oxford University Press 2016. All rights reserved.


DETECTION OF DISCONTINUITIES- Point
Detection

© Oxford University Press 2016. All rights reserved.


Point Detection

© Oxford University Press 2016. All rights reserved.


Line Detection

© Oxford University Press 2016. All rights reserved.


Illustration

© Oxford University Press 2016. All rights reserved.


EDGE DETECTION

© Oxford University Press 2016. All rights reserved.


Stages in Edge Detection

© Oxford University Press 2016. All rights reserved.


Edge Detection

© Oxford University Press 2016. All rights reserved.


Types of Edge Detectors

© Oxford University Press 2016. All rights reserved.


First-order Edge Detection Operators

© Oxford University Press 2016. All rights reserved.


Roberts operator

© Oxford University Press 2016. All rights reserved.


Prewitt

© Oxford University Press 2016. All rights reserved.


Sobel

© Oxford University Press 2016. All rights reserved.


© Oxford University Press 2016. All rights reserved.
Kirsch

© Oxford University Press 2016. All rights reserved.


© Oxford University Press 2016. All rights reserved.
Frei-Chen

© Oxford University Press 2016. All rights reserved.


Frei-Chen

© Oxford University Press 2016. All rights reserved.


© Oxford University Press 2016. All rights reserved.
Second-order Derivative Filters

© Oxford University Press 2016. All rights reserved.


© Oxford University Press 2016. All rights reserved.
Laplacian of Gaussian (Marr–Hildrith) operator

© Oxford University Press 2016. All rights reserved.


Difference of Gaussian filter

© Oxford University Press 2016. All rights reserved.


Canny edge detection

© Oxford University Press 2016. All rights reserved.


Algorithm
• First convolve the image with the Gaussian filter.
Compute the gradient of the resultant smooth
image. Store the edge magnitude and edge
orientation separately in two arrays, M(x, y) and
a(,)xy, respectively.

• The next step is to thin the edges. This is done using


a process called non-maxima suppression.

© Oxford University Press 2016. All rights reserved.


Algorithm

• Apply hysteresis thresholding. The idea behind


hysteresis thresholding is that only a large
amount of change in the gradient magnitude
matters in edge detection and small changes
do not affect the quality of edge detection.

© Oxford University Press 2016. All rights reserved.


© Oxford University Press 2016. All rights reserved.
© Oxford University Press 2016. All rights reserved.
Pattern fit algorithm

© Oxford University Press 2016. All rights reserved.


© Oxford University Press 2016. All rights reserved.
© Oxford University Press 2016. All rights reserved.
Edge Operator Performance
1. Missing valid edge points
2. Classifying the noise points as valid edge
points
3. Smearing edges

© Oxford University Press 2016. All rights reserved.


Pratt figure of merit

© Oxford University Press 2016. All rights reserved.


Edge Linking Algorithms

© Oxford University Press 2016. All rights reserved.


Edge relaxation

© Oxford University Press 2016. All rights reserved.


© Oxford University Press 2016. All rights reserved.
Graph theoretic algorithms

© Oxford University Press 2016. All rights reserved.


Algorithms

© Oxford University Press 2016. All rights reserved.


HOUGH TRANSFORMS AND SHAPE
DETECTION

© Oxford University Press 2016. All rights reserved.


Modified Algorithm

© Oxford University Press 2016. All rights reserved.


Circle Detection

© Oxford University Press 2016. All rights reserved.


CORNER DETECTION

© Oxford University Press 2016. All rights reserved.


Circle Detection Algorithm

© Oxford University Press 2016. All rights reserved.


Harris Corner

© Oxford University Press 2016. All rights reserved.


PRINCIPLE OF THRESHOLDING

© Oxford University Press 2016. All rights reserved.


Effect of noise over threshold
process and peakiness test

© Oxford University Press 2016. All rights reserved.


Thresholding Algorithm

© Oxford University Press 2016. All rights reserved.


Global Thresholding Algorithms

© Oxford University Press 2016. All rights reserved.


A variation of Global thresholding
Algorithm

© Oxford University Press 2016. All rights reserved.


Global Thresholding

© Oxford University Press 2016. All rights reserved.


Multiple Thresholding

© Oxford University Press 2016. All rights reserved.


Adaptive Thresholding Algorithm

© Oxford University Press 2016. All rights reserved.


© Oxford University Press 2016. All rights reserved.
Optimal Thresholding Algorithms

© Oxford University Press 2016. All rights reserved.


Non-Parametric – Otsu Algorithm

© Oxford University Press 2016. All rights reserved.


PRINCIPLE OF REGION-GROWING

© Oxford University Press 2016. All rights reserved.


Split-and-merge Algorithm

© Oxford University Press 2016. All rights reserved.


Algorithm

© Oxford University Press 2016. All rights reserved.


© Oxford University Press 2016. All rights reserved.
Split-and-merge Algorithm using
Pyramid Quadtree

© Oxford University Press 2016. All rights reserved.


© Oxford University Press 2016. All rights reserved.
DYNAMIC SEGMENTATION
APPROACHES

© Oxford University Press 2016. All rights reserved.


Active contour models

© Oxford University Press 2016. All rights reserved.


© Oxford University Press 2016. All rights reserved.
© Oxford University Press 2016. All rights reserved.
VALIDATION OF SEGMENTATION
ALGORITHMS

© Oxford University Press 2016. All rights reserved.


Metrics

© Oxford University Press 2016. All rights reserved.


© Oxford University Press 2016. All rights reserved.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy