Importance of Image Enhancement Techniques in Color Image Segmentation: A Comprehensive and Comparative Study

Color image segmentation is a very emerging research topic in the area of color image analysis and pattern recognition. Many state-of-the-art algorithms have been developed for this purpose. But, often the segmentation results of these algorithms seem to be suffering from miss-classifications and over-segmentation. The reasons behind these are the degradation of image quality during the acquisition, transmission and color space conversion. So, here arises the need of an efficient image enhancement technique which can remove the redundant pixels or noises from the color image before proceeding for final segmentation. In this paper, an effort has been made to study and analyze different image enhancement techniques and thereby finding out the better one for color image segmentation. Also, this comparative study is done on two well-known color spaces HSV and LAB separately to find out which color space supports segmentation task more efficiently with respect to those enhancement techniques.

A Novel Approach Towards Clustering Based Image Segmentation

In computer vision, image segmentation is always selected as a major research topic by researchers. Due to its vital rule in image processing, there always arises the need of a better image segmentation method. Clustering is an unsupervised study with its application in almost every field of science and engineering. Many researchers used clustering in image segmentation process. But still there requires improvement of such approaches. In this paper, a novel approach for clustering based image segmentation is proposed. Here, we give importance on color space and choose lab for this task. The famous hard clustering algorithm K-means is used, but as its performance is dependent on choosing a proper distance measure, so, we go for cosine distance measure. Then the segmented image is filtered with sobel filter. The filtered image is analyzed with marker watershed algorithm to have the final segmented result of our original image. The MSE and PSNR values are evaluated to observe the performance.

Comparing the Performance of L*A*B* and HSV Color Spaces with Respect to Color Image Segmentation

Color image segmentation is a very emerging topic for image processing research. Since it has the ability to present the result in a way that is much more close to the human yes perceive, so todays more research is going on this area. Choosing a proper color space is a very important issue for color image segmentation process. Generally LAB and HSV are the two frequently chosen color spaces. In this paper a comparative analysis is performed between these two color spaces with respect to color image segmentation. For measuring their performance, we consider the parameters: mse and psnr . It is found that HSV color space is performing better than LAB.

Clustering Approach Towards Image Segmentation: An Analytical Study

Image processing is an important research area in computer vision. Image segmentation plays the vital rule in image processing research. There exist so many methods for image segmentation. Clustering is an unsupervised study. Clustering can also be used for image segmentation. In this paper, an in-depth study is done on different clustering techniques that can be used for image segmentation with their pros and cons. An experiment for color image segmentation based on clustering with K-Means algorithm is performed to observe the accuracy of clustering technique for the segmentation purpose.

Impact of Exponent Parameter Value for the Partition Matrix on the Performance of Fuzzy C Means Algorithm

Soft Clustering plays a very important rule on clustering real world data where a data item contributes to more than one cluster. Fuzzy logic based algorithms are always suitable for performing soft clustering tasks. Fuzzy C Means (FCM) algorithm is a very popular fuzzy logic based algorithm. In case of fuzzy logic based algorithm, the parameter like exponent for the partition matrix that we have to fix for the clustering task plays a very important rule on the performance of the algorithm. In this paper, an experimental analysis is done on FCM algorithm to observe the impact of this parameter on the performance of the algorithm.

A Comparative study Between Fuzzy Clustering Algorithm and Hard Clustering Algorithm

Data clustering is an important area of data mining. This is an unsupervised study where data of similar types are put into one cluster while data of another types are put into different cluster. Fuzzy C means is a very important clustering technique based on fuzzy logic. Also we have some hard clustering techniques available like K-means among the popular ones. In this paper a comparative study is done between Fuzzy clustering algorithm and hard clustering algorithm