Comparison of Color Features for Image Retrieval
Journal Title: Indian Journal of Computer Science and Engineering - Year 2010, Vol 1, Issue 3
Abstract
Content based image retrieval (CBIR) systems are used for automatic indexing, searching, retrieving and browsing of image databases. Color is one of the important features used in CBIR systems. An experimental comparison of a number of different color descriptors for content-based image retrieval is presented in this paper. Color histograms, color moments and color coherent vector (CCV) are considered for retrieval. The primary goal is to determine which color descriptor or combination of color descriptors is most efficient in representing the similarity of color images. In this paper, we first present the comparison of individual color descriptors and then the comparison of combined color descriptors. For the experiments, five different publicly available image databases are used and the retrieval performance of the features is analyzed in detail. This allows for a direct comparison of all features considered in this work and furthermore it will allow a comparison of newly proposed features to these in the future. The article is concluded by stating which features perform well for what type of data.
Authors and Affiliations
S. R. Kodituwakku , S. Selvarajah
A NOVEL APPROACH FOR SELECTION OF BEST SET OF OPTIMIZATION FUNCTIONS FOR A BENCHMARK APPLICATION USING AN EFFECTIVE STRATEGY
Finding right set of optimization techniques for a given application involves lot of complications. The compiler optimization technique for a given platform depends upon the various factors such as hardware settings and...
APPLICATION OF ADAPTIVE NEURO-FUZZY INFERENCE SYSTEM IN INTEREST RATES EFFECTS ON STOCK RETURNS
In the current study we examine the effects of interest rate changes on common stock returns of Greek banking sector. We examine the Generalized Autoregressive eteroskedasticity (GARCH) process and an Adaptive Neuro-Fuz...
SUPER STRONGLY PERFECT NESS OF SOME INTERCONNECTION NETWORKS
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper we have analyzed the structure of super st...
ENRICHMENT OF SECURITY THROUGH CRYPTOGRAPHIC PUBLIC KEY ALGORITHM BASED ON BLOCK CIPHER
In recent years Data Security using cryptography has emerged as a topic of significant interest in both academic and industry circles. This paper deals with a new algorithm, which is based on linear block cipher. Our goa...
Concert Investigation of Novel Deterministic Interleaver for OFDM-IDMA System
In recent days the expectations of wireless communication systems have to configure new technologies that support high capacity to match the increase in demands on wireless service. A new hybrid scheme namely Orthogonal...