Presentation is loading. Please wait.

Presentation is loading. Please wait.

Image Segmentation & Template Matching Multimedia Signal Processing lecture on 6.3.2007 Petri Hirvonen.

Similar presentations


Presentation on theme: "Image Segmentation & Template Matching Multimedia Signal Processing lecture on 6.3.2007 Petri Hirvonen."— Presentation transcript:

1 Image Segmentation & Template Matching Multimedia Signal Processing lecture on 6.3.2007 Petri Hirvonen

2 Image Segmentation

3 Terminology Image processing tools Examples Details of the Assignment Tracking Rolling Leukocytes With Shape and Size Constrained Active Contours Image segmentation based on maximum-likelihood estimation and optimum entropy-distribution (MLE–OED)

4 Image segmentation problem is basically one of psychophysical perception, and therefore not susceptible to a purely analytical solution.

5

6 Motivation: Image content representation Requirements: object definition & extraction Mathematical morphology is very useful for analyzing shapes in images. Basic tools: dilation A+B and erosion A – B Application: boundary detection Internal boundary: A - (A – B) External boundary: (A+B) - A Morphological gradient: (A+B) - (A – B) Assignment: object edges A - (A – B) (A+B) - A (A+B) - (A – B)

7 Dilation: Replace every point (x,y) in A with a copy of B centered at B(0,0) The result D is the union of all translations. Erosion: The resulting set of points E consists of all points for which B is in A. 0 0 0 0 0 0 1 1 0 0 0 1 1 1 0 0 0 1 1 0 0 0 0 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 1 1 0 1 0 AADDEE BB Structuring element, kernel = B Minkowski addition / subtraction

8

9 Image information

10

11 Segmenting SEM-images

12 Dilation of the thresholded block contains the thresholded gradient completely at the optimal threshold. (k and p are thresholds, D is dilation with a structuring element of radius r)

13

14 Information & colour

15

16

17 Nobuyuki Otsu, A Threshold Selection Method from Gray-Level Histograms, 1979 For bimodal distributions minimized maximized Histogram-based thresholding Otsu’s method

18 Probability of intensity k Mean of group @ k

19 Hough transformRegion Of Interest Histogram

20

21 Length and width are the perpendicular distances on the original (thresholded) target area. Perimeter is computed by the Chain Code algorithm.

22 Template Matching

23

24

25

26

27 We have first created a DATABASE that contains the elements in the table. FOR-loop is executed for all templates Font_images{index} And the result is visualized in colours: Scale ? Rotation ?

28

29 Object perimeter

30

31


Download ppt "Image Segmentation & Template Matching Multimedia Signal Processing lecture on 6.3.2007 Petri Hirvonen."

Similar presentations


Ads by Google