Date post: | 19-Jan-2016 |
Category: |
Documents |
Upload: | ashley-oliver |
View: | 223 times |
Download: | 0 times |
Low level Computer Vision1. Thresholding
2. Convolution
3. Morphological Operations
4. Connected Component Extraction
5. Feature Extraction
1
3. Mathematical Morphology Morphology: Study of forms of animals
and plants Mathematical Morphology: Study of
shapes Similar to convolution Arithmetic operations Set Operations
2
Need to define Image as a Set Given a binary image I (r,c), assume 1
correspond to object 0 correspond to backround. Define a set with elements to the coordinates of the object
X = { (r1,c1), (r2,c2),….}
3
Set OperationsSet Operations
Set Operations on ImagesSet Operations on ImagesAND, ORAND, OR
Set Operations on ImagesSet Operations on ImagesAND, ORAND, OR
TRANSLATION REFLECTIONTRANSLATION REFLECTIONTRANSLATION REFLECTIONTRANSLATION REFLECTION
Set OperationsSet Operations
Morphologic Operations
8
Binary mathematical morphology consists of twobasic operations
dilation and erosion
and several composite relations
closing and opening
Dilation:
9
Dilation expands the connected sets of 1s of a binary image.
It can be used for
1. growing features
2. filling holes and gaps
Structuring Elements
10
A structuring element is a shape mask used inthe basic morphological operations.
They can be any shape and size that isdigitally representable, and each has an origin.
boxhexagon disk
something
box(length,width) disk(diameter)
Dilation with Structuring Element S:B+S ={ Z: (Sz)∩ B≠ Φ}
11
The arguments to dilation and erosion are
1. a binary image B2. a structuring element S
dilate(B,S) takes binary image B, places the originof structuring element S over each 1-pixel, and ORsthe structuring element S into the output image atthe corresponding position.
0 0 0 00 1 1 00 0 0 0
11 1
0 1 1 00 1 1 10 0 0 0
originBS
dilate
B S
DILATIONDILATION
DILATIONDILATION
Erosion B-S ={ Z: (Sz) B}
14
Erosion shrinks the connected sets of 1s of a binary image.
It can be used for
1. shrinking features
2. Removing bridges, branches and small protrusions
Erosion with Structuring Elements
15
erode(B,S) takes a binary image B, places the origin of structuring element S over every pixel position, andORs a binary 1 into that position of the output image only ifevery position of S (with a 1) covers a 1 in B.
0 0 1 1 00 0 1 1 00 0 1 1 01 1 1 1 1
111
0 0 0 0 00 0 1 1 00 0 1 1 00 0 0 0 0
B S
origin
erode
B S
EROSİON:EROSİON:
IMAGE ENHANCEMENT WİTH MORPHOLOGYIMAGE ENHANCEMENT WİTH MORPHOLOGY
Example to Try
18
0 0 1 0 0 1 0 0 0 0 1 1 1 1 1 0 1 1 1 1 1 1 0 01 1 1 1 1 1 1 10 0 1 1 1 1 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 0 0
1 1 11 1 11 1 1
erode
dilate with same structuring element
SB
Opening and Closing
19
• Closing is the compound operation of dilation followed by erosion (with the same structuring element)
• Opening is the compound operation of erosion followed by dilation (with the same structuring element)
Use of Opening
20
Original Opening Corners
1. What kind of structuring element was used in the opening?
2. How did we get the corners?
OPENİNG AND CLOSİNGOPENİNG AND CLOSİNGOPENİNG AND CLOSİNGOPENİNG AND CLOSİNG
FINGERPRİNT RECOGNİTİONFINGERPRİNT RECOGNİTİON
HOW DO YOU REMOVE THE HOLESHole: A closed backround region surrounded by object pixels
HOW DO YOU REMOVE THE HOLESHole: A closed backround region surrounded by object pixels
Morphological Analysis for Bone detectionMorphological Analysis for Bone detection
OBJECT DETECTIONOBJECT DETECTION
BOUNDARY EXTRACTİONBoundary: A set of one-pixel-wide
connected pixels which has at least one neighbor outside the object
BOUNDARY EXTRACTİONBoundary: A set of one-pixel-wide
connected pixels which has at least one neighbor outside the object
BOUNDARY EXTRACTİONBOUNDARY EXTRACTİON
Skeleton finding:Skeleton: Set of one-pixel wide connected pixels which
are at equal distance from at least two boundary pixels
Skeleton finding:Skeleton: Set of one-pixel wide connected pixels which
are at equal distance from at least two boundary pixels
Morphological Image ProcessingMorphological Image Processing
Morphological Image ProcessingMorphological Image Processing
Morphological OperationsMorphological Operations
Morphological OperationsMorphological Operations
Gear Tooth Inspection
34
originalbinary image
detecteddefects
How didthey do it?
Some Details
35
Region Properties-Features
36
Properties of the regions can be used to recognize objects.
• geometric properties (Ch 3)
• gray-tone properties
• color properties
• texture properties
• shape properties (a few in Ch 3)
• motion properties
• relationship properties (1 in Ch 3)
Geometric and Shape Properties
37
• area:
• centroid:
• perimeter :
• perimeter length:
• circularity:
• elongation• mean and standard deviation of radial distance• bounding box• extremal axis length from bounding box• second order moments (row, column, mixed)• lengths and orientations of axes of best-fit ellipse
4. Connected Components Labeling
38
Once you have a binary image, you can identify and then analyze each connected set of pixels.
The connected components operation takes in a binary image and produces a labeled image in which each pixel has the integer label of either the background (0) or a component.
binary image after morphology connected components
Methods for CC Analysis
39
1. Recursive Tracking (almost never used)
2. Parallel Growing (needs parallel hardware)
3. Row-by-Row (most common)
• Classical Algorithm (see text)
• Efficient Run-Length Algorithm (developed for speed in real industrial applications)
Equivalent Labels
40
0 0 0 1 1 1 0 0 0 0 1 1 1 1 0 0 0 0 10 0 0 1 1 1 1 0 0 0 1 1 1 1 0 0 0 1 10 0 0 1 1 1 1 1 0 0 1 1 1 1 0 0 1 1 10 0 0 1 1 1 1 1 1 0 1 1 1 1 0 0 1 1 10 0 0 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 10 0 0 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 10 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 0 0 1 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1
Original Binary Image
Equivalent Labels
41
0 0 0 1 1 1 0 0 0 0 2 2 2 2 0 0 0 0 30 0 0 1 1 1 1 0 0 0 2 2 2 2 0 0 0 3 30 0 0 1 1 1 1 1 0 0 2 2 2 2 0 0 3 3 30 0 0 1 1 1 1 1 1 0 2 2 2 2 0 0 3 3 30 0 0 1 1 1 1 1 1 1 1 1 1 1 0 0 3 3 30 0 0 1 1 1 1 1 1 1 1 1 1 1 0 0 3 3 30 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 0 0 1 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1
The Labeling Process
1 21 3
Run-Length Data Structure
42
1 1 1 11 1 11 1 1 1
1 1 1 1
0 1 2 3 401234
U N U S E D 00 0 1 00 3 4 01 0 1 01 4 4 02 0 2 02 4 4 04 1 4 0
row scol ecol label
01234567
Rstart Rend
1 23 45 60 07 7
01234 Runs
Row Index
BinaryImage
Run-Length Algorithm
43
Procedure run_length_classical { initialize Run-Length and Union-Find data structures count <- 0
/* Pass 1 (by rows) */
for each current row and its previous row { move pointer P along the runs of current row move pointer Q along the runs of previous row
Case 1: No Overlap
44
|/////| |/////| |////|
|///| |///| |/////|
Q
P
Q
P
/* new label */ count <- count + 1 label(P) <- count P <- P + 1
/* check Q’s next run */Q <- Q + 1
Case 2: Overlap
45
Subcase 1: P’s run has no label yet
|///////| |/////| |/////////////|
Subcase 2:P’s run has a label that isdifferent from Q’s run
|///////| |/////| |/////////////|
P P
label(P) <- label(Q)move pointer(s)
union(label(P),label(Q))move pointer(s)
}
Pass 2 (by runs)
46
/* Relabel each run with the name of the equivalence class of its label */For each run M { label(M) <- find(label(M)) }
}
where union and find refer to the operations of theUnion-Find data structure, which keeps track of setsof equivalent labels.
Labeling shown as Pseudo-Color
47
connectedcomponentsof 1’s fromthresholdedimage
connectedcomponentsof clusterlabels
Region Adjacency Graph
48
A region adjacency graph (RAG) is a graph in whicheach node represents a region of the image and an edgeconnects two nodes if the regions are adjacent.
1
2
34
1 2
34