Download presentation
Presentation is loading. Please wait.
Published byTheodore Boyd Modified over 9 years ago
1
Chap 3 : Binary Image Analysis
2
Counting Foreground Objects
3
Example
4
Counting Object Algorithm
5
Counting Background Objects
6
Connected Component Labeling
7
1. Recursive Connected Components Algorithm
8
Example
9
2. Classical Connected Components Algorithm
10
Size Filter To remove small size noise After connected component labeling, all components below T in size are removed by changing the corresponding pixels to 0.
11
Pepper & Salt Noise Reduction Change a pixel from 0 to 1 if all neighborhood pixels of the pixel is 1 Change a pixel from 1 to 0 if all neighborhood pixels of the pixel is 0
12
Expanding & Shrinking
13
Example 1
14
Example 2
15
Morphological Filter
16
Example
17
Example
18
Closing & Opening
19
Opening Example
20
Morphological Filter Example 1
21
Structure Element Example 1
22
Morpho- logical Filter Example 2
23
Structure Element Example 2
24
Conditional Dilation
25
Conditional Dilation Example
26
Area & Centroid
27
Perimeter
28
Circularity
29
Second Moment
30
Orientation
31
Bounding Box
32
Thresholding
33
P-Tile Method
34
Mode Method
35
Mode Algorithm
36
Iterative Method
37
Adaptive Method
38
Adaptive Method Example
39
Variable Thresholding Example
40
Double Thresholding Method
41
Double Thresholding Example
42
Recursive Histogram Clustering
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.