(IJCSIS) International Journal of Computer Science and Information Security,Vol. 10, No. 1, 201
order from minimum to maximum Out of these 1000 sorteddistances images with respect to create these components,
first100 distances in ascending order are selected as images retrievedas there are 100 images of each class in the database .
Number of relevant images in these 100 images gives us theprecision and recall cross over point (PRCP), which is theperformance evaluation parameter of the system.This paper is organized as follows: Section 2 will discussthe algorithmic view of the CBIR system based on 8, 27 and64 bins using histogram plots. Section 3 describes the Role of the similarity measures in the CBIR system. Section4.highlights the experimental results obtained along with theanalysis. Finally section 5 summarizes the work done alongwith their comparative study.II.
Feature Extraction and Formation of Feature Databases
Figure 1. Feature vector Database Formation
Bins Formation Process: 8 BinsStep1
. Spilt the image into R, G and B planes.
. Obtain the histogram for each plane.
. Divide each histogram into 2 parts and assign a uniqueflag to each part.
To extract the color feature of the image, pick up theoriginal image pixel and check its R, G and B values find outin the histogram that in which range these values exactly falls,based on it assign the unique flags to the r, g and b values of that pixel with respect to the partition of the histogram itbelongs.
Count of pixels in the bin: Based on the flags assignedto each pixel with respect to the R, G B values and 2 partitions(e. g. 0 and 1) of the histogram we can have 8 combinationsfrom 000 to 111 which are the total 8 bins”.
Formation of Extended Bins 27 and Bins 64
Formation of 27 and 64 bins feature vector database isextended version of the 8 bins feature extraction process. Herefor 27 bins only difference is in step3 of the above algorithm,here to get 27 and 64 bins we are partitioning the histogramsinto 3 and 4 parts respectively which are named as 0, 1, 2 for27 bins and 0, 1, 2, 3 for 64 bins approach. As explained instep 4 to 5 here also same process is applied and 3 bit flags areassigned to each pixel of the image for which the featurevector is being extracted. For 3 partitions the 3 flag bits (eitherof 0, 1 and 2) can have 27 combinations and for 4 partitionsthe 3 flag bits (either of 0, 1, 2 and 3) can have 64combinations, these are the addresses of the 27 and 64 binsrespectively. Based on this process two feature databases of feature vector size 27 and 64 holding the count of no of pixelsaccording to the r, g, and b intensity values are obtained asBins27_database and Bins64_database respectively.
Variations to Obtain Multiple Feature Databases
As shown in Figure.1 Three different databases for 8, 27 and64 bins can further have 2 different sets of feature vectorsnamed “Count of no of pixels”, “Average of R, G and Bvalues for all pixels in a Bin” which are simply obtained bymodifying the process of extracting the feature vectors ;instead of just taking the count of pixels we have consideredthe significance of actual intensity levels of each pixel in eachof the 8, 27 or 64 bins and taken the average values of them.III.
PPLICATION OF SIMILARITY MEASURE
Many similarity measures used in different CBIR systems arestudied , , , , . We have used Euclideandistance given in equation (1) and absolute distance inequation (2) as similarity measures in our work to produce theretrieval results. Once the query image is accepted by thesystem it will calculate the Euclidean distance as well asAbsolute distance between the query image feature vector anddatabase image feature vectors. In our system database size is1000 images, so we obtained two sets of results one based oneach similarity measure. When query image will be comparedwith 1000 database images which generate 1000 Euclideandistances and 1000 Absolute distances. These are then sortedin ascending order to select the images having minimumdistance for the final retrieval.
Euclidean Distance :
FI FQ D
Absolute Distance :
I n I QI
FI FQ D
(2)Bins Formation8 Bins27 64Count of:Number of PixelsAverage of R, Gand B values for theno of pixels