1. 曾令祺 性別：男 籍貫：大陸湖北省 Facebook/Email ： katncandix1@gmail.com

2. THANK EVERYONE!

3. Chapter 5 Mathematical Morphology

4. Break Time!

5. 5.1 Introduction mathematical morphology works on shape shape: prime carrier of information in machine vision morphological operations: simplify image data,preserve essential shape characteristics, eliminate irrelevancies shape: correlates directly with decomposition of object, object features, object surface defects, assembly defect

6. 5.2 Binary Morphology set theory: language of binary mathematical morphology sets in mathematical morphology: represent shapes Euclidean N-space: E N discrete Euclidean N-space: Z N N=2: hexagonal grid, square grid 約定用 “1” 和黑色表示二值圖像中的前景（物體）像 素， “0” 和白色表示背景像素

7. dilation, erosion: primary morphological operations opening, closing: composed from dilation, erosion opening, closing: related to shape representation decomposition, primitive extraction erosiondilation

8. 5.2.1 Binary Dilation

11. A: referred as set, image B: structuring element: kernel dilation by disk: isotropic( 等方性 ) swelling or expansion

13. dilation by kernel without origin: might not have common pixels with A translation of dilation: can contain A

18. dilating A by kernel with origin guaranteed to contain A extensive: operators whose output contains input dilation extensive when kernel contains origin.

21. Break Time!

22. 5.2.1 Binary Erosion

24. erosion of A by B: set of all x for which B translated to x contained in A if B translated to x contained in A then x in A B erosion: difference of elements a and b

25. dilation: union of translates erosion: intersection of negative translates

27. erosion: shrinking of the original image antiextensive: operated set contained in the original set erosion antiextensive: if origin contained in kernel

28. eroding A by kernel without origin can have nothing in common with A

30. dilating translated set results in a translated dilation eroding by translated kernel results in negatively translated erosion dilation, erosion: increasing

32. eroding by larger kernel produces smaller result Dilation, erosion similar that one does to foreground, the other to background

33. negation of a set: complement negation of a set in two possible ways in morphology logical sense: set complement geometric sense: reflection: reversing of set orientation

34. dual: negation of one equals to the other on negated variables DeMorgan’s law: duality between set union and intersection

35. Erosion Dilation Duality

37. erosion of intersection of two sets: intersection of erosions

39. erosion of a kernel of union of two sets: intersection of erosions erosion of kernel of intersection of two sets: contains union of erosions

41. chain rule for erosion holds when kernel decomposable through dilation duality does not imply cancellation on morphological equalities containment relationship holds

42. genus g(I): number of connected components minus number of holes of I A hole is a connected component of binary-0 pixels that does not connect with border frame of the image 4-connected for object, 8-connected for background 8-connected for object, 4-connected for background

44. () g 4 (I) = 17 - 9 - 8 + 1 = 1g 4 (J) = 17 - 9 - 7 + 3 = 4

47. Break Time!

48. hit-and-miss: selects corner points, isolated points, border points hit-and-miss: performs template matching, thinning, thickening, centering hit-and-miss: intersection of erosions J,K kernels satisfy hit-and-miss of set A by (J,K) 5.2.3 Hit-and-Miss Transform

49. hit-and-miss: to find upper right-hand corner

51. Hit-and-miss: locate particular spatial patterns

52. hit-and-miss: to compute genus of a binary image

53. hit-and-miss: thinking

54. Iterations of thicking operation can be used to determine convex hull A set of points is defined to be convex if it contains the line segments connecting each pair of its points.

56. hit-and-miss: thinning

57. Iterations of thinning operation can be employed to determine skeletons.

59. 5.2.4 Dilation and Erosion Summary

61. Break Time!

62. 5.2.5 Opening and Closing

63. opening characterization theorem selects points covered by some translation of K, entirely contained in A

67. opening with disk kernel 刪除小物體 將物體拆分為小物體 平滑圖像的輪廓，削弱狹窄的部份，去掉細的突出

68. F: shape with body and handle L: small disk structuring element with radius just larger than handle width extraction of the body and handle by opening and taking the residue

77. closing with disk kernel 填充物體的小洞 連接相近的物體 平滑圖像的輪廓，融合窄的缺口和細長的彎口

78. closing may be used to detect spatial clusters of points

79. Break Time!