Abstract:
An image retrieval system and method using an image histogram for determining central points and dispersion values as well as quantity information of color about respective histogram bins, thereby using these as mapping information for image retrieval. The image retrieval method using an image histogram includes the following steps. A first step of computing an image histogram bin when an image is inputted, and accumulating values of x, y, x 2 , y 2  to compute central points and dispersion values. A second step of normalizing the respective central points and dispersion values through dividing these by size of whole image, and storing these. A third step of generating a value of model to be retrieved by drawing a feature vector when a query image is inputted, and computing the difference between the generated value of model and central points and dispersion values of an image histogram, count, and number of corresponding bins within the data stored in the second step. A fourth step of specifying a similarity value of an image using the values computed in the third step.

Description:
TECHNICAL FIELD 
     The present invention relates to an image retrieval system and method using an image histogram, and, in particular, to an image retrieval system and method of using an image histogram, for determining central points and dispersion values as well as quantity information of color about respective histogram bins, thereby using these as mapping information for image retrieval. 
     BACKGROUND OF THE INVENTION 
     An image database can be classified into three groups according to retrieval methods, i.e., text-based, content-based, and semantic-based database, and features used in the retrieval of content-based database are shape, texture, and color. In this case, color has easier to draw characteristics and more applicable to a user&#39;s query-by-example than shape and texture. 
     Conventional color indexing systems usually utilize only a bin which is a specific value of a color histogram. Here, the method of measuring similarity using the difference between two color histograms often results in the difference from the measurement result of the perceptual similarity of an actual person. 
     This is because color feature values of the histogram, i.e., values of each bin show global feature information, and it is difficult to retrieve an image having correctly requested contents with only the global feature information. That is, a global feature is advantageous for not being affected by rotation of the image or a slight change of position, but has a drawback of not containing any spatial information. Because of such characteristics of a global feature that does not contain spatial information, when retrieving with only color information, a false positive error in the retrieval result can occur. 
     Since it is very difficult to draw spatial information from an image, conventional methods, which usually divide an image into sub-regions, and obtain global features for the respective sub-regions, have been proposed. Such a method is referred to the color layout. The simplest color layout indexing method divides an image into blocks of the same size and draws color features from the respective blocks, but this method is not suitable for an image having great color variance. Another method performs a segmentation of an image and obtains features of each segment. 
     It is difficult to implement a full automation system since it is difficult to divide objects of an image. In the real system, a dividing work that users semi-automatically or manually determine objects is used. On the other hand, in recent years, as a new color layout indexing method, methods using the wavelet transform are proposed. 
     As mentioned above, conventional methods perform retrieval by obtaining global color information and dividing a region in a color histogram and drawing spatial information from the respective sub-regions, and then synthesizing said two results. Such method is not effective because of a problem of synthesizing said two results since there are no relationships between two obtained information, and because it is necessary to draw two different features twice. 
     SUMMARY OF THE INVENTION 
     The disclosed embodiments of the present invention provide an image retrieval system and method using an image histogram for finding central points and dispersion values as well as quantity information of color about respective histogram bins, thereby using these as mapping information for image retrieval. 
     In order to achieve the foregoing, the embodiments of the present invention provide an index information generator of an image retrieval system using an image histogram, wherein said index information generator comprises operation means for computing histogram image bins when an image is inputted, and accumulating x, y, x 2 , and y 2 , to compute central points and dispersion values; and the first normalization means for dividing the respective computed central points and dispersion values by the size of the whole image. 
     In addition, the embodiments of the present invention provide a query image retriever of an image retrieval system using an image histogram, wherein said query image retriever comprises generation means for drawing feature vectors to generate values of a model to be retrieved, operation means for computing a difference between said generated values of the model and the number, count, central point, and dispersion values of corresponding stored histogram bins, and means of specifying similarity for specifying the similarity value of an image by using said computed values. 
     Furthermore, the disclosed embodiments provide a method for image retrieval using an image histogram that includes the following steps. A first step is when an image is inputted, computing histogram image bins and computing central points and dispersion values by accumulating x, y, x 2 , and y 2 . A second step is normalizing through dividing respective central points and dispersion values computed in the first step by the size of whole image, and storing it. A third step is when a query image is inputted, drawing feature vectors and generating values of model to be retrieved, and then computing differences between said generated values of model and the number, count, and central points and dispersion values of the corresponding bins of the image histogram. A fourth step is specifying the similarity value of image using the values computed in the third step. 
     Also, the disclosed embodiments provide a storage medium containing a program that executes steps, including the following steps. A first step is when an image is inputted, converting the image into color coordinate system, and normalizing it to reduce the feature of the converted values. A second step is computing histogram color bins from the normalized values in the first step, and accumulating x, y, x 2 , and y 2 , thereby computing central points and dispersion values. A third step is normalizing the respective computed central points and dispersion values by dividing with the size of whole image, and storing it. A fourth step is when a query image is inputted, generating a value of model to be retrieved by drawing a feature vector, and then computing the difference between the generated value of model and the number, count of color values, and central points and dispersion values of bins corresponding to the stored data in the third step. And a fifth step is specifying the similarity values of an image using the computed values in the fourth step. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     The embodiments of the present invention will be explained with reference to the accompanying drawings, in which: 
     FIG. 1 is a diagram of an image retrieval system using an image histogram, which is applied to the present invention. 
     FIG. 2 is a flow chart showing operation principles of an index information generator according to an embodiment of the present invention. 
     FIG. 3 is a flow chart showing operation principles of a query image retriever according to an embodiment of the present invention. 
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
     FIG. 1 is a diagram of an image retrieval system using an image histogram, which is applied to the present invention. When an image to be retrieved is inputted to the first index information generator  110 , the first index information generator  110  draws index information and transfers it to the query image retriever  130 . 
     The query image retriever  130  retrieves a requested image by way of mapping of similarity of the index(meta) information from a previously constructed image database and the index information of the query image and outputs the requested image. 
     On the other hand, the second index information generator, in which an image data for constructing an image database has been inputted, draws index information, and constructs an image database in the form of meta information and an original image, with the image data. 
     In the present invention, the index information generator and the query image retriever for retrieving a large amount of image information that exists within the image database shown in FIG. 1, is developed. 
     FIG. 2 is a flow chart showing operation principles of the index information generator in FIG. 1, as scanning an entire image, color values to respective coordinates are accumulated in the corresponding bins, and thereby features are measured. 
     First, when an image is inputted in step S 201 , in step S 202 , the image is converted into a color coordinate system of YIO, YUV, HSV, etc. since a histogram having three axes of RGB requires substantial data, and then color space normalization is performed in step S 203 . Here, a method for normalization is converting an image into a two-dimensional histogram except brightness such as IQ or UV, and the other method is to use a scaling vector. That is, the latter method is only to divide color information obtained from RGB by a scale factor(SCALE_RGB) of 2 to reduce the 256 steps of the color information into the 128 steps. 
     This process reduces the number of features in the color space, and it results in grouping of very small color information to convert into the representative color. Using this representative color shows advantages of reducing the amount of features to be used in the similarity index and not being affected by noise, however it may lower the whole color resolution, thus make a close handling of a complicated image to be difficult. On the other hand, in the case of a gray histogram, the procedure proceeds to step S 204  without processing steps S 202  and S 203 . 
     Next, the histogram bins are computed in step S 204 , the central points of the histogram bins are computed in step S 205 , and the dispersions of the histogram bins are computed in step S 206 . 
     When examining the above procedures in detail, the value of the accumulation of the color bins, the accumulation of the gray bins, and the accumulation of x, y, x 2 , and y 2  should be determined in order to determine the central points of the histogram bins. In this case, I, Q histograms are not generated as much as a whole color resolution, but these are generated only when the color has occurred more than once, so the unnecessary memory usage can be reduced, and the processing speed in the mapping of the similarity can be increased. 
     When said accumulation values are determined, the central points of the histogram bins are determined by the Equation 1, and the dispersions are determined by the Equation 2 below.                                   (       m   x     ,     m   y       )     ,       m   x     =                  1   n            ∑     i   =   1     n                     x   i                         m   y     =                  1   n            ∑     i   =   1     n                     y   i                         Equation                 1                 (       δ   x   2     ,     δ   y   2       )     ,                        δ   λ   2     =                    1   n            ∑     i   =   1     n                     x   i   2         -     m   x   2                     δ   y   2     =                    1   n            ∑     i   =   1     n                     y   i   2         -     m   y   2                       Equation                 2                                
     Then, in step S 207 , the image size normalization is performed through dividing the accumulation values, the central points, and dispersion values by entire image size. 
     The values determined by the above procedures are stored as meta information in the image database shown in FIG.  1 . 
     FIG. 3 is a flow chart describing the operation principles of the query image retriever in FIG.  1 . The detailed description is as follows; 
     At first, when a query image is inputted in step S 301 , in step S 302 , feature vectors of a color histogram(central point, dispersion value, etc.) are drawn to generate values of models to be retrieved, and then the similarity measurement is performed by comparing the feature values stored in the meta database in FIG.  2  and the feature values of models by steps S 303  to S 306 , similar images are sequentially outputted, and the processing is ended. 
     Here, the detailed description of processing the measurement of similarity is as follows; 
     The value of the similarity measurement is computed by Equation 3 with 6 feature values and 6 weighted values like below. 
       S=W   1   S   clolr   +W   2   S   xm   +W   3   S   ym   +W   4   S   xd   +W   5   S   yd   +W   6   S   count   +W   7   S   gray   Equation 3 
     Here, S color , S sm , S ym , S xd , S yd , S count , and S gray  are feature vectors of a color histogram determined by Equation 4 below, and W 1 , W 2 , W 3 , W 4 , W 5 , W 6 , and W 7  are predetermined weighted values. 
     Also, the S color  is a feature vector to a color histogram bin, S xm  is a feature vector to a mean value on x-axis, S ym  is a feature vector to a mean value on y-axis, S xd  is a feature vector to a dispersion value on x-axis, S yd  is a feature vector to a dispersion value on y-axis, S count  is a feature vector of count, and S gray  is a feature value of a gray value.                      S   color     =                  ∑     k   =   1     input_bin                       ∑     l   =   1       model                 _                 bin                         f   color                     (     k   ,   l     )                           f   color                     (     k   ,   l     )       =                {                        if                   (             H   Input          i   k              H   Model                     i   l                   and                   H       
        Input                       q   k              H   Model          q   l             )          :                     abs        (             H   Input          (     i   ,   q     )       k     ·   count     -           H   Model          (     i   ,   q     )       l     ·   count       )                     otherwise                   :                   0                                      S   xm     =                  ∑     k   =   1     input_bin                       ∑     l   =   1       mode      l_bin                         f   xmean          (     k   ,   l     )                           f   xmean          (     k   ,   l     )       =                {                        if                   (             H   Input                     i   k              H   Model                     i   l                   and                   H       
        Input                       q   k              H   Model                     q   l             )          :                     abs        (         H   Input                         (     i   ,   q     )     k     ·   xm       -       H   Model                         (     i   ,   q     )     l     ·   xm         )                       otherwise        :                   0                                                   S   ym     =                  ∑     k   =   1     input_bin                       ∑     l   =   1       model      _bin                         f   ymean          (     k   ,   l     )                           f   ymean          (     k   ,   l     )       =                {                        if                   (             H   Input                     i   k              H   Model          i   l                   and                   H       
        Input            q   k              H   Model          q   l             )          :                     abs        (             H   Input          (     i   ,   q     )       k     ·   ym     -           H   Model          (     i   ,   q     )       l     ·   ym       )                     otherwise        :                   0                           S   xd     =                  ∑     k   =   1     input_bin                       ∑     l   =   1       model      _bin                         f   xdeviation          (     k   ,   l     )                           f   xdeviationr          (     k   ,   l     )       =                {                        if                   (             H   Input                     i   k              H   Model          i   l                   and                   H       
        Input            q   k              H   Model          q   l             )          :                     abs        (             H   Input          (     i   ,   q     )       k     ·   xd     -           H   Model          (     i   ,   q     )       l     ·   xd       )                     otherwise        :                   0                           S   yd     =                  ∑     k   =   1     input_bin                       ∑     l   =   1       model      _bin                         f   ydeviation          (     k   ,   l     )                           f   ydeviationr          (     k   ,   l     )       =                {                        if                   (             H   Input                     i   k              H   Model          i   l                   and                   H       
        Input            q   k              H   Model          q   l             )          :                     abs        (             H   Input          (     i   ,   q     )       k     ·   xd     -             H   Model          (     i   ,   q     )       l     ·   y                   d       )                     otherwise        :                   0                           S   count     =                  ∑     k   =   1     input_bin                       ∑     l   =   1       model      _bin                         f   count          (     k   ,   l     )                           f   count          (     k   ,   l     )       =                {                        if                   (             H   Input                     i   k              H   Model          i   l                   and                   H       
        Input            q   k              H   Model          q     l                  )          :                   1                 otherwise        :                   0                           S   gray     =                  ∑     k   =   1     256                       f   gray          (   l   )                         f   gray          (   l   )       =                abs   (         H   Input          l   ·   graycount       -       H   Model          l   ·   graycount         )                   Equation  4                                
     Here, H input i k  is a value of kth feature vector having I color value in a color histogram inputted from meta information within image database, H input q k  is a value of kth feature vector having Q color value, H input (i,q) k .count is a value of accumulation count of kth feature of two-dimensional histogram having I and Q color value, H input (i,q) k .xm is a value of kth feature vector having a mean value of x-axis of two-dimensional histogram having I and Q color value, H input   l.graycount  is a magnitude of a bin of Ith gray value of a model histogram. Also, ym is a feature vector having a mean value of y-axis, xd is a feature vector having a dispersion value of x-axis, yd is a feature vector having the dispersion value of y-axis, H Model i k  is the same as mentioned above except that the processing image is a model image and the first one. Finally, input_bin means a magnitude of the color histogram(the number of the whole bins) inputted from input meta database, model_bin means the size of the input image in the color histogram. 
     Here, the weighted value is determined in what feature is the most suitable for retrieval of image when mapping of similarity. Also, the respective feature values are processed by normalization so that the whole values have a value between 0.0 and 1.0. 
     As a result, when a value of similarity measurement is determined, retrieval is performed in the order of size within the entire meta database, so that the retrieved image is outputted to a user. 
     Although the present invention is illustrated and shown in connection with an image retrieval method using a color histogram, also in the case of a gray histogram, the image retrieval method using the mean value and the dispersion value, which are proposed in the present invention, can be applied. 
     The embodiments of the present invention set forth herein can be stored in a computer-readable storage medium, and processed by computer. 
     As described above, the disclosed embodiments of the present invention generate a better retrieval result by solving the problem of conventional retrieval methods that a separate algorithm of drawing spatial information must be used since those did not use spatial information. 
     Also, the present invention does not need additional processing time since position information and dispersion information can be generated at the same time when generating a histogram, and the present invention shows more efficient result by connecting color information, and position information and dispersion information. 
     Furthermore, the image histogram information proposed in the present invention can be used not only for image retrieval, but also as seed information in the image segmentation of the method for synthesizing regions. 
     Although representative embodiments of the present invention have been disclosed for illustrative purposes, those who are skilled in the art will appreciate that various modifications, additions and substitutions are possible without departing from the scope and spirit of the present invention as defined in the accompanying claims and the equivalents thereof.