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

2015 ◽  
Vol 6 (2) ◽  
pp. 50-62 ◽  
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.

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.

An Enhanced Clustering Method for Image Segmentation

2019 ◽  
pp. 325-343
Author(s):  
Bikram Keshari Mishra ◽  
Amiya Kumar Rath
Keyword(s):  
Image Segmentation ◽  
Clustering Algorithms ◽  
Experimental Result ◽  
Image Size ◽  
Clustering Method ◽  
Impressive Result ◽  
Structural Content ◽  
Overall Performance ◽  
Image Pixels ◽  
Visual Characteristic

The findings of image segmentation reflect 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 chapter, the authors have evaluated the performances of three different clustering algorithms used in image segmentation: the classical k-means, its modified k-means++, and proposed enhanced clustering method. Brief explanations of the fundamental working principles implicated in these methods are presented. Thereafter, the performance which affects the outcome of segmentation are evaluated considering two vital quality measures, namely structural content (SC) and root mean square error (RMSE). 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.

FAST INTERACTIVE REGIONAL PATTERN MERGING FOR GENERIC TISSUE SEGMENTATION IN HISTOPATHOLOGY IMAGES

2021 ◽  
pp. 2150012
Author(s):  
Kuo-Lung Lor ◽  
Chung-Ming Chen
Keyword(s):  
Image Segmentation ◽  
Color Image ◽  
Linear Time ◽  
Mean Shift ◽  
Texture Features ◽  
Color Image Segmentation ◽  
Image Size ◽  
Region Merging ◽  
Tissue Segmentation ◽  
Regional Pattern

The image segmentation of histopathological tissue images has always been a challenge due to the overlapping of tissue color distributions, the complexity of extracellular texture and the large image size. In this paper, we introduce a new region-merging algorithm, namely, the Regional Pattern Merging (RPM) for interactive color image segmentation and annotation, by efficiently retrieving and applying the user’s prior knowledge of stroke-based interaction. Low-level color/texture features of each region are used to compose a regional pattern adapted to differentiating a foreground object from the background scene. This iterative region-merging is based on a modified Region Adjacency Graph (RAG) model built from initial segmented results of the mean shift to speed up the merging process. The foreground region of interest (ROI) is segmented by the reduction of the background region and discrimination of uncertain regions. We then compare our method against state-of-the-art interactive image segmentation algorithms in both natural images and histological images. Taking into account the homogeneity of both color and texture, the resulting semi-supervised classification and interactive segmentation capture histological structures more completely than other intensity or color-based methods. Experimental results show that the merging of the RAG model runs in a linear time according to the number of graph edges, which is essentially faster than both traditional graph-based and region-based methods.

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.

A Novel Segmentation Method of Roads and Slopes for Collapse Recognition

2013 ◽  
Vol 663 ◽  
pp. 137-143
Author(s):  
Zong Ling Yan ◽  
Yuan Yuan Jia ◽  
Zhong Shi He
Keyword(s):  
Image Segmentation ◽  
Traffic Safety ◽  
Color Image ◽  
Recognition System ◽  
Color Image Segmentation ◽  
Experimental Result ◽  
Region Merging ◽  
Color Features ◽  
Geometrical Features ◽  
Segmentation Approach

Color image processing is seldom used in the recognition of roads and slopes collapse. And the application can bring great advantages to the traffic safety. Color image segmentation is the first and key step of the recognition system. By analyzing existing methods of color image segmentation, several drawbacks have been discovered. This paper proposed a novel and efficient segmentation approach which is suitable for the recognition of collapse. The Region of Interests (ROIs), i.e. the roads and slopes, was obtained with the ingenious use of the images characters. According to combine K-means clustering with region merging, connected-component algorithm and close operation, the roads and slopes are segmented with the statistical color features, geometrical features and the location of the objects. Experimental result shows feasibility and efficiency of the proposed approach.

scholarly journals K-Hyperline Clustering-Based Color Image Segmentation Robust to Illumination Changes

Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 610 ◽  
Author(s):  
Senquan Yang ◽  
Pu Li ◽  
HaoXiang Wen ◽  
Yuan Xie ◽  
Zhaoshui He
Keyword(s):  
Image Processing ◽  
Image Segmentation ◽  
Clustering Algorithm ◽  
Color Image ◽  
Clustering Algorithms ◽  
Color Image Segmentation ◽  
Color Classification ◽  
Clustering Problem ◽  
Illumination Changes ◽  
Segmentation Approach

Color image segmentation is very important in the field of image processing as it is commonly used for image semantic recognition, image searching, video surveillance or other applications. Although clustering algorithms have been successfully applied for image segmentation, conventional clustering algorithms such as K-means clustering algorithms are not sufficiently robust to illumination changes, which is common in real-world environments. Motivated by the observation that the RGB value distributions of the same color under different illuminations are located in an identical hyperline, we formulate color classification as a hyperline clustering problem. We then propose a K-hyperline clustering algorithm-based color image segmentation approach. Experiments on both synthetic and real images demonstrate the outstanding performance and robustness of the proposed algorithm as compared to existing clustering algorithms.

scholarly journals A Fast Color Image Segmentation Approach Using GDF with Improved Region-Level Ncut

2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Ying Li ◽  
Shuliang Wang ◽  
Caoyuan Li ◽  
Zhenkuan Pan ◽  
Weizhong Zhang
Keyword(s):  
Image Segmentation ◽  
Time Complexity ◽  
Color Image ◽  
Feature Space ◽  
Color Images ◽  
Color Image Segmentation ◽  
Novel Approach ◽  
Normalized Cuts ◽  
Segmentation Approach ◽  
Image Pixels

Color image segmentation is fundamental in image processing and computer vision. A novel approach, GDF-Ncut, is proposed to segment color images by integrating generalized data field (GDF) and improved normalized cuts (Ncut). To start with, the hierarchy-grid structure is constructed in the color feature space of an image in an attempt to reduce the time complexity but preserve the quality of image segmentation. Then a fast hierarchy-grid clustering is performed under GDF potential estimation and therefore image pixels are merged into disjoint oversegmented but meaningful initial regions. Finally, these regions are presented as a weighted undirected graph, upon which Ncut algorithm merges homogenous initial regions to achieve final image segmentation. The use of the fast clustering improves the effectiveness of Ncut because regions-based graph is constructed instead of pixel-based graph. Meanwhile, during the processes of Ncut matrix computation, oversegmented regions are grouped into homogeneous parts for greatly ameliorating the intermediate problems from GDF and accordingly decreasing the sensitivity to noise. Experimental results on a variety of color images demonstrate that the proposed method significantly reduces the time complexity while partitioning image into meaningful and physically connected regions. The method is potentially beneficial to serve object extraction and pattern recognition.

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.

Roughness Measure Approach to Color Image Segmentation

2010 ◽  
Vol 36 (6) ◽  
pp. 807-816 ◽  
Author(s):  
Xiao-Dong YUE ◽  
Duo-Qian MIAO ◽  
Cai-Ming ZHONG
Keyword(s):  
Image Segmentation ◽  
Color Image ◽  
Color Image Segmentation
Sign in / Sign up

Export Citation Format

Share Document