2012 9th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2012)

Image Retrieval based on color and texture features

Ching-Hung Sua,b , Mohd Helmy Abd Wahabc and Tsai-Ming Hsiehb
a b

Department of Electronic Engineering, Lunghwa University of Science and Technology, Taoyuan, Taiwan Department of Information and Computer Engineering, Chung Yuan Christian University, Chung-Li, Taiwan c Department of Computer Engineering, Universiti Tun Hussein Onn Malaysia, Malaysia chsu@mail.lhu.edu.tw, helmy@uthm.edu.my, hsieh@cycu.edu.tw

Abstract - In this paper, the algorithm for a novel image retrieval scheme to retrieve images is presented. We address the unique algorithm to extract the colour pixel features by the HSV colour space and the texture features of Mpeg-7 Edge Histogram Descriptor .The proposed scheme transfers each image to a quantized colour code using the regulations of the properties in compliance with HSV model and subsequently using the quantized colour code along with the texture feature of Edge Histogram Descriptor to compare the images of database. We succeed in transferring the image retrieval problem to quantized code comparison. Thus the computational complexity is decreased obviously. Our results illustrate it has merits both of the content based image retrieval system and a text based image retrieval system. Keywords - quantized colour code; HSV colour space; text based image retrieval; colour histogram; edge histogram; Minkowski Metric; Histogram Intersection.

The features of Content-based image such as colour, shape, texture and outline are used for image retrieval. Among these features, colour is an important feature in CBIR, which is invariant on size, orientation and complexity. In this paper, we proposed the novel feature extraction technique using HSV colour space instead of RGB colour space for image retrieval. II. HSV COLOUR SPACE

I.

INTRODUCTION

Multimedia data such as image and video has been widely spreading on account of internet prevalent. In the recent years, content-based image retrieval (CBIR) has been an active research area in image processing. Content-based image retrieval has many application areas such as, architectural design, education, commerce, military, medical diagnosis, biomedicine and web image classification. Due to the tremendous growth of digital image and video on internet, results to the traditional text-based retrievals based on keywords are not sufficient enough to resolve image retrieval. CBIR can greatly enhance the accuracy and efficiency of retrieving and managing the data of image. CBIR manipulate on different principles from keyword indexing. Some commercial CBIR systems are now available. The CBIR system like IBMs QBIC [1][2][10], based on distribution and characteristics of colour, shape, texture, sketch and example to retrieve image. Chabot system employs text along with colour histogram and integrates a relational database to retrieve image. VisulSEEK system [9] developed at Columbia University Center for Telecommunication Research, employs colour percentage from colour and spatial layout region of colours to retrieve image.

The HSV stands for the Hue, Saturation and Value, is sometimes referred to as HSI for hue, saturation and intensity, or HSB for hue, saturation, and brightness provides the perception representation according with human visual feature. The HSV model, defines a colour space in terms of three constituent components: Hue, the colour type range from 0 to 360 relative to the red red primary at 0, passing through the green primary at 120 and the blue primary at 240, and then back to red at 360. Saturation, the "vibrancy" of the colour: Ranges from 0 to 100%, and occasionally is called the "purity". Value, the brightness of the colour: Ranges from 0 to 100%. HSV is cylindrical geometries, with hue, their angular dimension, starting at the, In our system, we employ the HSV colour space instead of the RGB colour space in two reasons. One is the lightness component is independent factor of images and second is the components of hue and saturation are so closely link with the pattern of human visual perception. To decrease the number of colours used in image retrieval, we quantize the number of colours into several bins. J.R. Smith [9] designs the scheme to quantize the colour space into 166 colours. Li [12] design the non-uniform scheme to quantize into 72 colours. We propose the scheme to produce 15 non-uniform colours. The formula that transfers from RGB to HSV is defined as below:

H = cos 1

1 [( R G ) + ( R B)] 2 (1) ( R G ) 2 + ( R B)(G B)

(2) (3)

S = 1

V =

1 ( R + G + B) 3

3 (min( R, G, B)) R+G+ B

978-1-4673-0024-7/10/$26.00 2012 IEEE

1816

The R, G, B represent red, green and blue components respectively with value between 0-255, where H stands for Hue, S stands for saturation, V stands for value. In order to obtain the value of H from 00 to 3600, the value of S and V from 0 to 1, we do execute the transforming calculation. The proposed scheme for HSV space contains three phases. First of all we resize all images to reduce the size of images and processing time. Secondly we convert each pixel of resized image to quantized colour code. Finally we compare the quantized colour code between the query image and database image. In conventional schemes[3][4][5], they extract the image feature vector from images employ descriptors like colour Histogram Intersection and Minkowski Metric (LM norm) to measure the similarity of image for matching between a query image and image from database. [6][7][8] When matching processing is completed, results are sorted in ascending order and retrieval images are presented. Minkowski Metric equation has been extended in equation (4), where Histogram Intersection is defined in equation 5. III. EDGE HISTOGRAM DESCRIPTOR

TABLE I.

SEMANTICS OF LOCAL EDGE BINS

The Edge Histogram Descriptor in Mpeg-7 [13] represent local edge distribution in the image which obtained by partitioning the whole image into 16(4 x 4) sub-images as shown in figure 1. Edges in all sub-images are categorized into five types, four directional edges named vertical, horizontal, 45 degree and 135 degree and one non-directional edge. To generate the histogram of each sub-image, a total of 80 histogram bins (16 x 5, 16-sub-images and five types of edges) as shown in Table 1. The Edge Histogram Descriptor captures the spatial distribution of edges. Each of the 16 sub-images is divided into image blocks to obtain the edge histograms. Each sub-image block treated as a 2 2 pixel image-block. We employ the filters for edge detection shown as figure 2 to compute corresponding edge intensity values of each sub-image. If intensity values of the edge exceed a given threshold, then the corresponding image block is considered to be an edge block.[15]

Figure 2. Filter for edge detection

IV.

METHODOLOGY

In conventional schemes[3][4][5], they extract the image feature vector from images employ descriptors like Colour Histogram Intersection and Minkowski Metric (LM norm) to measure the similarity of image for matching between a query image and image from database. [6][7][8] When matching processing is completed, results are sorted in ascending order and retrieval images are presented. Minkowski Metric equation has been extended in equation (4), where Histogram Intersection is defined in equation (5).

d (i, j ) = ( | xik x k ) |M )1 / M 1<i<n j

k =1

(4)

Where p is the dimension of the vector xi .

d hi ( (Q, T ) = 1

min(Q , T )
i i i =0

N 1

min(| Q |, | T |)

(5)

where Q indicates query, T indicates Target . We proposed an efficient scheme to retrieve images. First of all to resize all images to 20x20 pixels normalized size. All frames of image are resized by the bicubic interpolation technique as described in Gonzalez et al. [11]. We find that each colours scope is nonuniform from hue panel of HSV colour space. The three primary colours of R, G and B

Figure 1. Definition of sub-image and image-block

1817

possess more scope than the other colours. We segment the scope of into six non-uniform class including three primary colour and scope of the hue which the components of HSV colour scope of the hue which the components of HSV colour space or space possess more scope than the other colours. We segment the the scope interposed between two primary colours, each class depending on the value of saturation of the components of HSV colour space divides two subclass along with the colour of white and black according to the value on saturation and value of the components of HSV colour space, the total is 14 class. Each pixel of the images from query and database assigned the quantized colour code. Compare quantized colour code between each pixel of three components of HSV colour space of the images (20x20 pixels) from query and database, we obtain the weight of the quantized colour code has compared. We should adjust the weight value between two retrieval features owing to two characteristic features which includes RGB colour space and texture features. The ratio of 6 to 4 between the similarity measurement of RGB colour space and Edge Histogram Descriptor obtained better performance through experiments. Finally sort the weight value of similarity feature vector and the retrieval images are presented if searching is completed. The performance of an information retrieval system can be measured in terms of its recall and precision. Precision is the fraction of retrieved documents that are relevant to the search, Recall in information retrieval is the fraction of the documents that are relevant to the query that are retrieved correctly. Precision = Number of Relevant Documents Retrieved / Total Number of Retrieved Documents Recall = Number of Relevant Documents Retrieved / Total Number of Relevant Documents

compare the images of database. We succeed in transferring the image retrieval problem by quantized colour code comparison. Thus the computational complexity is decreased obviously. Experimental results reveal that proposed scheme is better than the conventional methodologies.

REFERENCES
[1] IBM Research, Almaden. URL: http://www.qbic.almaden.ibm.com

[2] IBM Data Management. QBIC. URL:

http://www.research.ibm.com/topics/popups/deep/manage/html/qbic.htm l [3] H. Mller, N. Michoux, D. Bandon, A. Geissbuhler, A review of content-based image retrieval systems in medical applicationsclinical benefits and future directions, Int. J. Med. Inform. 73 (1) (2004) pp. 1 23., 2004. [4] S. Antani, R. Kasturi, R. Jain, A survey on the use of pattern recognition methods for abstraction, indexing and retrieval of images and video, Pattern Recog. 35(4), pp. 945 - 965, April, 2002. [5] Ying Liu, Dengsheng Zhang, Guojun Lu, Wei-Ying Ma, A survey of content-based image retrieval with high-level semantics, Pattern Recog., 40(1), pp. 262-282, January 2007. [6] M. J. Swain and D. H. Ballard. Colour Indexing, Int. J. of Computer Vision, 7(1)11-32,1991. [7] Theodoros Giannakopoulos. URL: http://cgi.di.uoa.gr/~tyiannak/ [8] H. Jeong-Yo, K. Gye-Young, C. Hyung-Il. The Content-Based Image Retrieval Method Using Multiple Features Fourth Intl Conf. on Network Computing and Management 2008, Sept. 2 4, 2008, Seoul, Korea, pp. 652 - 657 [9] J. R. Smith, Integrated spatial and feature image system: Retrieval, analysis and compression PhD dissertation, Columbia University, New York, 1997 [10] C. W. Niblack, R. J. Barber, W. R. Equitz, M. D. Flickner, D. Glasman, D. Petkovic, P. C. Yanker. The QBIC Project: Querying Images by Content Using Colour, Texture, and Shape, IBM Thomas J. Watson Research Center, Vol. 9203, pp. 173-181, 1993 [11] R. C. Gonzalez and R. E. Woods, Digital Image Processing, AddisonWesley, 1992. [12] L. Guohui, L. Wei, C. Lihua, An Image Retrieval Method Based on Colour Perceived Feature, Journal of Image and Graphics, Vol. 3 1999. [13] Leszek Cieplinski, Munchurl Kim, Jens-Rainer Ohm, Mark Pickering, Akio Yamada Multimedia Content Description InterfacePart 3: Visual. Final Committee Draft, ISO/IEC/JTC1/SC29/WG11, Doc. N4062, Mar. 2001. [14] James Z. Wang, Jia Li and Gio Wiederhold, ``SIMPLIcity: Semanticssensitive Integrated Matching for Picture LIbraries,'' IEEE Trans. on Pattern Analysis and Machine Intelligence, 23(9), pp. 947-963, 2001 [15] Manjunath, B.S.; Ohm, J.-R.; Vasudevan, V.V.; Yamada, A.; Colour and Texture Descriptors IEEE Trans. on Circuits and Systems for Video Technology.11(6), pp. 703 715, 2001.

V. EXPERIMENTAL RESULTS The experimental database contains 1200 images including animals, sceneries, plants and flowers taken from internet and 1000 test images from SIMPLIcity paper[14] of Wangs image database. The outcome of the experiment can be achieved by the scheme we proposed. Experimental examples are shown from Figure 3 through Figure 7. Comparing the results of the project [7] and our previous X-RGB colour space scheme our scheme performs better than project [7] and our previous scheme. VI. CONCLUSION The single feature of image information is not easy to get the comprehensive properties of the content of image. We proposed scheme based on both the features of colour and texture to combines a HSV colour space and Edge Histogram Descriptor in Mpeg-7. We transfers each pixel of image to a quantized colour code using the regulations of the properties in compliance with HSV model and using the quantized colour code associate with the retrieval features of EHD to

1818

Figure 3. Precision Recall curve for the result of the proposed scheme, XRGB space and project[7]

Figure 6. Retrieval result based on the Proposed scheme

Figure 4. Retrieval result based on the Proposed scheme

Figure 7. Retrieval result based on X-RGB space scheme

Figure 5. Retrieval result based on X-RGB space scheme

1819