CSSE463: Image Recognition Day 9
Lab 3 (edges) due Weds Test 1 Monday.
Mostly written problems too long for in-class
quizzes
Will include a take-home part (1-2 questions)
CSSE463: Image Recognition Day 9 Lab 3 (edges) due Weds Test 1 - - PowerPoint PPT Presentation
CSSE463: Image Recognition Day 9 Lab 3 (edges) due Weds Test 1 Monday. Mostly written problems too long for in-class quizzes Will include a take-home part (1-2 questions) that Ill distribute later this week Today: region
Mostly written problems too long for in-class
Will include a take-home part (1-2 questions)
4-connectivity vs. 8-connectivity matters Could you write a recursive algorithm for
Area: sum of pixels in region Centroid: (avg row, avg column) =
[r,c] = find(mask == 1)
∈
R c r
) , (
∈
R c r
) , (
∈
R c r
) , (
Q1
Extent = (area of region)/ (area of bounding box) What types of shapes have maximal/minimal extent?
Perimeter (assume no holes)
The set of interior border pixels Interpretation, please? In Matlab P8(region) is called bwperim(region, 4)
The output is a mask
The definition for P4 is dual to P8 .
4 8
1.
Matlab’s bwtraceboundary
1.
On the test, you’ll study the “inner boundary tracing” algorithm (from text)
1.
Extremely efficient representation for large regions
Each pair of horizontal/vert. neighbors contributes 1
Each pair of diagonal neighbors contributes sqrt(2)
Which is typically shorter, |P8| or |P4| ?
Q2,3
Circles (theoretically)
Why?
Having a small standard
Sample radial
What’s a circle’s C2?
2 1
[ ]
center from distances
deviation standard center from pixel boundary
distance mean vector
length Euclidean perimeter
pixels
# ) , ( ) , ( 1 ) , ( ) , ( 1 where ,
2 1 2 1 1 2
= = = ⋅ = − − = − = =
= = R R N i R i i R N i i i R R R
N c r c r N c r c r N C µ µ µ σ µ σ µ
Q2,4