Download presentation
Presentation is loading. Please wait.
Published byBasil Flynn Modified over 9 years ago
1
图像处理技术讲座(11) Digital Image Processing (11) 灰度的数学形态学(3) Mathematical morphology in gray scale (3)
顾 力栩 上海交通大学 计算机系 2006.6
2
Lixu Gu @ 2005 copyright reserved
Conditional Dilation Conditional Dilation : a special recursive dilation operation. It is also known as Geodesic Dilation or Morphological Reconstruction used for restoring destroyed objective regions. Let M and V (M V) be two binary images defined as “marker” and “mask”, respectively. Conditional dilation Ri(M,V) is defined as: Marker M is only allowed to grow in the region restricted by mask V. Lixu 2005 copyright reserved
3
Lixu Gu @ 2005 copyright reserved
How it works Lixu 2005 copyright reserved
4
Morphological Reconstruction
Algorithm for binary reconstruction: 1. M = V o K , where K is any SE. 2. T = M, 3. M= M Ki , where i=4 or i=8, 4. M = M ∩ V, [Take only those pixels from M that are also in V .] 5. if M T then go to 2, 6. else stop; Original (V) Opened (M) Reconstructed (T) Lixu 2005 copyright reserved
5
Lixu Gu @ 2005 copyright reserved
Conditional Dilation Lixu 2005 copyright reserved
6
Grayscale Reconstruction
Step1: perform grayscale dilation on marker g. Step2: check every gray value in dilated result is not exceed the restriction of mask f. Step3: repeat step1 and 2, until g getting stable. Lixu 2005 copyright reserved
7
Grayscale Reconstruction
Lixu 2005 copyright reserved
8
Grayscale Reconstruction
Grayscale Opening by Reconstruction (OBR): Smooth image or detect seeds by grayscale opening operation Recover the objective regions by grayscale reconstruction f f °g r30X1Kline OBR Lixu 2005 copyright reserved
9
Grayscale Reconstruction
Grayscale Closing by Reconstruction(CBR): Smooth image by grayscale closing operation Recover the objective regions by grayscale reconstruction Lixu 2005 copyright reserved
10
Grayscale Reconstruction
OBR CBR Source r10Kdisk r20Kdisk Lixu 2005 copyright reserved
11
Grayscale Reconstruction
OBR CBR r5Kdisk r10Kdisk Lixu 2005 copyright reserved
12
Grayscale Reconstruction
Source OBR by r10Kdisk CBR by r10Kdisk Lixu 2005 copyright reserved
13
Grayscale Reconstruction
Lixu 2005 copyright reserved
14
Lixu Gu @ 2005 copyright reserved
Geodesic Distance Geodesic Distance: Let Fa be a connected region. The geodesic distance dFa(x,y) between two pixels x and y in Fa is the infimum of the length of the paths P which join x and y and are totally included in Fa: where, “” stands for the infimum and l(P) is the length of the path P. Lixu 2005 copyright reserved
15
Geodesic Distance vs. Euclidean Distance
Lixu 2005 copyright reserved
16
Geodesic Influence Zone
Geodesic Influence Zone (IZ): Suppose a region A contains a set B made of several connected components B1,B2,…, Bk. IZ is denoted by izA(Bi) and defined as: izA(Bi) is the locus of the points of A whose geodesic distance to Bi is smaller than the distances to any other components of B. SKIZ Lixu 2005 copyright reserved
17
Lixu Gu @ 2005 copyright reserved
SKIZ Skeleton by Influence Zone (SKIZ): the points of A which do not belong to any IZ, constitute the SKIZ of B inside A, denoted as SKIZA(B) : “A/B” means all members in A except those in B (BA) Lixu 2005 copyright reserved
18
Lixu Gu @ 2005 copyright reserved
Watershed The Great Divide Lixu 2005 copyright reserved
19
Watershed – Catchment Basin
Lixu 2005 copyright reserved
20
Lixu Gu @ 2005 copyright reserved
Watershed - Dam Lixu 2005 copyright reserved
21
Lixu Gu @ 2005 copyright reserved
Watershed How it works: Sort all the pixels in an image by their intensities Find the minimum intensity pixel as the start point (it’s gray level as the initial threshold level) Increase threshold level by 1: If find another local minimum point, add it to minimum list, and calculate the SKIZ with other existing minimum points Otherwise, calculate SKIZ within existing minimum list. Repeat 3., until all the pixels are sorted to basins or threshold exceed maximum intensity. Lixu 2005 copyright reserved
22
Lixu Gu @ 2005 copyright reserved
Watershed Demo Lixu 2005 copyright reserved
23
Marked Watershed - Demo
Lixu 2005 copyright reserved
24
Lixu Gu @ 2005 copyright reserved
Watershed - Example Source Image Watershed Over-segmented Lixu 2005 copyright reserved
25
Watershed - Example Merged by increase flood level Final Result
Lixu 2005 copyright reserved
26
Lixu Gu @ 2005 copyright reserved
Application Extract blood cells and separate them: Source Smoothed Binary Smoothed SKIZ Watershed Distance Transform Maximum points Lixu 2005 copyright reserved
27
Application The cell binary image overlay with watershed lines
Cells separated by watershed lines The Cells that touch the frames are removed Final Lixu 2005 copyright reserved
28
Lixu Gu @ 2005 copyright reserved
Exercise Lixu 2005 copyright reserved
29
Lixu Gu @ 2005 copyright reserved
Grayscale Operations Lixu 2005 copyright reserved
30
Lixu Gu @ 2005 copyright reserved
Grayscale Operations Lixu 2005 copyright reserved
31
Lixu Gu @ 2005 copyright reserved
Grayscale Operations Lixu 2005 copyright reserved
32
Lixu Gu @ 2005 copyright reserved
Grayscale Operations Lixu 2005 copyright reserved
33
Lixu Gu @ 2005 copyright reserved
Projects Lixu 2005 copyright reserved
34
Lixu Gu @ 2005 copyright reserved
Project1 Write your own code to realize dilation, erosion,opening and closing operations in grayscale. Requirement: Design your own UI and display I/O images Try to apply fast operations in case Lixu 2005 copyright reserved
35
Lixu Gu @ 2005 copyright reserved
Project2 Write code to realize the next functions: Morphological edge detection Morphological Reconstruction Conditional dilation in binary image Gray scale Reconstruction Morphological gradient Requirement: Design your own UI and display I/O images Try to apply fast operations in case Lixu 2005 copyright reserved
36
Lixu Gu @ 2005 copyright reserved
Discussion Lixu 2005 copyright reserved
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.