Scribd
Upload
12 views

CSE4227 Solns Chapter10

Uploaded by

saimon.cse.200104073
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
12 views

CSE4227 Solns Chapter10

Uploaded by

saimon.cse.200104073
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/ 16

Chapter 10: Image Segmentation

Origin42

Enigma41

2.a. i. Solution: 024


Image Segmentation:
In computer vision, Image Segmentation is the process of partitioning a digital image into
multiple segments (sets of pixels, also known as image objects).

Canny Edge Detection algorithm has 5 steps:


1. Smoothing
2. Finding Gradients
3. Non-Maximum suppression
4. Double thresholding
5. Edge tracking by hysteresis

Non-Maximum Suppression:
This step aims at reducing the duplicate merging pixels along the edges to make them uneven.
For each pixel find two neighbors in the positive and negative gradient directions, supposing
that each neighbor occupies the angle of pi/4, and 0 is the direction straight to the right. If the
magnitude of the current pixel is greater than the magnitude of the neighbors, nothing changes,
otherwise, the magnitude of the current pixel is set to zero.

False Positive: If the threshold is set too low, there will still be some false edge which is called
false positive.
False Negative: If the threshold is set too high, then actual valid edge points will be eliminated
which is called false negative.

Canny algorithm reduces these errors:


Canny algorithm reduces these errors by using double thresholding.
2.b. Solution: Toufique 116
From the graph, (m, c) = (-1, 5)
(ei part sure na)

m = tan theta = -1
=> theta = arctan(-1) = -45 degrees

Diameter, rho = x cos theta + y sin theta


= 20 cos (-45) + 25 sin (-45)
= -3.53

6.a. Solution: chapter 10


Recursive40

2.a. Solution: Rabab039


Region based segmentation is an image processing technique that identifies regions occupied by
different objects by grouping pixels based on their similarity of properties such as texture, color,
value etc. between nearby pixels.

Region Growing: In this technique, a starting pixel is selected and is grown by adding adjacent pixels
that have values very close to it and leaving the rest.

Region Splitting & Merging: In this technique, the image starts as a single region and then
subdivided into regions until a condition is satisfied. Then, the adjacent regions are merged if that
condition is satisfied.
3.a. Solution:
ch3

3.b. Solution:

2.a. Solution:
given

Prototype39
2.
Solution:
(i)
Limitations of this algorithm is that it does not work for vertical lines i.e. lines that are parallel to
the y-axis.

(ii)
The equation of line is, y = mx + c.
To perform Hough transform we need to convert image space (x, y) to parameter space (m, c).
So, y = mx + c => c = -mx + y

For (x, y) = (1, 2), c = -m + 2 —---------------------eqn(1)


If m = 0, c = 2
If c = 0, m = 2
For (x, y) = (2, 2), c = -2m + 2 —---------------------eqn(2)
If m = 0, c = 2
If c = 0, m = 1
For (x, y) = (3, 4), c = -3m + 4 —---------------------eqn(3)
If m = 0, c = 4
If c = 0, m = 4/3

So, intersect point is (m, c) = (1, 1)


Line equation, y = mx +c => y = x
Solution: 024
(i)
Three main steps in Edge Detection:
1. Filtering (Smoothing): In this stage image is passed through a filter to remove the noise.
2. Differentiation (Edge sharpening using derivatives): This stage highlights the location in
the image where intensity changes i.e. detects discontinuities.
3. Detection (Thresholding): This stage takes decision on the edge pixel i.e. where the
changes are significant.

(ii)
False Positive: If the threshold is set too low, there will still be some false edge which is called
false positive.
False Negative: If the threshold is set too high, then actual valid edge points will be eliminated
which is called false negative.

Canny algorithm reduces these errors:


Canny algorithm reduces these errors by using double thresholding.

Return38
1.

Solution: 45 sinusoidal curve


Solution:
P = xcos0* + ysin0*
For each, p & angle determine equaltion

Previous er random kono pdf theke (116)


Solution:

6.

Solution:
COREi36
5.

Solution:

Solution: 024
SOBEL OPERATOR ULTA NEYA HOISE
Position (2, 2) pixel values,
1 2 3

1 4 6 1

2 7 2 5

3 0 6 2

Using Sobel operator Gx,


4 6 1 -1 -2 -1 -4 -12 -1

7 2 5 X 0 0 0 = 0 0 0

0 6 2 1 2 1 0 12 2
Gx = -4-12-1+0+0+0+0+12+2 = -3

Using Sobel operator Gy,


4 6 1 -1 0 1 -4 0 1

7 2 5 X -2 0 2 = -14 0 10

0 6 2 -1 0 1 0 0 2
Gy = -4+0+1-14+0+10+0+0+2 = -5

G = |Gx| + |Gy| = 8
Theta = tan-1(Gy/Gx) = 59.036

4.

Solution:

Solution:
Solution:
Assuming 0 padding,
203 34 59

150 0 200

37 0 23

🔗 Part A

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