Pixel clustering for color image segmentation

Programming and Computer Software - Image segmentation using a hierarchical sequence of piecewise constant approximations that minimally differ from the original image in terms of the total squared...     

一种改进的彩色图像分割算法

文中算法对传统的基于最大隶属度的彩色图像分割算法进行了改进。传统的基于最大隶属度原则的分割方法根据彩色直方图中的色彩矢量来确定目标和背景色模糊集,而绘制彩色直方图时比较繁琐。为了克服这一缺点,先绘制彩色图像对应的灰度直方图。对应于每一个灰度级,取属于该灰度级的像素中的一个像素的颜色来代表这一灰度级所对应的颜色,并保存其R、G、B值。据此建立一组色彩模糊集。计算图像中的所有色彩在各个模糊集中的隶属度,并基于最大隶属度原则确定色彩的归属。建立一种基于最大隶属度原则的神经网络,实现对彩色图像快速有效的分割。通过灰度直方图判断目标和背景色时的误差很小,并不影响判断。在建立色彩模糊集和计算隶属度实现色彩分类的时候都是根据像素色彩的R、G、B值来实现的,因而没有颜色损失。实验结果证明,该算法对原有的基于最大隶属度原则的彩色图像分割方法进行了改进,速度快,效果好。     

改进的MRF彩色图像分割算法

为了解决彩色图像中实现不同目标、不同背景的分割问题,提出了一种基于RGB色彩统计分布的MRF分割算法。在MRF模型的基础上,设定了MRF模型的关键参数并对相关公式进行了推导。对RGB颜色分布模型进行了介绍,重写了能量函数,大大降低了算法的计算难度。由于该算法在RGB彩色空间下充分表达了像素值的信息,使得该算法在分割准确性、适应性及快速性上均有提高。通过与其他算法在同等环境下进行分割实验定量对比,验证了该算法的有效性。     

一种织物彩色图像的分割算法

提出了一种针对织物彩色图像的分割算法。该算法在颜色聚类的基础上,把每种颜色用 不同的序号来表示,生成一个与原图同大小的序号矩阵,然后根据矩阵中序号的分布进行初始分割并 产生种子区域,再把初始分割未能确定的像素指派到种子区域中,最后根据颜色信息合并过分割的区 域,并对区域边缘进行平滑,得到最终的分割结果。实验表明,该算法能较有效地实现各类彩色织物 图像的分割。     

一种基于区域的彩色图像分割方法

介绍了一种基于区域的彩色图像分割方法。该方法首先提取图像像素点的颜色、纹理等特征,然后采用Gaussian混合模型,通过EM算法学习,根据提出的选择最佳高斯混合模型参数K的准则,确定K,利用图像像素点特征的相似度在特征空间中粗略的将像素点划分为不同的组,最后在各个组内依据其位置信息对图像再进一步划分,得到图像的区域分割。实验结果表明,该分割方法具有较好的分割性能。     

SOM and fuzzy based color image segmentation

Spatial information enhances the quality of clustering which is not utilized in the conventional FCM. Normally fuzzy c-mean (FCM) algorithm is not used for color image segmentation and also it is not robust against noise. In this paper, we presented a modified version of fuzzy c-means (FCM) algorithm that incorporates spatial information into the membership function for clustering of color images A progressive technique based on SOM is used to automatically find the number of optimal clusters. The results show that our technique outperforms state-of-the art methods.     

Robust image segmentation against complex color distribution

Color distribution is the most effective cue that is widely adopted in previous interactive image segmentation methods. However, it also may introduce additional errors in some situations, for example, when the foreground and background have similar colors. To address this problem, this paper proposes a novel method to learn the segmentation likelihoods. The proposed method is designed for high reliability, for which purpose it may choose to discard some unreliable likelihoods that may cause segmentation error. The reliability of likelihoods is estimated in a few Expectation–Maximization iterations. In each iteration, a novel multi-class transductive learning algorithm, namely, the Constrained Mapping, is proposed to learn likelihoods and identify unreliable likelihoods simultaneously. The resulting likelihoods then can be used as the input of any segmentation methods to improve their robustness. Experiments show that the proposed method is an effective way to improve both segmentation quality and efficiency, especially when the input image has complex color distribution.     

Interactive color image segmentation with linear programming

Image segmentation is an important and fundamental task for image and vision understanding. This paper describes a linear programming (LP) approach for segmenting a color image into multiple regions. Compared with the recently proposed semi-definite programming (SDP)-based approach, our approach has a simpler mathematical formulation, and a far lower computational complexity. In particular, to segment an image of M × N pixels into k classes, our method requires only O((M N k) ^m ) complexity—a sharp contrast to the complexity of O((M N k)²ⁿ ) if the SDP method is adopted, where m and n are the polynomial complexity of the corresponding LP solver and SDP solver, respectively (in general we have m≪ n). Such a significant reduction in computation readily enables our algorithm to process color images of reasonable sizes. For example, while the existing SDP relaxation algorithm is only able to segment a toy-size image of, e.g., 10 × 10 to 30 × 30 pixels in hours time, our algorithm can process larger color image of, say, 100 × 100 to 500 × 500 image in much shorter time.     

基于小波域隐马模型的树木类图像分割算法*

为了克服自然状态植物图像提取困难,尤其是树图像在自然生长状态下背景非常复杂(天空、建筑物、植物等)的问题.提出一种基于小波域隐马模型的树木类图像分割算法.该算法利用形态小波的优良特性,结合隐藏马尔可夫树模型,实现了基于图像纹理的树木类图像分割,并得到了较为理想的实验效果.     

基于HSI空间模糊聚类的彩色图像分割新方法

模糊C均值(FCM)被广泛应用于彩色图像分割中,但传统的模糊C均值由于没有考虑空间信息,因此对噪声特别敏感。针对此问题,提出了一种在HIS颜色空间结合像素邻域空间信息的模糊聚类新方法。实验结果表明,此方法对高噪声图像有较好的处理结果。     

A new approach for color image segmentation based on color mixture

The aim of this paper is to propose a new methodology for color image segmentation. We have developed an image processing technique, based on color mixture, considering how painters do to overlap layers of various hues of paint on creating oil paintings. We also have evaluated the distribution of cones in the human retina for the interpretation of these colors, and we have proposed a schema for the color mixture weight. This method expresses the mixture of black, blue, green, cyan, red, magenta, yellow and white colors quantified by the binary weight of the color that makes up the pixels of an RGB image with 8 bits per channel. The color mixture generates planes that intersect the RGB cube, defining the HSM (Hue, Saturation, Mixture) color space. The position of these planes inside the RGB cube is modeled, based on the distribution of r, g and b cones of the human retina. To demonstrate the applicability of the proposed methodology, we present in this paper, the segmentation of “human skin” or “non-skin” pixels in digital color images. The performance of the color mixture was analyzed by a Gaussian distribution in the HSM, HSV and YCbCr color spaces. The method is compared with other skin/non-skin classifiers. The results demonstrate that our approach surpassed the performance of all compared methodologies. The main contributions of this paper are related to a new way for interpreting color of binary images, taking into account the bit-plane levels and the application in image processing techniques.     

快速几何可变形彩色昆虫图像分割算法

为了解决大部分现有几何可变形方法无法用于彩色图像分割的问题,给出了快速几何可变形彩色图像分割算法,并应用于昆虫图像。实验结果表明：该算法能够很好地分割出昆虫对象,而基于通道-通道的几何可变形算法在不同通道上得到不同的昆虫对象边缘。     

Interactive color image segmentation via iterative evidential labeling

We develop an interactive color image segmentation method in this paper. This method makes use of the conception of Markov random fields (MRFs) and D–S evidence theory to obtain segmentation results by considering both likelihood information and priori information under Bayesian framework. The method first uses expectation maximization (EM) algorithm to estimate the parameter of the user input regions, and the Bayesian information criterion (BIC) is used for model selection. Then the beliefs of each pixel are assigned by a predefined scheme. The result is obtained by iteratively fusion of the pixel likelihood information and the pixel contextual information until convergence. The method is initially designed for two-label segmentation, however it can be easily generalized to multi-label segmentation. Experimental results show that the proposed method is comparable to other prevalent interactive image segmentation algorithms in most cases of two-label segmentation task, both qualitatively and quantitatively.     

示温漆彩色图像分割与温度识别系统

通过对示温漆颜色温度特性的分析,提出一种基于标记区域生长的彩色图像分割方法,并给出温度识别的方案。试验结果显示该方法对示温漆图像分割及温度识别具有较好的效果。     

基于HSI颜色空间的X射线彩色图像分割

给出一种HSI颜色空间上基于HSI分量统计概率分布的彩色图像分割方法,并应用于X射线安全检查仪下危险品图像的分割。该方法将RGB彩色图像转换到HSI颜色空间,并以S分量为主要依据对图像进行粗分割,获得旅客包裹图像,然后,利用H和1分量的联合阈值进行细节分割获得疑似危险品的图像。在实际应用中表明该方法快速简单,满足实时性要求,是一种高效的自动算法。     

用于彩图分割的自适应谱聚类算法

针对自调节谱聚类算法的缺陷,提出一种新的自适应谱聚类算法。它用全局平均N近邻距离作为比例参数σ,利用本征矢差异来估计最佳聚类分组数k,达到了比前者更好的效果,且更容易实现。在彩色图像分割实际应用中的实验结果表明,该算法适应性强、计算代价小、精度较高,性能好于或至少不差于以往的类似算法。     

Semi-supervised statistical region refinement for color image segmentation

Some authors have recently devised adaptations of spectral grouping algorithms to integrate prior knowledge, as constrained eigenvalues problems. In this paper, we improve and adapt a recent statistical region merging approach to this task, as a non-parametric mixture model estimation problem. The approach appears to be attractive both for its theoretical benefits and its experimental results, as slight bias brings dramatic improvements over unbiased approaches on challenging digital pictures.     

基于颜色特征的玉米雄穗图像分割

提出了一种基于颜色特征的玉米雄穗分割方法.利用侧抑制网络与二维Otsu结合的分割方法对玉米雄穗图像的YCbCr颜色空间的Cr分量进行分割,再利用相同方法对玉米雄穗图像的超绿特征图像进行分割,取两个分割结果的交集,去除小面积的连通域,得到玉米雄穗的分割图.为了验证算法的有效性,选用了不同生长环境的玉米雄穗图像,分别利用本文方法、二维Otsu和基于侧抑制的二维Otsu方法进行了比较实验.结果表明:该方法有很好的抗干扰性,对生长环境有很强的鲁棒性.     

Learning a color distance metric for region-based image segmentation

In this paper we describe an experiment where we studied empirically the application of a learned distance metric to be used as discrimination function for an established color image segmentation algorithm. For this purpose we chose the Mumford–Shah energy functional and the Mahalanobis distance metric. The objective was to test our approach in an objective and quantifiable way on this specific algorithm employing this particular distance model, without making generalization claims. The empirical validation of the results was performed in two experiments: one applying the resulting segmentation method on a subset of the Berkeley Image Database, an exemplar image set possessing ground-truths and validating the results against the ground-truths using two well-known inter-cluster validation methods, namely, the Rand and BGM indexes, and another experiment using images of the same context divided into training and testing set, where the distance metric is learned from the training set and then applied to segment all the images. The obtained results suggest that the use of the specified learned distance metric provides better and more robust segmentations, even if no other modification of the segmentation algorithm is performed.