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 105
- Downloads 0
PERFORMANCE CONTRIBUTION BASED SCHEDULING FRAMEWORK FOR PRECEDENCE CONSTRAINT TASKS IN REAL TIME SYSTEM
It is quite possible that in a process set, process may be having earliest deadline but its performance contribution is low in process set. Scheduling such processes with highest priority does not carry any meaning. Majo...
Improving Throughput in Cloud Storage System
Because the cloud serves many workloads concurrently, its disk access pattern is highly random and heterogeneous. In addition, because various virtual machines access to files respectively, meta data utilization and smal...
Convergence of ART in Few Projections
Algebraic Reconstruction Technique (ART) is an iterative algorithm to obtain reconstruction from projections in a finite number of iterations. The present paper discuses the convergence achieved in small number of iterat...
Dynamic Resource Allocation in Desktop Grids
Grid computing (or the use of computational grids) is the application of several computers to a single problem at the same time. In grid computing ,the computing becomes pervasive and individual users(or client applicati...
Dynamic Broadcast Scheduling in DDBMS
This system will address the problem of online scheduling sequential data objects with the principle of periodicity in the context of dynamic information dissemination. Many modern information applications spread dynamic...