A New Method of Wind Turbine Bearing Fault Diagnosis Based on Multi-Masking Empirical Mode Decomposition and Fuzzy C-Means Clustering

Based on Multi-Masking Empirical Mode Decomposition (MMEMD) and fuzzy c-means (FCM) clustering, a new method of wind turbine bearing fault diagnosis FCM-MMEMD is proposed, which can determine the fault accurately and timely. First, FCM clustering is employed to classify the data into different clusters, which helps to estimate whether there is a fault and how many fault types there are. If fault signals exist, the fault vibration signals are then demodulated and decomposed into different frequency bands by MMEMD in order to be analyzed further. In order to overcome the mode mixing defect of empirical mode decomposition (EMD), a novel method called MMEMD is proposed. It is an improvement to masking empirical mode decomposition (MEMD). By adding multi-masking signals to the signals to be decomposed in different levels, it can restrain low-frequency components from mixing in highfrequency components effectively in the sifting process and then suppress the mode mixing. It has the advantages of easy implementation and strong ability of suppressing modal mixing. The fault type is determined by Hilbert envelope finally. The results of simulation signal decomposition showed the high performance of MMEMD. Experiments of bearing fault diagnosis in wind turbine bearing fault diagnosis proved the validity and high accuracy of the new method.

Improved evidential fuzzy c-means method

Dempster-Shafer evidence theory(DS theory) is widely used in brain magnetic resonance imaging(MRI) segmentation,due to its efficient combination of the evidence from different sources. In this paper, an improved MRI segmentation method,which is based on fuzzy c-means(FCM) and DS theory, is proposed. Firstly, the average fusion method is used to reduce the uncertainty and the conflict information in the pictures. Then, the neighborhood information and the different influences of spatial location of neighborhood pixels are taken into consideration to handle the spatial information. Finally, the segmentation and the sensor data fusion are achieved by using the DS theory. The simulated images and the MRI images illustrate that our proposed method is more effective in image segmentation.

Fault Pattern Recognition based on Kernel Method and Fuzzy C-means

A method about fault identification is proposed to solve the relationship among fault features of large rotating machinery, which is extremely complicated and nonlinear. This paper studies the rotor test-rig and the clustering of data sets and fault pattern recognitions. The present method firstly maps the data from their original space to a high dimensional Kernel space which makes the highly nonlinear data in low-dimensional space become linearly separable in Kernel space. It highlights the differences among the features of the data set. Then fuzzy C-means （FCM） is conducted in the Kernel space. Each data is assigned to the nearest class by computing the distance to the clustering center. Finally, test set is used to judge the results. The convergence rate and clustering accuracy are better than traditional FCM. The study shows that the method is effective for the accuracy of pattern recognition on rotating machinery.

基于图谱理论的FCM图像分割方法研究

利用图谱理论的思想对传统模糊C-均值(FCM)图像分割方法进行改进——将图谱理论中的权值计算方法引入到FCM方法的距离计算中,较之原来的Euclid距离不仅考虑了各样本空间上的距离,同时考虑了各样本之间的灰度差异,获得更适用于图像分割的模糊隶属度函数,从而得到改进的FCM图像分割方法。通过与传统FCM图像分割方法、基于图谱理论的图像分割方法的实验结果、错分概率及评价指标的对比分析,证明所提出的改进FCM方法能够很好地解决图像分割问题。

Adaptive Image Digital Watermarking with DCT and FCM

A novel adaptive digital image watermark algorithm is proposed. Fuzzy c-means clustering （FCM） is used to classify the original image blocks into two classes based on several characteristic parameters of human visual system （HVS）. One is suited for embedding a digital watermark, the other is not. So the appropriate blocks in an image are selected to embed the watermark. The wetermark is embedded in the middle-frequency part of the host image in conjunction with HVS and discrete cosine transform （DCT）. The maximal watermark strength is fixed according to the frequency masking. In the same time, for the good performance, the watermark is modulated into a fractal modulation array. The simulation results show that we can remarkably extract the hiding watermark and the algorithm can achieve good robustness with common signal distortion or geometric distortion and the quality of the watermarked image is guaranteed.

Research and Implementation of the Enterprise Evaluation Based on a Fusion Clustering Model of AHP-FCM

Traditional clustering method is easy to slow convergence speed because of high data dimension and setting random initial clustering center. To improve these problems, a novel method combining subtractive clustering with fuzzy C-means( FCM)clustering will be advanced. In the method, the initial cluster number and cluster center can be obtained using subtractive clustering. On this basis,clustering result will be further optimized with FCM. In addition,the data dimension will be reduced through the analytic hierarchy process( AHP) before clustering calculating.In order to verify the effectiveness of fusion algorithm,an example about enterprise credit evaluation will be carried out. The results show that the fusion clustering algorithm is suitable for classifying high-dimension data,and the algorithm also does well in running up processing speed and improving visibility of result. So the method is suitable to promote the use.

Automated measurement of three-dimensional cerebral cortical thickness in Alzheimer’s patients using localized gradient vector trajectory in fuzzy membership maps

Our purpose in this study was to develop an automated method for measuring three-dimensional (3D) cerebral cortical thicknesses in patients with Alzheimer’s disease (AD) using magnetic resonance (MR) images. Our proposed method consists of mainly three steps. First, a brain parenchymal region was segmented based on brain model matching. Second, a 3D fuzzy membership map for a cerebral cortical region was created by applying a fuzzy c-means (FCM) clustering algorithm to T1-weighted MR images. Third, cerebral cortical thickness was three- dimensionally measured on each cortical surface voxel by using a localized gradient vector trajectory in a fuzzy membership map. Spherical models with 3 mm artificial cortical regions, which were produced using three noise levels of 2%, 5%, and 10%, were employed to evaluate the proposed method. We also applied the proposed method to T1-weighted images obtained from 20 cases, i.e., 10 clinically diagnosed AD cases and 10 clinically normal (CN) subjects. The thicknesses of the 3 mm artificial cortical regions for spherical models with noise levels of 2%, 5%, and 10% were measured by the proposed method as 2.953 ± 0.342, 2.953 ± 0.342 and 2.952 ± 0.343 mm, respectively. Thus the mean thicknesses for the entire cerebral lobar region were 3.1 ± 0.4 mm for AD patients and 3.3 ± 0.4 mm for CN subjects, respectively (p < 0.05). The proposed method could be feasible for measuring the 3D cerebral cortical thickness on individual cortical surface voxels as an atrophy feature in AD.

Research of Improved Fuzzy c-means Algorithm Based on a New Metric Norm

For the question that fuzzy c-means(FCM)clustering algorithm has the disadvantages of being too sensitive to the initial cluster centers and easily trapped in local optima,this paper introduces a new metric norm in FCM and particle swarm optimization(PSO)clustering algorithm,and proposes a parallel optimization algorithm using an improved fuzzy c-means method combined with particle swarm optimization(AF-APSO).The experiment shows that the AF-APSO can avoid local optima,and get the best fitness and clustering performance significantly.

Advanced Fuzzy C-Means Algorithm Based on Local Density and Distance

This paper presents an advanced fuzzy C-means(FCM) clustering algorithm to overcome the weakness of the traditional FCM algorithm, including the instability of random selecting of initial center and the limitation of the data separation or the size of clusters. The advanced FCM algorithm combines the distance with density and improves the objective function so that the performance of the algorithm can be improved. The experimental results show that the proposed FCM algorithm requires fewer iterations yet provides higher accuracy than the traditional FCM algorithm. The advanced algorithm is applied to the influence of stars' box-office data, and the classification accuracy of the first class stars achieves 92.625%.

自然环境下基于颜色聚类和颜色距离的死钩检测

针对目前火车死钩检测无法自动实现的问题,提出了一种自然环境下基于颜色聚类和颜色距离的死钩检测方法。根据死钩和车厢颜色的对应关系,使用CCD(charge-coupled device)相机获取现场车厢图像并提取前景区域和背景区域的颜色特征,通过分析该颜色信息的差异来判断车厢之间的连接是否为死钩。首先获取特定区域的颜色信息,然后采用FCM(fuzzy C-mean)聚类算法对颜色信息进行分类得到该区域的单一颜色特征,最后根据HLC(hue,lightness,hromatic)颜色空间和人类颜色视觉的相似关系,计算颜色特征对的NBS(national bureau of standards)颜色距离。利用翻车作业现场火车车厢图像进行检测,实验结果验证了该方法具有对颜色差异的高敏感性和识别的准确性,可以满足实际死钩检测的需要。

一种基于各向异性扩散的图像分割算法研究

针对煤矿井下图像对比度小、纹理不清晰和数据量大等问题,根据各向异性扩散在图像处理中具有良好的边缘保持与增强的作用,提出一种基于各向异性扩散的图像分割算法.首先在图像分割前对原图像进行各向异性扩散运算,在消除原图像噪声的同时,更好地划分了图像的边缘和纹理区域;然后提取图像的纹理特性运用到聚类算法中,从而对图像进行分割.实验证明:与未经扩散处理的分割算法相比,基于各向异性扩散的图像分割算法不仅改善了分割效果,而且提高了计算速度.

Analysis of Selecting Gated Community as Opening Its Micro-Inter-Road Network

The opening of gated community to expand the micro-road network in the urban traffic system is a hot topic on the urban congestion. To satisfy the demand of opening early choosing case, this paper proposed a comprehensive selecting framework on qualified communities and its appropriate opening time. Firstly, the static influential factors on internal road structure, boundary road structure and traffic flow are qualitatively analyzed. Then, an evaluation opening state index system based on describing accurately traffic flow state is obtained, which takes the opening factors into account at the boundary road network. In this structure, the modified fuzzy C-means (FCM) method calculates the fuzzy entropy weight and range of each opening states index. Finally, the simulation results show that the proposed method is capable of selecting qualified community and the optimum opening time.

Fuzzy Clustering with Novel Separable Criterion

Fuzzy clustering has been used widely in pattern recognition, image processing, and data analysis An improved fuzzy clustering algorithm was developed based on the conventional fuzzy c-means （FCM） to obtain better quality clustering results. The update equations for the membership and the cluster center are derived from the alternating optimization algorithm. Two fuzzy scattering matrices in the objective function assure the compactness between data points and cluster centers, and also strengthen the separation between cluster centers in terms of a novel separable criterion. The clustering algorithm properties are shown to be an improvement over the FCM method＇s properties. Numerical simulations show that the clustering algorithm gives more accurate clustering results than the FCM method.

Color Image Segmentation Using Feedforward Neural Networks with FCM

This paper proposes a hybrid technique for color image segmentation. First an input image is converted to the image of CIE L＊a＊b＊ color space. The color features ＂a＂ and ＂b＂ of CIE L^＊a^＊b^＊ are then fed into fuzzy C-means （FCM） clustering which is an unsupervised method. The labels obtained from the clustering method FCM are used as a target of the supervised feed forward neural network. The network is trained by the Levenberg-Marquardt back-propagation algorithm, and evaluates its performance using mean square error and regression analysis. The main issues of clustering methods are determining the number of clusters and cluster validity measures. This paper presents a method namely co-occurrence matrix based algorithm for finding the number of clusters and silhouette index values that are used for cluster validation. The proposed method is tested on various color images obtained from the Berkeley database. The segmentation results from the proposed method are validated and the classification accuracy is evaluated by the parameters sensitivity, specificity, and accuracy.

Recognition and localization system of the robot for harvesting Hangzhou White Chrysanthemums

To realize the robotic harvesting of Hangzhou White Chrysanthemums,the quick recognition and 3D vision localization system for target Chrysanthemums was investigated in this study.The system was comprised of three main stages.Firstly,an end-effector and a simple freedom manipulator with three degrees were designed to meet the quality requirements of harvesting Hangzhou White Chrysanthemums.Secondly,a segmentation based on HSV color space was performed.A fast Fuzzy C-means(FCM)algorithm based on S component was proposed to extract the target image from irrelevant background.Thirdly,binocular stereo vision was used to acquire the target spatial information.According to the shape of Hangzhou White Chrysanthemums,the centroids of stamens were selected as feature points to match in the right and left images.The experimental results showed that the proposed method was able to recognize Hangzhou White Chrysanthemums with the accuracy of 85%.When the distance between target and baseline was 150-450 mm,the errors between the calculated and measured distance were less than 14 mm,which could meet the requirements of the localization accuracy of the harvesting robot.

Magnetic Tile Surface Defect Detection Based on Texture Feature Clustering

In the field of magnetic tile surface detection, artificial detection efficiency is low, and the traditional image segmentation algorithm cannot show good performance when the gray scale of the magnetic tile itself is small, or the image is affected by uneven illumination. In view of these questions, this paper puts forward a new clustering segmentation algorithm based on texture feature. This algorithm uses Gabor function spectra to represent magnetic tile surface texture and then uses a user-defined local product coefficient to modify Gabor energy spectra to get the center number of fuzzy C-means(FCM) clustering. Moreover, the user-defined Gabor energy spectra image is segmented by clustering algorithm. Finally, it extracts the magnetic tile surface defects according to the changes of regional gray characteristics. Experiments show that the algorithm effectively overcomes the noise interference and makes a good performance on accuracy and robustness, which can effectively detect crack,damage, pit and other defects on the magnetic tile surface.

Personalized Emotion Space for Video Affective Content Representation

A personalized emotion space is proposed to bridge the ＂affective gap＂ in video affective content understanding. In order to unify the discrete and dimensional emotion model, fuzzy C-mean （FCM） clustering algorithm is adopted to divide the emotion space. Gaussian mixture model （GMM） is used to determine the membership functions of typical affective subspaces. At every step of modeling the space, the inputs rely completely on the affective experiences recorded by the audiences. The advantages of the improved V-A （Velance-Arousal） emotion model are the per- sonalization, the ability to define typical affective state areas in the V-A emotion space, and the convenience to explicitly express the intensity of each affective state. The experimental results validate the model and show it can be used as a personalized emotion space for video affective content representation.