Feature Selection and Extraction for Content-Based Image Retrieval
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2012, Vol 3, Issue 2
Abstract
Content-Based Image Retrieval is a technique that utilizes the visual content of an image to search for similar images in large scale image databases. The visual content of an image represents the low-level features extracted from the image. These primarily constitute color, shape and texture features. The precision of image classification and image retrieval is mainly based on image feature extraction. More distinguished image features will yield better results in classification and retrieval process. Thus feature selection and feature extraction are the important tasks to be considered in image retrieval process. This paper aims to discuss about feature selection and an efficient method for feature extraction is proposed for image retrieval process.
Authors and Affiliations
E. Saravana Kumar #1 , A. Sumathi*2 , K. Latha #3
Keywords
Related Articles
- EP ID EP120116
- DOI -
- Views 125
- Downloads 0
TOLLGATE BILLING AND SECURITY OF VEHICLE USING RFID
This paper deals with an improved form of tollgate billing system. An efficient utilization of communication link between RF Modems over a wireless channel to facilitate vehicle monitoring, vehicle authentication a...
Asymptotic Behavior of Solutions for Forced Non Linear Delay Impulsive Differential Equations
We establish new sufficient conditions for asymptotic behavior of the solutions of non linear forced neutral delay differential equations with constant impulsive jumps. Our results improve and generalize some known resul...
On wgrα - Homeomorphisms in Topological Spaces
A bijection f: (X, τ) → (Y, σ) is called weakly generalized regular α- homeomorphism if f and f-1are wgrα-continuous. Also we introduce the new class of maps, namely wgrαc-homeomorphisms which form a subclass of wgrα-ho...
The Discrete Logarithm Problem in the ElGamal Cryptosystem over the Abelian Group U(n) Where n= pm,or 2pm
This study is mainly about the discrete logarithm problem in the ElGamal cryptosystem over the abelian group U(n) where n is one of the following forms pm, or 2pm where p is an odd large prime and m is a positive integer...
(gsp)*-Closed Sets In Topological Spaces
In this paper we have introduced a new class of sets called (gsp)*-closed sets which is properly placed in between the class of closed sets and gsp-closed sets. As an application, we introduce two news paces namely, Tgsp...