0% found this document useful (0 votes)
95 views

Edge Detection

Edge-based segmentation exploits spatial information by detecting edges in an image. Edges represent discontinuities in image homogeneity and can be used to divide an image into segments. Edge detection finds meaningful transitions in brightness by computing intensity differences in local regions. Common edge detection methods include using gradient operators, first-order derivatives like Roberts, Prewitt and Sobel kernels, and second derivatives like the Laplacian of Gaussian.

Uploaded by

blzz2net
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
95 views

Edge Detection

Edge-based segmentation exploits spatial information by detecting edges in an image. Edges represent discontinuities in image homogeneity and can be used to divide an image into segments. Edge detection finds meaningful transitions in brightness by computing intensity differences in local regions. Common edge detection methods include using gradient operators, first-order derivatives like Roberts, Prewitt and Sobel kernels, and second derivatives like the Laplacian of Gaussian.

Uploaded by

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

Edge-Based Segmentation

• Exploits spatial information by detecting the edges in an image.


• Edges -> Discontinuities in the homogeneity criterion for
segments.

E S. I N
KTU NOT

Downloaded from Ktunotes.in


E S. I N
KTU NOT

Downloaded from Ktunotes.in


Edge Detection
• Process of finding meaningful transitions in an image.
• The points where sharp changes in the brightness occur
typically form the border between different objects.
• These points can be detected by computing intensity
differences in local image regions.
S. I N
• Edge-detection algorithm should look for a neighbourhood
E
KTU NOT
with strong signs of change
• Most of the edge detectors work on measuring the intensity
gradient at a point in the image
• In images, edges characterize object boundaries and are
useful for segmentation and identification of objects in a
scene

Downloaded from Ktunotes.in


Derivatives to find Edges

E S. I N
KTU NOT

Downloaded from Ktunotes.in


Edge detection Methods (Refer Text)
• Using
– Gradient Operator
– First order Derivatives
– Roberts Kernel
– Prewitt Kernel
– Sobel Kernel
E S . I N
– Frei-Chen EdgeU N O
DetectorT
– KT Method
Second Derivative
– Laplacian of Gaussian
– Difference of Gaussians Filter (DoG)
– Canny Edge Detector

Downloaded from Ktunotes.in


Edge detection using Gradient Operator

E S. I N
KTU NOT

Downloaded from Ktunotes.in


Gradient Operator Example

E S. I N
KTU NOT

Downloaded from Ktunotes.in


Gradient Operator Example

E S. I N
KTU NOT

Downloaded from Ktunotes.in


Edge detection using First-order Derivatives
• First derivative must be
– Zero in flat segments (Constant gray-level values)
– Non-zero at the beginning of a gray level step or ramp
– Non-zero along ramp
• An image f(x,y) is a function in 2 variables.
N
T E S . I
N O
• So, we will take partial
U derivatives.
KT

Downloaded from Ktunotes.in


First derivative for Edge Detection

E S. I N
KTU NOT

Downloaded from Ktunotes.in


Roberts Kernel
• Main objective is to determine the differences b/w adjacent
pixels.
• Use {+1, -1} that calculates the difference b/w adjacent pixels
Forward differences.
• Roberts kernels are too small to reliably find edges in the
presence of noise.
E S. I N
NOT
• Cross Gradient operator is given by
KTU

• 2 x 2 mask is given by

Downloaded from Ktunotes.in


Prewitt Kernel
• Based on the idea of central difference.
• Better operator than Roberts operator.
• Consider the pixel arrangement

E S. I N
KTU NOT
• Setting c = 1, Prewitt operator mask is given by

• Prewitt mask differentiates in one direction and averages in


other direction So, edge detector is less vulnerable to noise
Downloaded from Ktunotes.in
Sobel Kernel
• Relies on central differences but gives greater
weight to the central pixels when averaging
• Sobel mask is given by

E S. I N
KTU NOT

• Noise suppression characteristic is better


than prewitt mask

Downloaded from Ktunotes.in


Prewitt and Sobel kernel for diagonal edge detection

E S. I N
KTU NOT

Edge detection using sobel mask


Downloaded from Ktunotes.in

You might also like