用于彩色图像分割的改进遗传FCM算法

本文提出了一种适用于彩色图像分割的遗传模糊C均值聚类(GAFCM)算法.该算法使用Ohta等人提出的彩色特征集中的第一个分量作为图像像素的一维特征向量,并利用由像素空间到特征空间的映射来改进目标函数,从而大大降低了运算量;使用对特征空间结构没有特殊要求的特征距离代替欧氏距离,从而克服了特征空间结构对聚类结果的影响;使用引入FCM优化的遗传算法来搜索最优解,从而提高了搜索速度.实验表明,该算法不但能很好地分割彩色图像,而且具有运算量小、收敛速度快的优点.     

Domain decomposition approach to flexible multibody dynamics simulation

Finite element based formulations for flexible multibody systems are becoming increasingly popular and as the complexity of the configurations to be treated increases, so does the computational cost. It seems natural to investigate the applicability of parallel processing to this type of problems; domain decomposition techniques have been used extensively for this purpose. In this approach, the computational domain is divided into non-overlapping sub-domains, and the continuity of the displacement field across sub-domain boundaries is enforced via the Lagrange multiplier technique. In the finite element literature, this approach is presented as a mathematical algorithm that enables parallel processing. In this paper, the divided system is viewed as a flexible multibody system, and the sub-domains are connected by kinematic constraints. Consequently, all the techniques applicable to the enforcement of constraints in multibody systems become applicable to the present problem. In particular, it is shown that a combination of the localized Lagrange multiplier technique with the augmented Lagrange formulation leads to interesting solution strategies. The proposed algorithm is compared with the well-known FETI approach with regards to convergence and efficiency characteristics. The present algorithm is relatively simple and leads to improved convergence and efficiency characteristics. Finally, implementation on a parallel computer was conducted for the proposed approach.     

Accelerating global optimization of aerodynamic shapes using a new surrogate-assisted parallel genetic algorithm

An efficient strategy is presented for global shape optimization of wing sections with a parallel genetic algorithm. Several computational techniques are applied to increase the convergence rate and the efficiency of the method. A variable fidelity computational evaluation method is applied in which the expensive Navier–Stokes flow solver is complemented by an inexpensive multi-layer perceptron neural network for the objective function evaluations. A population dispersion method that consists of two phases, of exploration and refinement, is developed to improve the convergence rate and the robustness of the genetic algorithm. Owing to the nature of the optimization problem, a parallel framework based on the master/slave approach is used. The outcomes indicate that the method is able to find the global optimum with significantly lower computational time in comparison to the conventional genetic algorithm.     

Tumor detection in T1, T2, FLAIR and MPR brain images using a combination of optimization and fuzzy clustering improved by seed‐based region growing algorithm

Tumor and Edema region present in Magnetic Resonance (MR) brain image can be segmented using Optimization and Clustering merged with seed‐based region growing algorithm. The proposed algorithm shows effectiveness in tumor detection in T1 ‐ w, T2 – w, Fluid Attenuated Inversion Recovery and Multiplanar Reconstruction type MR brain images. After an initial level segmentation exhibited by Modified Particle Swarm Optimization (MPSO) and Fuzzy C – Means (FCM) algorithm, the seed points are initialized using the region growing algorithm and based on these seed points; tumor detection in MR brain images is done. The parameters taken for comparison with the conventional techniques are Mean Square Error, Peak Signal to Noise Ratio, Jaccard (Tanimoto) index, Dice Overlap indices and Computational Time. These parameters prove the efficacy of the proposed algorithm. Heterogeneous type tumor regions present in the input MR brain images are segmented using the proposed algorithm. Furthermore, the algorithm shows augmentation in the process of brain tumor identification. Availability of gold standard images has led to the comparison of the suggested algorithm with MPSO‐based FCM and conventional Region Growing algorithm. Also, the algorithm recommended through this research is capable of producing Similarity Index value of 0.96, Overlap Fraction value of 0.97 and Extra Fraction value of 0.05, which are far better than the values articulated by MPSO‐based FCM and Region Growing algorithm. The proposed algorithm favors the segmentation of contrast enhanced images. © 2017 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 27, 33–45, 2017     

Adaptive modelling and long-range prediction of mobile fading channels

A key element for many fading-compensation techniques is a (long-range) prediction tool for the fading channel. A linear approach, usually used to model the time evolution of the fading process, does not perform well for long-range prediction applications. An adaptive fading channel prediction algorithm using a sum-sinusoidalbased state-space approach is proposed. This algorithm utilises an improved adaptive Kalman estimator, comprising an acquisition mode and a tracking algorithm. Furthermore, for the sake of a lower computational complexity, an enhanced linear predictor for channel fading is proposed, including a multi-step AR predictor and the respective tracking algorithm. Comparing the two methods in our simulations show that the proposed Kalman-based algorithm can significantly outperform the linear method, for both stationary and nonstationary fading processes, and especially for long-range predictions. The performance and the self-recovering structure, as well as the reasonable computational complexity, makes the algorithm appealing for practical applications.     

量子蚁群模糊聚类算法在图像分割中的应用

针对模糊C-均值算法对初始值的依赖,容易陷入局部最优值的缺点,本文提出将量子蚁群算法与FCM聚类算法结合,首先利用量子蚁群算法的全局性和鲁棒性以及快速收敛的优点确定图像的初始聚类中心和聚类个数,再将所得结果作为FCM聚类算法的初始参数,然后用FCM聚类算法对医学图像进行分割。实验结果表明,该方法有效解决了FCM算法对初始参数的依赖,克服了FCM算法及蚁群算法容易陷入局部极值的的缺点,而且在分割速度和精度上得到了较大提高。     

Normalized explicit approximate inverse preconditioning for solving 3D boundary value problems on uniprocessor and distributed systems

Normalized explicit approximate inverse matrix techniques, based on normalized approximate factorization procedures, for solving sparse linear systems resulting from the finite difference discretization of partial differential equations in three space variables are introduced. Normalized explicit preconditioned conjugate gradient schemes in conjunction with normalized approximate inverse matrix techniques are presented for solving sparse linear systems. The convergence analysis with theoretical estimates on the rate of convergence and computational complexity of the normalized explicit preconditioned conjugate gradient method are also derived. A Parallel Normalized Explicit Preconditioned Conjugate Gradient method for distributed memory systems, using message passing interface (MPI) communication library, is also given along with theoretical estimates on speedups, efficiency and computational complexity. Application of the proposed method on a three‐dimensional boundary value problem is discussed and numerical results are given for uniprocessor and multicomputer systems. Copyright © 2005 John Wiley & Sons, Ltd.     

Performance enhanced PSO-based modified Kohonen neural network for retinal image classification

Image classification is one of the significant applications in the field of ophthalmology for abnormality detection in retinal images. Image classification is a pattern recognition technique in which abnormal retinal images are categorized into different groups based on similarity measures. Accuracy and convergence rate are the important parameters of this automated diagnostic system. Artificial neural networks (ANNs) are widely used for automated image analysis systems. Kohonen neural networks (KNNs) are one of the prime unsupervised ANNs suitable for image processing applications. Besides the numerous advantages, KNNs suffer from two drawbacks: (a) lack of standard convergence conditions and (b) less accurate results. In this study, a novel approach is adopted to eliminate these disadvantages by performing suitable modifications in the conventional KNN. Initially, the fuzzy approach is an integrated one within KNN in the training algorithm to overcome the convergence difficulties. Second, a particle swarm optimization algorithm is used in feature selection for better accuracy. This proposed approach is tested on four different abnormal retinal image categories. The system is analyzed using several performance measures and the experimental results suggest promising results for the proposed system. Comparative analyses with other systems are also presented to show the superior nature of the proposed system.     

基于空间邻域信息的二维模糊聚类图像分割

传统模糊C均值聚类(FCM)算法进行图像分割时仅利用了像素的灰度信息,并且使用对噪声较敏感的欧氏距离作为像素与聚类中心距离度量的标准,因此抗噪性能较差.为了克服传统FCM算法的局限性,本文提出了一种基于空间邻域信息的二维模糊聚类图像分割方法(2DFCM).该方法利用二维直方图描述的像素邻域关系属性,一方面为聚类提供较准确的初始聚类中心,从而避免聚类中的死点问题;另一方面通过提出聚类中心同时在像素值、像素邻域值二维方向上进行更新的思想,建立了包含邻域信息的新的聚类目标函数,实现了图像的分割.实验结果表明,这种方法抗噪能力强、收敛速度快,是一种有效的模糊聚类图像分割方法.     

An improved fuzzy clustering method for cellular manufacturing

Fuzzy c-means (FCM) has been successfully adapted to solve the manufacturing cell formation problem. However, when the problem becomes larger and especially if the data is ill structured, the FCM may result in clustering errors, infeasible solutions, and uneven distribution of parts/machines. In this paper, an improved fuzzy clustering algorithm is proposed to overcome the deficiencies of FCM. We tested the effects of algorithm parameters and compared its performance with the original and two popular FCM modifications. Our study shows that the proposed approach outperformed other alternatives. Most of the solutions it obtained are close to and in some cases better than the control solutions.     

Optimizing the intermodal transportation of emergency medical supplies using balanced fuzzy clustering

In this paper, we are concerned with the problem of the ‘helicopters and vehicles’ intermodal transportation of medical supplies in response to large-scale disasters. To deal with the disadvantages of the use of classic Fuzzy C-Means (FCM) in the intermodal transportation optimization, two balanced FCM methods, i.e. FCM with capacity constraints and FCM with number constraints, are formulated to select emergency distribution centers (EDCs) and assign medical aid points, which could construct balanced ‘helicopters and vehicles’ intermodal transportation network. Then, considering helicopter travel time, transfer time and vehicle delivery time, a clustering-based intermodal routes optimization model is presented to produce intermodal transportation routes. Numerical experiments are presented to show the effectiveness and advantage of the developed approach, and observe the impact of number of EDCs and transfer efficiency at EDCs on the performance of intermodal transportation. This paper could provide methodological and operational supports for the ‘helicopters and vehicles’ intermodal transportation of medical supplies in response to large-scale disasters.     

The hp‐d‐adaptive finite cell method for geometrically nonlinear problems of solid mechanics

The finite cell method (FCM) combines the fictitious domain approach with the p‐version of the finite element method and adaptive integration. For problems of linear elasticity, it offers high convergence rates and simple mesh generation, irrespective of the geometric complexity involved. This article presents the integration of the FCM into the framework of nonlinear finite element technology. However, the penalty parameter of the fictitious domain is restricted to a few orders of magnitude in order to maintain local uniqueness of the deformation map. As a consequence of the weak penalization, nonlinear strain measures provoke excessive stress oscillations in the cells cut by geometric boundaries, leading to a low algebraic rate of convergence. Therefore, the FCM approach is complemented by a local overlay of linear hierarchical basis functions in the sense of the hp‐d method, which synergetically uses the h‐adaptivity of the integration scheme. Numerical experiments show that the hp‐d overlay effectively reduces oscillations and permits stronger penalization of the fictitious domain by stabilizing the deformation map. The hp‐d‐adaptive FCM is thus able to restore high convergence rates for the geometrically nonlinear case, while preserving the easy meshing property of the original FCM. Accuracy and performance of the present scheme are demonstrated by several benchmark problems in one, two, and three dimensions and the nonlinear simulation of a complex foam sample. Copyright © 2011 John Wiley & Sons, Ltd.     

Resource Allocation and Power Control Policy for Device-toDevice Communication Using Multi-Agent Reinforcement Learning

Device-to-Device (D2D) communication is a promising technology that can reduce the burden on cellular networks while increasing network capacity. In this paper, we focus on the channel resource allocation and power control to improve the system resource utilization and network throughput. Firstly, we treat each D2D pair as an independent agent. Each agent makes decisions based on the local channel states information observed by itself. The multi-agent Reinforcement Learning (RL) algorithm is proposed for our multi-user system. We assume that the D2D pair do not possess any information on the availability and quality of the resource block to be selected, so the problem is modeled as a stochastic non-cooperative game. Hence, each agent becomes a player and they make decisions together to achieve global optimization. Thereby, the multi-agent Q-learning algorithm based on game theory is established. Secondly, in order to accelerate the convergence rate of multi-agent Q-learning, we consider a power allocation strategy based on Fuzzy Cmeans (FCM) algorithm. The strategy firstly groups the D2D users by FCM, and treats each group as an agent, and then performs multi-agent Q-learning algorithm to determine the power for each group of D2D users. The simulation results show that the Q-learning algorithm based on multi-agent can improve the throughput of the system. In particular, FCM can greatly speed up the convergence of the multi-agent Q-learning algorithm while improving system throughput.     

Generating Type 2 Trapezoidal Fuzzy Membership Function Using Genetic Tuning

Fuzzy inference system (FIS) is a process of fuzzy logic reasoning to produce the output based on fuzzified inputs. The system starts with identifying input from data, applying the fuzziness to input using membership functions (MF), generating fuzzy rules for the fuzzy sets and obtaining the output. There are several types of input MFs which can be introduced in FIS, commonly chosen based on the type of real data, sensitivity of certain rule implied and computational limits. This paper focuses on the construction of interval type 2 (IT2) trapezoidal shape MF from fuzzy C Means (FCM) that is used for fuzzification process of mamdani FIS. In the process, upper MF (UMF) and lower MF (LMF) of the MF need to be identified to get the range of the footprint of uncertainty (FOU). This paper proposes Genetic tuning process, which is a part of genetic algorithm (GA), to adjust parameters in order to improve the behavior of existing system, especially to enhance the accuracy of the system model. This novel process is a hybrid approach which produces Genetic Fuzzy System (GFS) that helps to enhance fuzzy classification problems and performance. The approach provides a new method for the construction and tuning process of the IT2 MF, based on the FCM outcomes. The result is compared to Gaussian shape IT2 MF and trapezoid IT2 MF generated by the classic GA method. It is shown that the proposed approach is able to outperform the mentioned benchmarked approaches. The work implies a wider range of IT2 MF types, constructed based on FCM outcomes, and an optimum generation of the FOU so that it can be implemented in practical applications such as prediction, analytics and rule-based solutions.     

Bilateral filtering for structural topology optimization

Filtering has been a major approach used in the homogenization‐based methods for structural topology optimization to suppress the checkerboard pattern and relieve the numerical instabilities. In this paper a bilateral filtering technique originally developed in image processing is presented as an efficient approach to regularizing the topology optimization problem. A non‐linear bilateral filtering process leads to a suitable problem regularization to eliminate the checkerboard instability, pronounced edge preserving smoothing characteristics to favour the 0–1 convergence of the mass distribution, and computational efficiency due to its single pass and non‐iterative nature. Thus, we show that the application of the bilateral filtering brings more desirable effects of checkerboard‐free, mesh independence, crisp boundary, computational efficiency and conceptual simplicity. The proposed bilateral technique has a close relationship with the conventional domain filtering and range filtering. The proposed method is implemented in the framework of a power‐law approach based on the optimality criteria and illustrated with 2D examples of minimum compliance design that has been extensively studied in the recent literature of topology optimization and its efficiency and accuracy are highlighted. Copyright © 2005 John Wiley & Sons, Ltd.     

基于粒子群优化聚类的汽轮机组振动故障诊断

针对模糊C-均值聚类算法(FCM)容易陷入局部极值和对初始值敏感的不足,提出了一种新的模糊聚类算法(PFCM),新算法利用粒子群优化算法(PSO)全局寻优、快速收敛的特点,代替了FCM算法的基于梯度下降的迭代过程,使算法具有很强的全局搜索能力,很大程度上避免了FCM算法易陷入局部极值的缺陷,同时也降低了FCM算法对初始值的敏感度。将该算法应用于汽轮机组振动故障诊断中,与电厂运行实际故障状态对照,仿真结果表明该算法提高了故障诊断的正确率。为汽轮机振动故障诊断方法的研究提供了一种新的思路。     

A novel brain image segmentation using intuitionistic fuzzy C means algorithm

A process of splitting the image into pixel bands is the image segmentation. As medical imaging contain uncertainties, there are difficulties in classification of images into homogeneous regions. There is a need for segmentation algorithm for removing the noise from the medical image segmentation. The very popular algorithm is Fuzzy C‐Means (FCM) algorithm used for image segmentation. Fuzzy sets, rough sets, and the combination of fuzzy and rough sets play a prominent role in formalizing uncertainty, vagueness, and incompleteness in diagnosis. But it will use intensity values only which will be highly sensitive to noise. In this article, an Intuitionistic FCM (IFCM) algorithm is presented for clustering. Intuitionistic fuzzy (IF) sets are generalized sets and their elements are characterized by a membership value as well as nonmembership value. This IFCM has an uncertainty parameter which is called hesitation degree and a new objective function is integrated in the standard FCM based on IF entropy. The IFCM will provide better performance than FCM for image segmentation.     

基于模糊聚类的光电经纬仪多子弹弹道测量

本文对密集多子弹在空间坐标系中的左右相机弹点分布识别提出了一种新的方法。在各帧拍摄所得多子弹成像点中,提取子弹的形心坐标,根据子弹运动特点建立状态方程和测量方程,利用Kalman算法进行滤波。利用模糊c-均值聚类算法确定测量与弹丸轨迹的关联程度,从而实现弹道识别。仿真实验结果说明,该方法能有效地进行多子弹的弹道识别跟踪,并且算法简单、计算量小、易于工程实现。     

Unsupervised tissue classification of brain MR images for voxel‐based morphometry analysis

In this article, a fully unsupervised method for brain tissue segmentation of T1‐weighted MRI 3D volumes is proposed. The method uses the Fuzzy C‐Means (FCM) clustering algorithm and a Fully Connected Cascade Neural Network (FCCNN) classifier. Traditional manual segmentation methods require neuro‐radiological expertise and significant time while semiautomatic methods depend on parameter's setup and trial‐and‐error methodologies that may lead to high intraoperator/interoperator variability. The proposed method selects the most useful MRI data according to FCM fuzziness values and trains the FCCNN to learn to classify brain’ tissues into White Matter, Gray Matter, and Cerebro‐Spinal Fluid in an unsupervised way. The method has been tested on the IBSR dataset, on the BrainWeb Phantom, on the BrainWeb SBD dataset, and on the real dataset “University of Palermo Policlinico Hospital” (UPPH), Italy. Sensitivity, Specificity, Dice and F‐Factor scores have been calculated on the IBSR and BrainWeb datasets segmented using the proposed method, the FCM algorithm, and two state‐of‐the‐art brain segmentation software packages (FSL and SPM) to prove the effectiveness of the proposed approach. A qualitative evaluation involving a group of five expert radiologists has been performed segmenting the real dataset using the proposed approach and the comparison algorithms. Finally, a usability analysis on the proposed method and reference methods has been carried out from the same group of expert radiologists. The achieved results show that the segmentations of the proposed method are comparable or better than the reference methods with a better usability and degree of acceptance.     

Enhanced brain image retrieval using carrier frequency offset compensated orthogonal frequency division multiplexing for telemedicine applications

Wireless technology plays a vital role in the Electronic health (e‐health) applications such as telemedicine and remote patient monitoring. One of the major challenges of telemedicine applications is ensuring adequate quality of service and realizing precise diagnosis. Telemedicine employs image fusion to enhance the quality of medical image for better diagnosis. However, the transmission of medical image needs high data rate and bandwidth. Due to the robustness to multipath fading, high data rate transmission capability, high flexibility, high bandwidth efficiency, and easy implementation using fast Fourier transform, an orthogonal frequency division multiplexing (OFDM) is the suitable technique for medical image transmission in telemedicine applications This paper is focused on improving the quality of the fused brain image transmission over OFDM based telemedicine service using comb type pilot based carrier frequency offset compensation. The simulation results show that the proposed method offers better performance in terms of mean squared error, Euclidean distance, peak signal to noise ratio, bit error rate, carrier to interference ratio, and computational complexity.