Dynamic clustering using particle swarm optimization with application in image segmentation

A new dynamic clustering approach (DCPSO), based on particle swarm optimization, is proposed. This approach is applied to image segmentation. The proposed approach automatically determines the “optimum” number of clusters and simultaneously clusters the data set with minimal user interference. The algorithm starts by partitioning the data set into a relatively large number of clusters to reduce the effects of initial conditions. Using binary particle swarm optimization the “best” number of clusters is selected. The centers of the chosen clusters is then refined via the K-means clustering algorithm. The proposed approach was applied on both synthetic and natural images. The experiments conducted show that the proposed approach generally found the “optimum” number of clusters on the tested images. A genetic algorithm and random search version of dynamic clustering is presented and compared to the particle swarm version.     

基于多尺度颜色小波纹理特征的火焰图像分割

火焰图像分割质量对基于数字成像的燃烧监测十分重要。受炉膛背景及燃烧工况的影响,难以同时满足火焰图像分割速度和准确度（即火焰图像分割结果与真实火焰接近程度）的需求。提出一种基于多尺度颜色特征和小波纹理特征（MCWT）的无监督火焰图像分割方法,用于提高火焰图像分割的质量和速度。结合火焰图像颜色特征及小波纹理特征构建特征矩阵,对特征矩阵进行压缩并初步检测压缩尺度火焰区域。根据压缩尺度火焰边缘确定原始尺度火焰边缘区域并构建火焰边缘区域特征矩阵,进一步分割得到准确火焰图像分割结果。采用该方法对某工业煤燃烧实验炉内不同燃烧工况下的火焰图像进行分割,并与传统分割方法对比。实验结果表明与其他传统分割方法相比,提出方法能够更准确且快速地实现不同燃烧工况下火焰图像的分割,并且其对于含有高斯噪声和椒盐噪声的火焰图像都具有更好的分割效果。     

Unsupervised segmentation of ultrasonic liver images by multiresolution fractal feature vector

The feasibility of selecting fractal feature vector based on multiresolution analysis to segment suspicious abnormal regions of ultrasonic liver images is described in this paper. The proposed feature extraction algorithm is based on the spatial-frequency decomposition and fractal geometry. Segmentation of various liver diseases reveals that the fractal feature vector based on multiresolution analysis is trustworthy. A quantitative characterization based on the proposed unsupervised segmentation algorithm can be utilized to establish an automatic computer-aided diagnostic system. As well, to increase the visual interpretation capability of ultrasonic liver image for junior physicians, off-line learning software is developed to investigate the visual criteria.     

MRF-based texture segmentation using wavelet decomposed images

In recent textured image segmentation, Bayesian approaches capitalizing on computational efficiency of multiresolution representations have received much attention. Most of the previous researches have been based on multiresolution stochastic models which use the Gaussian pyramid image decomposition. In this paper, motivated by nonredundant directional selectivity and highly discriminative nature of the wavelet representation, we present an unsupervised textured image segmentation algorithm based on a multiscale stochastic modeling over the wavelet decomposition of image. The model, using doubly stochastic Markov random fields, captures intrascale statistical dependencies over the wavelet decomposed image and intrascale and interscale dependencies over the corresponding multiresolution region image.     

Phonetic segmentation using multiple speech features

In this paper we propose a method for improving the performance of the segmentation of speech waveforms to phonetic units. The proposed method is based on the well known Viterbi time-alignment algorithm and utilizes the phonetic boundary predictions from multiple speech parameterization techniques. Specifically, we utilize the most appropriate, with respect to boundary type, phone transition position prediction as initial point to start Viterbi time-alignment for the prediction of the successor phonetic boundary. The proposed method was evaluated on the TIMIT database, with the exploitation of several, well known in the area of speech processing, Fourier-based and wavelet-based speech parameterization algorithms. The experimental results for the tolerance of 20 milliseconds indicated an improvement of the absolute segmentation accuracy of approximately 0.70%, when compared to the baseline speech segmentation scheme.     

一种适用于PCB检测的彩色图像分割算法

针对光学检测印刷电路板(PCB)需要进行图像分割的问题,提出一种结合K-均值聚类算法的分水岭算法,用于PCB彩色图像分割。即首先将PCB彩色图像聚类,分成不同的颜色区域,按照不同区域进行分水岭分割,最后,将分割线透明地加在原始图像上,完成分割。实验表明,该算法可以分割PCB彩色图像,并且分割效果好。     

一种快速的模糊C均值聚类彩色图像分割方法

FCM用于彩色图像分割存在聚类数目需要事先确定、计算速度慢的问题,为此,提出一种快速的模糊C均值聚类方法（FFCM）。首先,对原始彩色图像进行基于梯度图的分水岭变换,从而把原始彩色图像数据分成一些具有色彩一致性的子集;然后,利用这些子集的大小和中心点进行模糊聚类。由于FFCM聚类样本数量显著减小,因此可以大幅提高模糊C均值聚类算法的计算速度,进而可以采用聚类有效性指标确定聚类数目。实验表明,这种方法不需要事先确定聚类数目,在聚类有效性能不变的前提下,可以使模糊聚类的速度得到明显提高,实现了彩色图像的快速分割。     

基于QPSO的数据聚类及在图像颜色分割中的应用

聚类算法在数据分析、数据挖掘等许多地方有广泛的应用,探索了基于QPSO的数据聚类及其在图像分割中的应用,提出了一种新的距离度量的聚类算法,在分析PSO聚类算法的基础上提出了QPSO聚类算法,给出了相应的实验结果和算法讨论。     

基于聚类的间隔帧分割算法

镜头分割是基于内容的视频检索首先要解决的关键技术。一般聚类算法可能导致帧序不连续或分割错误,并且现有的分割算法基本上都是对镜头中连续帧依次进行比较,效率比较低;为了解决以上问题,提出了一种改进的镜头分割算法-基于聚类的间隔帧分割算法,在此算法引入了参考变量,镜头中的很多帧不需进行比较。实验表明本算法(采用颜色直方图作为切变判别依据)在镜头分割中提高了效率,并且提高了分割的准确率。     

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

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

Hand image segmentation using color and RCE neural network

This paper presents a color segmentation method based on RCE neural network for hand image segmentation in the gesture-based human–service robot interaction system. The study on skin color distributions in different color spaces indicates that skin colors cluster in a small region in a color space. The RCE neural network characterizes the skin color distribution region using skin color prototypes together with their spherical influence fields during training stage, and identifies the skin regions in the color image during running stage. Experimental results have demonstrated the effectiveness of this method for the segmentation of various hand images as well as general color images with complex backgrounds.     

Video scene segmentation and semantic representation using a novel scheme

Grouping video content into semantic segments and classifying semantic scenes into different types are the crucial processes to content-based video organization, management and retrieval. In this paper, a novel approach to automatically segment scenes and semantically represent scenes is proposed. Firstly, video shots are detected using a rough-to-fine algorithm. Secondly, key-frames within each shot are selected adaptively with hybrid features, and redundant key-frames are removed by template matching. Thirdly, spatio-temporal coherent shots are clustered into the same scene based on the temporal constraint of video content and visual similarity between shot activities. Finally, under the full analysis of typical characters on continuously recorded videos, scene content is semantically represented to satisfy human demand on video retrieval. The proposed algorithm has been performed on various genres of films and TV program. Promising experimental results show that the proposed method makes sense to efficient retrieval of interesting video content.

动作切分和流形度量学习的视频动作识别

目的 为了提高视频中动作识别的准确度,提出基于动作切分和流形度量学习的视频动作识别算法。方法 首先利用基于人物肢体伸展程度分析的动作切分方法对视频中的动作进行切分,将动作识别的对象具体化;然后从动作片段中提取归一化之后的全局时域特征和空域特征、光流特征、帧内的局部旋度特征和散度特征,构造一种7×7的协方差矩阵描述子对提取出的多种特征进行融合;最后结合流形度量学习方法有监督式地寻找更优的距离度量算法提高动作的识别分类效果。结果 对Weizmann公共视频集的切分实验统计结果表明本文提出的视频切分方法具有很好的切分能力,能够作好动作识别前的预处理;在Weizmann公共视频数据集上进行了流形度量学习前后的识别效果对比,结果表明利用流形度量学习方法对动作识别效果提升2.8%;在Weizmann和KTH两个公共视频数据集上的平均识别率分别为95.6%和92.3%,与现有方法的比较表明,本文提出的动作识别方法有更好的识别效果。结论 多次实验结果表明本文算法在预处理过程中动作切分效果理想,描述动作所构造协方差矩阵对动作的表达有良好的多特征融合能力,而且光流信息和旋度、散度信息的加入使得人体各部位的运动方向信息具有了更多细节的描述,有效提高了协方差矩阵的描述能力,结合流形度量学习方法对动作识别的准确性有明显提高。     

肤色相似度和动态阈值相结合的肤色分割技术

为了提高人脸检测的速度与性能,提出一种基于肤色相似度与动态阈值相结合的肤色分割方法。首先在YCgCr颜色空间计算肤色相似度,然后给出一种基于类间方差和类内离散度相结合的动态阈值确定方法,根据求得的动态阈值进行肤色分割,并对肤色分割后的二值图像进行滤除噪声处理。实验结果表明该方法改善了肤色分割性能,能够在复杂背景下实现肤色区域的精确分割,从而提高了人脸检测的速度和性能。     

用于图像分割的粗糙集改进模糊聚类方法

采用一种新的基于粗糙集理论的图像分割算法。通过提取直方图的外层,以及计算像素点周围的局部模糊程度来更新粗糙度。使用局部模糊粗糙度和待定算子来更新FCM算法中的隶属度函数。从粗糙集理论意义上来说,直方图的外层与上近似有关,而直方图取值与下近似有关。该方法通过对比传统的聚类分割算法和刘华军的改进算法,大大降低了时间复杂度,聚类效果显著。实验证明,该方法收敛性较强,运行时间较短,且具有良好的分割效果。     

Adaptive multi-scale segmentation of surface data using unsupervised learning of seed positions

This paper presents a method for multi-scale segmentation of surface data using scale-adaptive region growing. The proposed segmentation algorithm is initiated by an unsupervised learning of optimal seed positions through the surface attribute clustering with a two-criterion score function. The seeds are selected as consecutive local maxima of the clustering map, which is computed by an aggregation of the local isotropic contrast and local variance maps. The proposed method avoids typical segmentation errors caused by an inappropriate choice of seed points and thresholds used in the region-growing algorithm. The scale-adaptive threshold estimate is based on the image local statistics in the neighborhoods of seed points. The performance of this method was evaluated on LiDAR surface images.     

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

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

Foreground prediction for bilayer segmentation of videos

Given a segmentation result (an alpha matte or a binary mask) of the former frame, foreground prediction is a process of estimating the probability that each pixel in the current frame belongs to the foreground. It plays a very important role in bilayer segmentation of videos, especially videos with non-static backgrounds. In this paper, a new foreground prediction algorithm which is called opacity propagation is proposed. It can propagate the opacity values of the former frame to the current frame by minimizing a cost function that is constructed by assuming the spatiotemporally local color smoothness of the video. Optical flow and probability density estimation based on a local color model are employed to find the corresponding pixels of two adjacent frames. An OPSIC (opacity propagation with sudden illumination changes) algorithm is also proposed which is an improvement of our proposed opacity propagation algorithm because it adds a simple color transformation model. As far as we know, this is the first algorithm that can predict the foreground accurately when the illumination changes suddenly. The opacity map (OM) generated by the opacity propagation algorithm is usually more accurate than the previously used probability map (PM). The experiments demonstrate the effectiveness of our algorithm.