A Comparative Study of Color Image Segmentation Using Hard, Fuzzy,Rough Set Based Clustering Techniques
Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2013, Vol 11, Issue 8
Abstract
Image segmentation is the process of subdividing an image into its constituent parts and extracting these parts of interest, which are the objects. Colour image segmentation emerges as a new area of research. It can solve many contemporary problems in medical imaging, mining and mineral imaging, bioinformatics, and material sciences. Naturally, color image segmentation demands well defined borders of different objects in an image. So, there is a fundamental demand of accuracy. The segmented regions or components should not be further away from the true object than one or a few pixels. So, there is a need for improved image segmentation technique that can segment different components precisely. Image data may have corrupted values due to the usual limitations or artifacts of imaging devices. Noisy data, data sparsity, and high dimensionality of data create difficulties in image pixel clustering. As a result, image pixel clustering becomes a harder problem than other form of data. Taking into account all the above considerations we propose an unsupervised image segmentation method using Rough-Fuzzy C-Mean a hybrid model for segmenting RGB image by reducing cluster centers using rough sets and Fuzzy C-Means Method, and also compare the effectiveness of the clustering methods such as Hard C Means (HCM), Fuzzy C Means (FCM), Fuzzy K Means (FKM), Rough C Means (RCM) with cluster validity index such as DB Index, XB Index and Dunn Index. A good clustering procedure should make the value of DB index as low as possible, for Dunn Index high value, and for XB Index low value.
Authors and Affiliations
Venkateswara Reddy Eluri, Dr. E. S. Reddy
Keywords
Related Articles
- EP ID EP650345
- DOI 10.24297/ijct.v11i8.3005
- Views 77
- Downloads 0
Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem
The Capacitated Vehicle Routing Problem is the most common and basic variant of the vehicle routing problem, where it represents an important problem in the fields of transportation, distribution and logistics. It involv...
WEB MINING THROUGH CUSTOMIZED MARKOV ALGORITHM
The problem of predicting a user’s behavior on a web site has gained Importance due to the very increases required web network. It also compulsory for market and research of social behavior. Although many approaches ar...
Security Frameworks: A Study on Different Approaches for the Internet of Things
This paper provides an overview of some of the major works that focus on the use of security frameworks for Internet of Things environment to facilitate the development of applications for this scenario. The Internet of...
Information Management
Information management (IM) is the collection and management of information from one or more sources and the distribution of that information to one or more audiences. Management means the organization of and control ove...
Fault Tolerant Heterogeneous Limited Duplication Scheduling algorithm for Decentralized Grid
Fault tolerance is one of the most desirable property in decentralized grid computing systems, where computational resources are geographically distributed. These resources collaborate in order to execute workflow applic...