Sobel Canny i

Size: px

Start display at page:

Download "Sobel Canny i"

まれあくまじ
5 years ago
Views:

1 21 Edge Feature for Monochrome Image Retrieval

2 Sobel Canny i

3 Abstract Edge Feature for Monochrome Image Retrieval Naoto Suzue Content based image retrieval (CBIR) has been proposed as one of the image retreival system. The user imagines shape of the image and inquire the image retrieval system. The sketch image retrieval using edge feature has been proposed. The sketch image retrieval has a problem that the result of the image retrival is different depending on the user. Moreover, because the edge is the local feature, edge of the entire image cannot used for understanding position of edge. Conventional CBIR system are mostly designed for color image retrival. Then, the user imagines a shape feature and a color feature. Therefore, verification of retrieval performance of the image retrieval for edge features is difficult. Then we propose the combination of local features and golbal features. The local feature is dege of segmented region of image. The global feature is difference of average brigthness of areas of a image. 200 images and seven testees are used in the experiment. And, Sobel filter, Canny filter and proposal technique are used in the experiment. The results of the image retrieval indicate that accuracy of retrieval of the proposal technique improved more than the experiment key words monochrome image retrieval, edge feature, division image, local feature, global feature ii

4 Sobel Canny A 32 iii

5 Sobel Sobel d Sobel Canny A A iv

6 v

7 1 2 TBIR (Text Based Image Retrieval) [1][2][3] [4][5][6][7][10][11][12] CBIR (Content Based Image Retrieval) TBIR TBIR CBIR CBIR 2 1

8 [7][10] [10]. [4][12] [4] [12], 2 1 2

10 ( ) 2 ( ) 1 Sobel Canny x = f(x + 1, y) f(x, y) (2.1) y = f(x, y + 1) f(x.y) (2.2) x y

2.2 1 2.2.1 Sobel Sobel Sobel 2.3 2.3 Sobel 2.

12 Sobel Sobel Sobel Sobel Sobel [7] Sobel HSV H S V Sobel S V f Sd (x, y) f Id (x, y) d(d 0, π/4, π/2, 3π/4, π, 5π/4, 3π/2, 7π/4, 2π) e d W H e d = 1 W H W 1 x=0 H 1 y=0 G(f Sd (x, y), r S ) G(f Id (x, y), r I ) (2.3) G(a, b) = { 1 if (a < b) 0 otherwise (2.4) r S = τ S max f S d(x, y) (2.5) r I = τ I max f S d(x, y) (2.6) τ S 0.35 τ I

13 Sobel d 7

14 Canny Canny [9] Sobel Canny. Sobel

17 Sobel 2.9 Canny 11

18 Canny

19 Canny Sobel Canny = (3.1)

20 = (3.2)

22 4 Sobel Canny Sobel 2 Canny ArtExplosion

23 Sobel 8 Canny ArtExplosion N C N C R = R N (4.1) = R C (4.2) 17

27 Sobel 8 40 Canny

30 Sobel Canny Sobel Canny Sobel Canny Sobel Canny

31 4.5 25

32 5 Canny

33 27

34 PC Open CV 1 28

35 FreeBSD PC to!ht

36 [1],,,,, vol. 54, No. 11, pp , [2],,, HTML,, vol. J87-D-I, no. 2, pp , [3],,,,, vol. J82-D-II, no. 11. pp , [4],, Canny,, vol. 127, no. 11, pp , [5], 20 [6],, 12 [7] M. Serata, Y. Hatakeyam, and K. Hirota, Designing Image Retrieval System with the Concept of Visual Keys, J. of Advanced Computational Intelligence and Intelligent Informatics, vol. 10, no. 2, pp , 2006 [8],, pp , 2004/7/22 [9] J. Canny, A Computational Approach To Edge Detection. IEEE Trans. Pattern Anylysis and Machine Intelligence, vol. 8, no 6, pp , [10],, 20 [11],,, SOM, ] 13 (DEWS 2002)B1-3,

37 [12],,,,,, 56, 4, pp ,

38 A Canny A.1 32

39 A.2 33

24 Region-Based Image Retrieval using Fuzzy Clustering

24 Region-Based Image Retrieval using Fuzzy Clustering 1130323 2013 3 9 Visual-key Image Retrieval(VKIR) k-means Fuzzy C-means 2 200 2 2 20 VKIR 5 18% 54% 7 30 Fuzzy C-means i Abstract Region-Based Image