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 119
- Downloads 0
A Novel Algorithm for Scaling up the Accuracy of Decision Trees
Classification is one of the most efficient and widely used data mining technique. In classification, Decision trees can handle high dimensional data, and their representation is intuitive and generally easy to assimilat...
A new approach for improvement of fractal image encoding
In this paper, we propose, in a first part, an approach to reduce the computational complexity of fractal image ncoding by using the Shannon entropy (APENT). A speedup factor of 8 is obtained while image quality is stil...
Deriving Association between Urban and Rural Students Programming Skills
Data mining is used to extract the interesting patterns from databases or repositories. Frequent Pattern Tree is a technique for discovering association between the variables and finds the frequent patterns in the Studen...
A Modified Leader Election Algorithm for MANET
Distributed systems are the backbone of modern day computing services. A mobile ad hoc network (MANET) is a collection of mobile nodes that can communicate via message passing over wireless links. Communication takes pla...
Performance Analysis of AODV-UI Routing Protocol With Energy Consumption Improvement Under Mobility Models in Hybrid Ad hoc Network
In mobile ad hoc networks (MANETs), routing protocol plays the most important role. In the last decade, Ad hoc On-demand Distance Vector (AODV) routing protocol becomes the attention of focussed research on MANETs world...