Fractals Based Clustering for CBIR
Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 6
Abstract
Fractal based CBIR is based on the self similarity fundamentals of fractals. Mathematical and natural fractals are the shapes whose roughness and fragmentation neither tend to vanish, nor fluctuate, but remain essentially unchanged as one zooms in continually and examination is refined. Since an image can be characterized by its fractal code, a fractal code can therefore be used as a signature of the image. Image clustering supports the hypothesis that semantically similar images tend to be clustered in some feature space. The meaningful clustering is in pursuit of search for nearest neighbor in terms of similarity of the images. The objective of this work is to evaluate the use of fractal dimension as a quantitative index and effectiveness of clustering approach for image retrieval mechanism. The image retrieval mechanism has been implemented using clustering and Hausdorff dimension based fractals so as to combine the advantages of both the approaches. The results are encouraging enough to investigate use of fractals for CBIR.
Authors and Affiliations
Suhas Rautmare , Anjali Bhalchandra
Keywords
Related Articles
- EP ID EP150858
- DOI -
- Views 130
- Downloads 0
CLOUD COMPUTING AND ITS PRICING SCHEMES
Cloud computing is a rapidly emerging technology which involves deployment of various services like software, web services and virtualized infrastructure, as a product on public, private or hybrid clouds on lease basis....
COCOMO model for software based on Open Source: Application to the adaptation of TRIADE to the university system
Today, within the software industry, Open Source Software has many qualities that need to be analyzed. This kind of software has gained a lot of attraction nowadays from researchers since it offers technical and economic...
Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
The basic operation in elliptic curve cryptosystem is scalar ultiplication. It is the computation of integer multiple of a given point on the curve. Computation of scalar multiple is faster by using igned binary repres...
MRI Brain Abnormalities Segmentation using K-Nearest Neighbors (k-NN)
Segmentation of medical imagery remains as a challenging task due to complexity of medical images. This study proposes a method of k-Nearest Neighbor (k-NN) in abnormalities segmentation of Magnetic Resonance Imaging (MR...
A Simple Algorithm for Detection and Removal of Wormhole Attacks for Secure Routing In Ad Hoc Wireless Networks
The infrastructure of a Mobile Ad hoc Network (MANET) has no routers for routing, and all nodes must share the same routing protocol to assist each other when transmitting messages. However, almost all common routing pro...