scholarly journals Color Image Segmentation Using Fuzzy C-Regression Model

2017 ◽  
Vol 2017 ◽  
pp. 1-15 ◽  
Author(s):  
Min Chen ◽  
Simone A. Ludwig
Keyword(s):  
Image Segmentation ◽  
Regression Model ◽  
Fuzzy Clustering ◽  
Spatial Information ◽  
Color Image ◽  
Clustering Algorithms ◽  
Ground Truth ◽  
Color Image Segmentation ◽  
Learning Techniques ◽  
Hard Clustering

Image segmentation is one important process in image analysis and computer vision and is a valuable tool that can be applied in fields of image processing, health care, remote sensing, and traffic image detection. Given the lack of prior knowledge of the ground truth, unsupervised learning techniques like clustering have been largely adopted. Fuzzy clustering has been widely studied and successfully applied in image segmentation. In situations such as limited spatial resolution, poor contrast, overlapping intensities, and noise and intensity inhomogeneities, fuzzy clustering can retain much more information than the hard clustering technique. Most fuzzy clustering algorithms have originated from fuzzy c-means (FCM) and have been successfully applied in image segmentation. However, the cluster prototype of the FCM method is hyperspherical or hyperellipsoidal. FCM may not provide the accurate partition in situations where data consists of arbitrary shapes. Therefore, a Fuzzy C-Regression Model (FCRM) using spatial information has been proposed whose prototype is hyperplaned and can be either linear or nonlinear allowing for better cluster partitioning. Thus, this paper implements FCRM and applies the algorithm to color segmentation using Berkeley’s segmentation database. The results show that FCRM obtains more accurate results compared to other fuzzy clustering algorithms.

Color Image Segmentation

2012 ◽  
Vol 3 (3) ◽  
pp. 66-82
Author(s):  
Song Gao ◽  
Chengcui Zhang ◽  
Wei-Bang Chen
Keyword(s):  
Image Segmentation ◽  
Spatial Information ◽  
Color Image ◽  
Clustering Algorithms ◽  
Color Space ◽  
Feature Space ◽  
Color Image Segmentation ◽  
Hill Climbing ◽  
Region Detection ◽  
Projective Clustering

An intuitive way of color image segmentation is through clustering in which each pixel in an image is treated as a data point in the feature space. A feature space is effective if it can provide high distinguishability among objects in images. Typically, in the preprocessing phase, various modalities or feature spaces are considered, such as color, texture, intensity, and spatial information. Feature selection or reduction can also be understood as transforming the original feature space into a more distinguishable space (or subspaces) for distinguishing different content in an image. Most clustering-based image segmentation algorithms work in the full feature space while considering the tradeoff between efficiency and effectiveness. The authors’ observation indicates that often time objects in images can be simply detected by applying clustering algorithms in subspaces. In this paper, they propose an image segmentation framework, named Hill-Climbing based Projective Clustering (HCPC), which utilizes EPCH (an efficient projective clustering technique by histogram construction) as the core framework and Hill-Climbing K-means (HC) for dense region detection, and thereby being able to distinguish image contents within subspaces of a given feature space. Moreover, a new feature space, named HSVrVgVb, is also explored which is derived from Hue, Saturation, and Value (HSV) color space. The scalability of the proposed algorithm is linear to the dimensionality of the feature space, and our segmentation results outperform that of HC and other projective clustering-based algorithms.

scholarly journals Robust Deep Kernel-Based Fuzzy Clustering With Spatial Information for Image Segmentation

2021 ◽  
Author(s):  
Lujia Lei ◽  
Chengmao Wu ◽  
Xiaoping Tian
Keyword(s):  
Image Segmentation ◽  
Kernel Function ◽  
Loss Function ◽  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Spatial Information ◽  
Clustering Algorithms ◽  
Noise Robustness ◽  
Neighborhood Information ◽  
Classical Image

Abstract Clustering algorithms with deep neural network have attracted wide attention of scholars. A deep fuzzy K-means clustering algorithm model with adaptive loss function and entropy regularization (DFKM) is proposed by combining automatic encoder and clustering algorithm. Although it introduces adaptive loss function and entropy regularization to improve the robustness of the model, its segmentation effect is not ideal for high noise; At the same time, its model does not use a convolutional auto-encoder, which is not suitable for high-dimensional images.Therefore, on the basis of DFKM, this paper focus on image segmentation, combine neighborhood median and mean information of current pixel, introduce neighborhood information of membership degree, and extend Euclidean distance to kernel space by using kernel function, propose a dual-neighborhood information constrained deep fuzzy clustering based on kernel function (KDFKMS). A large number of experimental results show that compared with DFKM and classical image segmentation algorithms, this algorithm has stronger anti-noise robustness.

Improving the Efficiency of Color Image Segmentation Using an Enhanced Clustering Methodology

Biometrics ◽  
2017 ◽  
pp. 1788-1802 ◽  
Author(s):  
Nihar Ranjan Nayak ◽  
Bikram Keshari Mishra ◽  
Amiya Kumar Rath ◽  
Sagarika Swain
Keyword(s):  
Image Segmentation ◽  
Color Image ◽  
Clustering Algorithms ◽  
Performance Criterion ◽  
Color Image Segmentation ◽  
Experimental Result ◽  
Image Size ◽  
Impressive Result ◽  
Image Pixels ◽  
Visual Characteristic

The findings of image segmentation reflects its expansive applications and existence in the field of digital image processing, so it has been addressed by many researchers in numerous disciplines. It has a crucial impact on the overall performance of the intended scheme. The goal of image segmentation is to assign every image pixels into their respective sections that share a common visual characteristic. In this paper, the authors have evaluated the performances of three different clustering algorithms normally used in image segmentation – the typical K-Means, its modified K-Means++ and their proposed Enhanced Clustering method. The idea is to present a brief explanation of the fundamental working principles implicated in these methods. They have analyzed the performance criterion which affects the outcome of segmentation by considering two vital quality measures namely – Structural Content (SC) and Root Mean Square Error (RMSE) as suggested by Jaskirat et al., (2012). Experimental result shows that, the proposed method gives impressive result for the computed values of SC and RMSE as compared to K-Means and K-Means++. In addition to this, the output of segmentation using the Enhanced technique reduces the overall execution time as compared to the other two approaches irrespective of any image size.

Sign in / Sign up

Export Citation Format

Share Document