Image Retrieval based on combined features of image sub-blocks
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 4
Abstract
In this paper we propose a new and efficient technique to retrieve images based on sum of the values of Local Histogram and GLCM (Gray Level Co-occurrence Matrix) texture of image sub-blocks to enhance the retrieval performance. The image is divided into sub blocks of equal size. Then the color and texture features of each sub-block are computed. Most of the image retrieval techniques used Histograms for indexing. Histograms describe global intensity distribution. They are very easy to compute and are insensitive to small changes in object translations and rotations. Our main focus is on separation of the image bins (histogram value divisions by frequency) followed by calculating the sum of values, and using them as image local features. At first, the histogram is calculated for an image sub-block. After that, it is subdivided into 16 equal bins and the sum of local values is calculated and stored. Similarly the texture features are extracted based on GLCM. The four statistic features of GLCM i.e. entropy, energy, inverse difference and contrast are used as texture features. These four features are computed in four directions (00, 450, 900, and 1350). A total of 16 texture values are computed per an image sub-block. An integrated matching scheme based on Most Similar Highest Priority (MSHP) principle is used to compare the query and target image. The adjacency matrix of a bipartite graph is formed using the sub-blocks of query and target image. This matrix is used for matching the images. Sum of the differences between each bin of the query and target image histogram is used as a distance measure for Local Histogram and Euclidean distance is adopted for texture features. Weighted combined distance is used in retrieving the images. The experimental results show that the proposed method has achieved highest retrieval performance.
Authors and Affiliations
Ch. Kavitha , Dr. B. Prabhakara Rao , Dr. A. Govardhan
Keywords
Related Articles
- EP ID EP113607
- DOI -
- Views 119
- Downloads 0
Enhanced Bee Colony Algorithm for Complex Optimization Problems
Optimization problems are considered to be one kind of NP hard problems. Usually heuristic approaches are found to provide solutions for NP hard problems. There are a plenty of heuristic algorithms available to solve opt...
A NOVEL APPROACH FOR PATTERN ANALYSIS FROM HUGE DATAWAREHOUSE
Due to the tremendous growth of data and large databases, efficient extraction of required data has become a challenging task. This paper propose a novel approach for knowledge discovery from huge unlabeled temporal data...
An Implementation in AODV based on Active Route Timeout between sensor nodes in Wireless Sensor Networks
Wireless Sensor Network is a technological development of small, low cost, low power devices that combine data processing with multiple sensing and the ability to communicate wirelessly. Routing in sensor network is a po...
Realisation of Resourceful Data Mining Services Using Cloud Computing
Data security and access control are the most challenging research work going on, at present, in cloud computing. This is because of the users sending their sensitive data to the cloud providers for acquiring their servi...
An Invisible Zero Watermarking Algorithm using Combined Image and Text for Protecting Text Documents
Authentication and copyright protection for digital contents over the Internet can be achieved through digital watermarking. The major components of the Internet are textual contents. Hence protection of plain text docum...