2013 Third International Conference on Intelligent System Design and Engineering Applications

A New Retrieval Method Based on YUV Clour Information for Digital Libraries
He lei
Hangzhou Wanxiang Polytechnic, Hangzhou, Zhejiang Province, 310023, China yscls_2005@yahoo.com.cn and form a driving force for the development of the digital library. To get fast and accurate image retrieval for the targets, we proposed a new image retrieval method by integrating wavelet decomposition with the YUV component of the original image. II. PROPOSED ALGORITHM

AbstractImage retrieval is the core technology to the further development of the digital library. At present, image retrieval is mainly restricted by the conflict between retrieval accuracy and retrieval speed. In order to solve this problem, an image retrieval method based on wavelet decomposition of YUV component images had been proposed in this paper. First, YUV component images were computed from original image information. Second, every component image was carried out wavelet decomposition, and then low-frequency component was extracted. Finally, similarity function was generated by fusing low-frequency of three component images. Experimental results demonstrated that the method proposed in this paper has a high retrieval accuracy at a fast speed. Keywords-Digital library, Image retrieval, YUV component, Wavelet decomposition

I.

INTRODUCTION

With the development of information globalization, Digital library technology has gotten increasingly favored by the users[1].Users can get access to the convenient and efficient service only by a line rather than going out. As the extension of conventional library technology, nowadays digital library have already become dominant. Compared with conventional library, digital library received universal welcome by the internet users for its paperless and mass storage, timely and perfect service. Image is among the most frequent types of data in the digital retrieval due to more rich information and easy to understand [3].Thus, an efficient digital library should offer image retrieval result accurately and timely, which has become a hot area in digital library technology. The existing image retrieval technology in digital libraries can be categorized into text-based and content-base methods [4].Text-based image retrieval technology takes text information such as the name of images as the index, so the results definitely have low robustness and high false detection rate. In contrast, content-base retrieval search images by various features in the images, including color, texture and structure, and achieve higher accuracy and reliability. The later has become the main technology in current digital library. Currently content-based image retrieval methods have been universally developed. However, all the methods have to subject to a basic problem, that is, the contradiction between the higher accuracy and computing time for more reliable retrieval results in the user requirements. Therefore, how to reduce the retrieval time with a certain accuracy rate has become the key problem in image retrieval technology
978-0-7695-4923-1/12 $26.00 2012 IEEE DOI 10.1109/ISDEA.2012.37 128

(1)Our overall scheme Color is the most frequently used features of the image retrieval. Among the common color format of image including RGB and YUV. In YUV format, Y is the light information and U and V are clour information. Then can reflect similarity of different image from many fields. similarity for the three components(YUV) are been compared respectively, the retrieval reliability will definitely higher than that only with the whole original images. Therefore, it is quite nature to try to compute the similarity measure with Y, U and V component to improve the accuracy of image retrieval and surely more computing time is required. Wavelet decomposition can be used to speed up the process in the image processing area. If we use lowfrequency component from the wavelet decomposition on different components of the original YUV images to get the similarity measure, the computing time will definitely be reduced. Thus, the idea that integrating the wavelet decomposition with different components is the origin for the image retrieval method we proposed. The flowchart for the idea is shown as figure 1.

Figure 1. Figure 1.Flowchart for the proposed image retrieval

From the flowchart in figure 1, the image retrieval method in this paper can be as follows: firstly,we get YUV component images from original images. After wavelet decomposition has been carried on every component of the image, we extract the low-frequency component. Finally, we compare the similarity for low-frequency part of three component images and obtain the retrieval result. (2)Obtaining the YUV component images

Colour image is a concept relative to greyscale image in which the component value for three colours is equal. Greyscale image can be taken as a special kind of colour images, Nowadays digital image has been a main form of image storage and colour image stored in the computer can be described by the formula (1): (1) C R u 256 0  G u 2561  B u 256 2 From the formula (1),we can see that the color information for each pixel in a image C contains three component red, green and blue. If the color information for some pixel is known, we can deduce the YUV component value with formula (2). Y 0.30 R  0.59G  0.11B (2) U 0.493( B  Y ) V 0.877( R  Y ) YUV components contain richer information than the original image, which will surely bring about higher reliability in image retrieval. However, the total comparison time for three components is equal to three times of the original image, definitely resulting the less retrieval time. (3)Wavelet decomposition of YUV component images To improve the total time for image retrieval, we introduced the idea wavelet decomposition to the comparison of YUV component images. The wavelet decomposition for a image can be illustrated as figure2.
LL(1)
LL
(0)

k 1) (5) HL( k ) ( m, n ) [[ LL(rows * G ] 2p1columns * H ]1p 2 k k k 1 Here m 1,  , M / 2 , n N / 2  1,  , N / 2 k 1) (6) HH ( k ) ( m, n) [[ LL(rows * G ] 2p1columns * G ]1p 2 Here m is the value for m in (4) and n is the value for n

in formula (5). H and G represents the lowpass and highpass filter after the wavelet decomposition respectively; 2112represent the sampling along the column/row, k represents the number of the wavelet decomposition. According to the formulae above, we can obtain the subimage LL
(k )

still enough similar to the original image LL in the vision effect while its size is 1/16 if the reference. Thus, retrieval with this subimage will greatly reduce the comparison time in the process. (4)Similarity measure for retrieval Similarity comparison is the key link for image retrieval. Whatever features or strategies we use, the image retrieval will be finished by comparison the similarity measure. Integrated the YUV component feature and the wavelet decomposition to speed up the process, the proposed retrieval method requires taking its implementation into account. The similarity measure for the method can be described as formula (7).

decomposition in the second scale, the subimage LL

( k 2)

from LL

( k 1)

.When taking the wavelet

(k )

is

LH (1)

LL( 2 )

LH ( 2 )

LH (1)

HL
HL(1)
HH (1)

( 2)

HH ( 2 )
HH (1)

S (Q, I n )

(YLL(qk ) ( m, n)  YLL(Ikn ) (m, n)) 2

(7)

HL(1)

 (ULL(qk ) ( m, n)  ULL(Ikn ) ( m, n)) 2  (VLL(qk ) (m, n)  VLL(Ikn ) (m, n)) 2 Where YLL(qk ) (m, n) , ULL(qk ) (m, n) and

Figure 2. Figure 2 wavelet decomposition for a image

Where LL is the original image, LL is the output of lowpass filter after the wavelet decomposition;
(0) (1)

VLL(qk ) (m, n) represents the low-frequency component of Y, U and V

LH (1) , HL(1) and HH (1) are the output of highpass filter

after the wavelet decomposition. To be noted that, the four sub-images with the same size represent the detail of the image in different direction, such as details in horizon, vertical or diagonal. The decomposition for the second or higher scale can be deduced in the same way. After the wavelet decomposition in each scale, the (k ) ( k 1) subimage LL is the most similar to LL in the vision effect while the scale is reduced to 1/4 of the reference. Thus, ( k 1) (k ) it is reasonable to replace LL with the subimage LL to carry on image retrieval and get results with enough accuracy in less time. Now let us carry on wavelet decomposition on a image with the size M u N , and the process can be described in a set of mathematical formulae as follows. k 1) (3) LL( k ) (m, n) [[ LL(rows * H ]2p1columns * H ]1p2 Here m 1,, M / 2k , n 1,, N / 2k .
k 1) LH ( k ) ( m, n) [[ LL(rows * H ]2p1columns * G ]1p2 k Here m M / 2  1, , M / 2 k 1 , n 1, , N / 2 k .

component for the query image after the k wavelet decomposition respectively; YLL(Ik ) (m, n) , ULL(Ik ) (m, n) and
n

th

VLL(Ikn ) (m, n) represents the low-frequency component of red,

green and blue component for the n

th

th

image to be retrieved

after k wavelet decomposition respectively, and S (Q, I n ) represents the similarity measure. From the formula (7), we can see that the designed similarity measure takes the YUV component information and wavelet decomposition operation into account. The S (Q, I n ) with smaller value indicates the greater degree of the similarity of two images. III. EXPERIMENTS AND ANALYSIS

(4)

To verify the proposed image retrieval method, we build a small image database with 1000 images in 10 kinds (including flower, birds, mountain, river, car, tree, grass, cloud, star, flog), in which each kind has 1000 images. All the image has the same resolution of 12080. The computer configuration is: Core Dual CPU, frequency 2.6GHz; RAM 8G; Discrete graphics with memory 2G.The software platform is a small self-designed

129

image retrieval image system developed with Visual C.net platform. It adopted the proposed image retrieval method as the retrieval strategy, packaged the main function and designed the user interface while reserving some for further extension of system functions. In the experiment, we choose an image as the query image, and carry on the proposed image retrieval algorithm in the self-build image database. The result for the query image of a rabbit in the system is shown as in figure 4.

to apply the proposed image retrieval method into the digital library. REFERENCES
[1] [1] Zhao Ye-ling,Zhou Yuan.Image Retrival Based on MultiFeatures Content in Digital Libraries[J].Jornal of Library and Information Science in Agriculture, 2009, 21(3): 130-132 [2] Yu chengming,Lin Haiyun,Zheng Liping.Research on contentbased image retrieval in digital libraries[J].Information Retrieval, 2011, 162(4): 90-92 [3] He Liming,Wan Yuehua.The Key technologies of Content-based image retrieval in digital libraries[J].The journal of the library science in China, 2002, 6: 39-43. [4] LiuRui, WangChong. Research on once feedback based on colorspace image retrieval technology[J]. Journal of Guilin University of Electronic Technology, 2011, 31(5): 373-376. [5] HeYongcong,Liu Wenbo,Zhang Gong,Cui Peng.Rotationinvariant texture image retrieval algorithm on non-subsampled contourlet transform[J].Journal of Image and Graphics, 2011, 16(1): 79-84 [6] Wang Hao.Research on Image Retrieval Method Based on Color and Spatial Feature[D]. Hebei University of Technology: Master degree thesis,2009. [7] Sun Junding,Wu Xiaosheng.Content-based Image Retrieval Based on Texture Spectrum Descriptors[J].Journal of Computer-aided Design and Computer Graphics, 2010, 22(3): 516-520 [8]Wang Weiping.Research Progress of Content-based Image Retrieval and its Application in Digital libraries[J].Information technology, 2009, 53(9): 116-120.

[2]

[3]

[4]

[5]

Figure 3. Figure 4 The UI and result for the image retrieval

[6]

Figure 4 has shown the user interface for the system and the result for this image retrieval. In the user interface, the blocks for displaying the query image is on the left while the block for displaying the result for the retrieval is on the right. There are 6 images similar to the query image on the right and the images are sorted by decreasing similarity from left to right and from up to down. According to the result, we obtain the retrieval result definitely similar to the query image after carry on the proposed method. 6 images are rabbits with similar color and structure to the query image. This indicates that the proposed method is of high accuracy and reliability. Table 1 gives the time for this retrieval.
Table 1. Retrieval time

[7]

[8]

Query image Image size Time rabbit 12080pixel 0.39second From Table 1, we can see that this image retrieval for the flower in 1000 images only costs 0.39 second. This is very fast. In short, the experiment above has demonstrated that the proposed method can complete the image retrieval with a high accuracy within less time. IV. CONCLUSIONS

To solve the bottleneck problem in image retrieval, we try to develop an accurate and fast retrieval method to meet with the development of the digital library. On one hand, to ensure the confidence of the image retrieval, we generated the YUV component information based on the original image. On the other hand, to reduce the execution time for the retrieval, we carry on the wavelet decomposition on the YUV components and fused the low-frequency components into the final similarity measure. The experimental result has demonstrated that the proposed method based on YUV component and wavelet decomposition has a high accuracy at a fast speed. Mover, we have built an image retrieval system on the platform Visual C++, which offers access for the application of the proposed method. The further work will discuss how

130