%0 Journal Article %1 IJACSA.2012.030505 %A H B kekre, Kavita Sonawane %D 2012 %J International Journal of Advanced Computer Science and Applications(IJACSA) %K Absolute Bins CG Correlation Cosine Distance, Euclidean Histogram, LSRR, Longest Modified PRCP,Polynomial String., Transform based formation, partitioning, %N 5 %T Bins Formation using CG based Partitioning of Histogram Modified Using Proposed Polynomial Transform ‘Y=2X-X2’for CBIR %U http://ijacsa.thesai.org/ %V 3 %X This paper proposes a novel polynomial transform to modify the original histogram of the image to adjust the pixel density equally towards the high intensity levels so that uniform distribution of the pixels can be obtained and the image can be enhanced. We have shown the efficient use of this modified histogram for Content Based Image Retrieval. According to the CBIR system described in this paper each image is separated into R, G and B plane and for each plane a modified histogram is calculated. This modified histogram is partitioned into two parts by calculating the Center of gravity and using it 8 bins are formed on the basis of R, G and B values. These 8 bins are holding the count of pixels falling into particular range of intensity levels separated into two parts of the histogram. This count of pixels in 8 bins is used as feature vector of dimension 8 for comparison to facilitate the image retrieval process. Further these bins data is used to form the new variations of feature vectors ; Total (sum) and Mean of pixel intensities of all the pixels counted in each of the 8 bins. These feature vector variation has also produced good image retrieval. This paper compares the proposed system designed using the CG based partitioning of the original and histogram modified using the polynomial transform for formation of the 8 bins which are holding the Count of pixels and Total and Mean of intensities of these pixels. This CBIR system is tested using 200 query images from 20 different classes over database of 2000 BMP images. Query and database image feature vectors are compared using three similarity measures namely Euclidean distance, Cosine Correlation distance and Absolute distance. Performance of the system is evaluated using three parameters PRCP (Precision Recall Cross-over Point), LSRR (Length of String to Retrieve all Relevant images) and Longest String

@article{IJACSA.2012.030505, abstract = {This paper proposes a novel polynomial transform to modify the original histogram of the image to adjust the pixel density equally towards the high intensity levels so that uniform distribution of the pixels can be obtained and the image can be enhanced. We have shown the efficient use of this modified histogram for Content Based Image Retrieval. According to the CBIR system described in this paper each image is separated into R, G and B plane and for each plane a modified histogram is calculated. This modified histogram is partitioned into two parts by calculating the Center of gravity and using it 8 bins are formed on the basis of R, G and B values. These 8 bins are holding the count of pixels falling into particular range of intensity levels separated into two parts of the histogram. This count of pixels in 8 bins is used as feature vector of dimension 8 for comparison to facilitate the image retrieval process. Further these bins data is used to form the new variations of feature vectors ; Total (sum) and Mean of pixel intensities of all the pixels counted in each of the 8 bins. These feature vector variation has also produced good image retrieval. This paper compares the proposed system designed using the CG based partitioning of the original and histogram modified using the polynomial transform for formation of the 8 bins which are holding the Count of pixels and Total and Mean of intensities of these pixels. This CBIR system is tested using 200 query images from 20 different classes over database of 2000 BMP images. Query and database image feature vectors are compared using three similarity measures namely Euclidean distance, Cosine Correlation distance and Absolute distance. Performance of the system is evaluated using three parameters PRCP (Precision Recall Cross-over Point), LSRR (Length of String to Retrieve all Relevant images) and Longest String}, added-at = {2014-02-21T08:00:08.000+0100}, author = {{H B kekre}, Kavita Sonawane}, biburl = {https://www.bibsonomy.org/bibtex/2c08d9e949801a1c4f661f665603b9795/thesaiorg}, interhash = {8b62e6e01652c097eb37d4ed036fd623}, intrahash = {c08d9e949801a1c4f661f665603b9795}, journal = {International Journal of Advanced Computer Science and Applications(IJACSA)}, keywords = {Absolute Bins CG Correlation Cosine Distance, Euclidean Histogram, LSRR, Longest Modified PRCP,Polynomial String., Transform based formation, partitioning,}, number = 5, timestamp = {2014-02-21T08:00:08.000+0100}, title = {{Bins Formation using CG based Partitioning of Histogram Modified Using Proposed Polynomial Transform ‘Y=2X-X2’for CBIR}}, url = {http://ijacsa.thesai.org/}, volume = 3, year = 2012 }