基于改进C均值聚类的自适应图像分色算法

图像分色在纺织和印刷等行业中有着广泛而重要的应用,其目的是用尽量少的颜色来描述一幅真彩色图像,使得到的图像与原图像尽可能的接近。该文提出了一种基于改进C均值聚类的自适应图像分色算法。该算法首先随机产生一张颜色表,然后根据该颜色表对原图像的像素点进行聚类分析,产生初始分色图像。再根据C均值聚类的方法对初始聚类中心进行调整,生成新的分色图像,直到满足结束条件后结束算法。实验结果表明,该算法在大大减少原图像的颜色数量的同时基本保持分色图像的质量,是一种实用的分色方法。     

基于直方图重构的极大交叉熵图像分割方法

针对图像分割阈值选择问题,提出用动态参数将原始图像直方图分成两部分,构造两个新的相关直方图,分别对应于同原始图像等尺寸的虚拟图像,其中等概率像素是原始图像的相似像素。聚集计算两个构造直方图概率分布的交叉熵,分析其函数曲线极大值的峰谷关系,实现图像最佳多阈值分割。实验结果表明该方法的有效性。     

基于矢量量化和区域生长的彩色图像分割新算法

针对光照变化和阴影对图像分割的不利影响问题,提出了一种基于矢量量化和区域生长的彩色图像分割新算法。该算法不仅考虑了彩色图像的颜色信息,而且也考虑了彩色图像的空间信息。该算法首先利用一种修改的GLA算法对彩色图像进行量化,并根据彩色图像量化的结果选取种子像素;然后基于矢量角相似性准则,并结合像素空间邻接信息,对每一个种子像素进行区域生长;最后利用模糊C-M eans算法来对未能归类的剩余像素进行分类。实验表明,该算法不仅可以在很大程度上克服光照变化及阴影对图像分割的不利影响,而且分割结果与人的主观视觉感知具有良好的一致性。     

融合T节点线索的图像物体分割

目的 图像分割是计算机视觉、数字图像处理等应用领域首要解决的关键问题。针对现有的单幅图像物体分割算法广泛存在的过分割和过合并现象,提出基于图像T型节点线索的图像物体分割算法。方法 首先,利用L0梯度最小化方法平滑目标图像,剔除细小纹理的干扰;其次,基于Graph-based分割算法对平滑后图像进行适度分割,得到粗糙分割结果;最后,借助于图像中广泛存在的T型节点线索对初始分割块进行区域合并得到最终优化分割结果。结果 将本文算法分别与Grabcut算法及Graph-based算法在不同场景类型下进行了实验与对比。实验结果显示,Grabcut算法需要人工定位边界且一次只能分割单个物体,Graph-based算法综合类内相似度和类间差异性,可以有效保持图像边界,但无法有效控制分割块数量,且分割结果对阈值参数过分依赖,极易导致过分割和过合并现象。本文方法在降低过分割和过合并现象、边界定位精确性和分割准确率方面获得明显改进,几组不同类型的图片分割准确率平均值达到91.16%,明显由于其他算法。处理图像尺寸800×600像素的图像平均耗时3.5 s,较之其他算法略有增加。结论 与各种算法对比结果表明,该算法可有效解决过分割和过合并问题,对比实验结果验证了该方法的有效性,能够取得具有一定语义的图像物体分割结果。     

Color clustering and learning for image segmentation based on neural networks

An image segmentation system is proposed for the segmentation of color image based on neural networks. In order to measure the color difference properly, image colors are represented in a modified L/sup */u/sup */v/sup */ color space. The segmentation system comprises unsupervised segmentation and supervised segmentation. The unsupervised segmentation is achieved by a two-level approach, i.e., color reduction and color clustering. In color reduction, image colors are projected into a small set of prototypes using self-organizing map (SOM) learning. In color clustering, simulated annealing (SA) seeks the optimal clusters from SOM prototypes. This two-level approach takes the advantages of SOM and SA, which can achieve the near-optimal segmentation with a low computational cost. The supervised segmentation involves color learning and pixel classification. In color learning, color prototype is defined to represent a spherical region in color space. A procedure of hierarchical prototype learning (HPL) is used to generate the different sizes of color prototypes from the sample of object colors. These color prototypes provide a good estimate for object colors. The image pixels are classified by the matching of color prototypes. The experimental results show that the system has the desired ability for the segmentation of color image in a variety of vision tasks.     

显著特征融合的主颜色聚类分割算法*

针对颜色密度聚类分割模型容易产生误分割的问题,提出基于视觉显著性调节的主颜色聚类分割算法.首先,根据空间颜色信息和Mean-shift算法平滑结果分别计算图像的全局显著特征和区域显著特征,并融合2类显著特征作为特征空间聚类的约束项.然后,采用核密度估计方法计算图像主颜色作为初始类,并将显著特征作为调节因子进行聚类分割.最后,进行区域合并.在标准的分割图像库上进行实验并与多种算法对比,结果表明,文中算法具有更高的区域轮廓准确度,并且有效利用图像显著特征,降低密度聚类形成的区域不一致性,提高像素聚类的精度和分割的鲁棒性.     

复杂网络理论在彩色图像分割中的应用研究

图像分割在许多图像处理应用中具有重要作用。为提高彩色图像分割效果,更好的表示图像信息,利用复杂网络理论对彩色图像分割进行研究,从网络社团结构模型的角度分析图像,提出一种更为清晰的彩色图像分割表述方法。根据彩色图像中各像素点之间的相似性构造图像的网络社团结构图,实现对图像数据的建模,之后利用谱聚类社团划分算法对较好的网络社团结构图进行社团检测,进而实现对图像相似像素的聚类,最后得到图像分割结果。在BSDS300图像库上随机选取不同的彩色图像进行实验,通过对图像分割结果的分析研究,结果表明提出的算法在精度方面优于传统彩色图像分割算法,可以实现更好的分割结果,同时验证了社团划分算法进行彩色图像分割的可行性和有效性。     

一种粗糙不确定的图像分割方法

图像分割是计算机视觉领域的一个基础问题,涉及图像检索、物体检测、物体识别、行人跟踪等众多后续任务。目前已有大量研究成果,有基于阈值、聚类、区域生长的传统方法,也有基于神经网络的流行算法。由于图像区域边界的不确定性问题,现有算法并没有很好地解决图像部分区域渐变导致的边界模糊问题。粒计算是解决复杂问题的有效工具之一,在不确定的、模糊的问题上取得了良好的效果。针对现有图像分割算法在不确定性问题上的局限性,基于粒计算思想,提出了一种粗糙不确定性的图像分割方法。该算法在K均值算法的基础上,结合邻域粗糙集模型,先对类别边界区域的像素点进行粒化,运用邻域关系矩阵,得到各类别对各粒化像素点的包含度,从而对边界区域类别模糊的像素点进行重新划分,优化了图像分割的结果。在Matlab2019编程环境中,实验选取了BSDS500数据集中的一张马术训练图片和一张建筑物图片来测试算法性能。实验先对彩色图像进行灰度处理,用K均值算法对图像进行初步分割,再设置邻域因子值,依据边界像素点邻域信息重新划分边界点。对比K均值算法的分割结果可知,所提算法取得了更佳的效果。实验结果表明,该方法在粗糙度这一评价标准上优于K均值算法,可以有效降低图像区域边界的模糊性,实现灰度边界模糊的图像渐变区域的分割。     

一种融合颜色和空间信息的彩色图像分割算法

提出了一种基于图像颜色和空间信息的彩色图像分割算法.该算法首先根据所提出的颜色粗糙度概念对图像进行颜色量化,并在此基础上使用增量式的区域生长算法发现颜色相近的像素之间的空间连通性,形成图像的初始分割区域.然后,根据融合了颜色和空间信息的区域距离,对初始分割区域进行分级合并,直到系统满足了所提出的停止区域合并的准则.最后,利用形态学的有关算法对分割区域的边缘进行平滑.实验证明,算法的分割结果与人的主观视觉感知具有良好的一致性.     

一种改进的基于图论的图像分割方法

由于传统基于图论的图像分割方法是基于像素级别的,随着像素的增多,其应用也受到了限制,因此,提出一种改进的图像分割方法。该图像分割方法利用Dijkstra算法,将图像的像素点聚集形成超像素;应用Kruskal算法,得到最小生成树,确定并删除最小生成树的不一致边,完成图像分割。实验结果表明,改进方法分割的区域内部特征具有较好的均匀性和一致性。     

Color image segmentation—an innovative approach

In this paper we describe a color image segmentation system that performs color clustering in a color space and then color region segmentation in the image domain. For color segmentation, we developed a fuzzy clustering algorithm that iteratively generates color clusters using a uniquely defined fuzzy membership function and an objective function for clustering optimization. The fuzzy membership function represents belief value of a color belonging to a color cluster and the mutual interference of neighboring clusters. The region segmentation algorithm merges clusters in the image domain based on color similarity and spatial adjacency. We developed three different methods for merging regions in the image domain. Unlike many existing clustering algorithms, the image segmentation system does not require the knowledge about the number of the color clusters to be generated at each stage and the resolution of the color regions can be controlled by one single parameter, the radius of a cluster. The color image segmentation system has been implemented and tested on a variety of color images including satellite images, car and face images. The experiment results are presented and the performance of each algorithm in the segmentation system is analyzed. The system has shown to be both effective and efficient.     

基于模糊规则的印刷图像专色分色研究

现有印刷图像专色分色技术已经不能满足印前处理效率和印刷质量要求,针对这一现状,提出了一种模糊C-均值聚类算法(FCM)。该算法基于像素分类,它首先对图像的灰度级进行模糊聚类,得到图像的聚类中心,然后根据每个像素点的灰度级,依照最大隶属度原则将各个像素点归于相应的类别中。实验证明,采用FCM 对印刷图像进行分割具有直观、易于实现的特点,实现了较好的分割效果。     

SOM Ensemble-Based Image Segmentation

Image segmentation plays an important role in image analysis and image understanding. In this paper, an image segmentation method based on ensemble of SOM neural networks is proposed, which clusters the pixels in an image according to color and spatial features with many SOM neural networks, and then combines the clustering results to give the final segmentation. Experimental results show that the proposed method performs better than some existing clustering-based image segmentation methods.     

A contextual-based segmentation of compact PolSAR images using Markov Random Field (MRF) model

As the first major step in each object-oriented feature extraction approach, segmentation plays an essential role as a preliminary step towards further and higher levels of image processing. The primary objective of this paper is to illustrate the potential of Polarimetric Synthetic Aperture Radar (PolSAR) features extracted from Compact Polarimetry (CP) SAR data for image segmentation using Markov Random Field (MRF). The proposed method takes advantage of both spectral and spatial information to segment the CP SAR data. In the first step of the proposed method, k-means clustering was applied to over-segment the image using the appropriate features optimally selected using Genetic Algorithm (GA). As a similarity criterion in each cluster, a probabilistic distance was used for an agglomerative hierarchical merging of small clusters into an appropriate number of larger clusters. In the agglomerative clustering approach, the estimation of the appropriate number of clusters using the data log-likelihood algorithm differs depending on the distance criterion used in the algorithm. In particular, the Wishart Chernoff distance which is independent of samples (pixels) tends to provide a higher appropriate number of clusters compared to the Wishart test statistic distance. This is because the Wishart Chernoff distance preserves detailed data information corresponding to small clusters. The probabilistic distance used in this study is Wishart Chernoff distance which evaluates the similarity of clusters by measuring the distance between their complex Wishart probability density functions. The output of this step, as the initial segmentation of the image, is applied to a Markov Random Field model to improve the final segmentation using vicinity information. The method combines Wishart clustering and enhanced initial clusters in order to access the posterior MRF energy function. The contextual image classifier adopts the Iterated Conditional Mode (ICM) approach to converge to a local minimum and represent a good trade-off between segmentation accuracy and computation burden. The results showed that the PolSAR features extracted from CP mode can provide an acceptable overall accuracy in segmentation when compared to the full polarimetry (FP) and Dual Polarimetry (DP) data. Moreover, the results indicated that the proposed algorithm is superior to the existing image segmentation techniques in terms of segmentation accuracy.     

基于均值偏移的户外图像快速分割算法

提出一种改进的基于均值偏移的户外图像快速分割算法,使其能够满足基于视觉的户外移动机器人导航对图像处理的快速性要求。阐述了均值偏移算法的基本原理,给出了图像快速分割的具体实现方法:对图像进行尺度空间变换,用均值偏移算法在选定的颜色空间中对图像进行分割。通过对多种户外环境下采集到的图像进行实验,结果表明该算法对户外彩色图像快速分割取得了良好的效果。     

基于色彩的图像数据库检索方法的研究

文中论述了基于色彩的图像检索方法,对色彩空间的选择、彩色聚类方法、色彩直方图的距离、以及基于图像分割的色彩直方图等方面进行了详细的论述;为提高图像检索的效率和精度,采用了多阶段相似比较的方法。     

基于谱聚类的两阶段颜色量化算法

颜色量化是进行图像处理和图像分析的重要技术之一,可以被广泛地应用到图像分割、图像压缩和图像识别中。首先利用高效的二分K均值聚类进行粗略量化,然后使用基于加权距离的谱聚类进行再次量化。实验结果表明,和其他常见量化算法相比,两者的结合使得新方法在运算速度和量化质量上都取得了不错的结果,而加权距离的引入,有效地解决了传统算法将包含像素个数少但重要的颜色进行错划分的问题。     

Color Image Segmentation for Multimedia Applications

Image segmentation is crucial for multimedia applications. Multimedia databases utilize segmentation for the storage and indexing of images and video. Image segmentation is used for object tracking in the new MPEG-7 video compression standard. It is also used in video conferencing for compression and coding purposes. These are only some of the multimedia applications in image segmentation. It is usually the first task of any image analysis process, and thus, subsequent tasks rely heavily on the quality of segmentation. The proposed method of color image segmentation is very effective in segmenting a multimedia-type image into regions. Pixels are first classified as either chromatic or achromatic depending on their HSI color values. Next, a seed determination algorithm finds seed pixels that are in the center of regions. These seed pixels are used in the region growing step to grow regions by comparing these seed pixels to neighboring pixels using the cylindrical distance metric. Merging regions that are similar in color is a final means used for segmenting the image into even smaller regions.     

Motion-based skin region of interest detection with a real-time connected component labeling algorithm

This paper presents a motion-based skin Region of Interest (ROI) detection method using a real-time connected component labeling algorithm to provide real-time and adaptive skin ROI detection in video images. Skin pixel segmentation in video images is a pre-processing step for face and hand gesture recognition, and motion is a cue for detecting foreground objects. We define skin ROIs as pixels of skin-like color where motion takes place. In the skin color estimation phase, RGB color histograms are utilized to define the skin color distribution and specify the threshold to segment skin-like regions. A parallel computed connected component labeling algorithm is also proposed to group the segmentation results into several clusters. If a cluster covers any motion pixel, this cluster is identified as a skin ROI. The method’s results for real images are shown, and its speed is evaluated for various parameters. This technology is compatible with monitoring systems, scene understanding, and natural user interfaces.