Pattern recognition of manufacturing process signals using Gaussian mixture models-based recognition systems

Unnatural patterns exhibited in manufacturing processes can be associated with certain assignable causes for process variation. Hence, accurate identification of various process patterns (PPs) can significantly narrow down the scope of possible causes that must be investigated, and speed up the troubleshooting process. This paper proposes a Gaussian mixture models (GMM)-based PP recognition (PPR) model, which employs a collection of several GMMs trained for PPR. By using statistical features and wavelet energy features as the input features, the proposed PPR model provides more simple training procedure and better generalization performance than using single recognizer, and hence is easier to be used by quality engineers and operators. Furthermore, the proposed model is capable of adapting novel PPs through using a dynamic modeling scheme. The simulation results indicate that the GMM-based PPR model shows good detection and recognition of current PPs and adapts further novel PPs effectively. Analysis from this study provides guidelines in developing GMM – based SPC recognition systems.     

Exploring comprehensible classification rules from trained neural networks integrated with a time-varying binary particle swarm optimizer

Purpose

Extracting comprehensible classification rules is the most emphasized concept in data mining researches. In order to obtain accurate and comprehensible classification rules from databases, a new approach is proposed by combining advantages of artificial neural networks (ANN) and swarm intelligence.

Method

Artificial neural networks (ANNs) are a group of very powerful tools applied to prediction, classification and clustering in different domains. The main disadvantage of this general purpose tool is the difficulties in its interpretability and comprehensibility. In order to eliminate these disadvantages, a novel approach is developed to uncover and decode the information hidden in the black-box structure of ANNs. Therefore, in this paper a study on knowledge extraction from trained ANNs for classification problems is carried out. The proposed approach makes use of particle swarm optimization (PSO) algorithm to transform the behaviors of trained ANNs into accurate and comprehensible classification rules. Particle swarm optimization with time varying inertia weight and acceleration coefficients is designed to explore the best attribute-value combination via optimizing ANN output function.

Results

The weights hidden in trained ANNs turned into comprehensible classification rule set with higher testing accuracy rates compared to traditional rule based classifiers.     

基于PCA的XML文档特征提取方法

为了更好地对XML文档进行分类或聚类分析,以主成分分析的理论基础为指导,在研究了文本表示的各种模型的基础上,提出了两种对XML文档进行向量化表示并进行特征提取的方法,同时也实现了对XML文档的有效降维。实验结果表明,两种方法都能有效地表示XML文档的主体特征,但全路径特征向量抽取方法能更好地描述XML信息,为下一步有效处理XML文档做了良好铺垫,具有一定的研究价值。     

SIFT在行星表面探测器视觉导航系统中的应用

介绍了行星探测器自主导航系统的相关背景,讨论了行星探测器自主视觉导航系统算法的主要目的和传感器信息融合的必要性,并就此引入了尺度不变特征变换(SIFT)的相关理论分析.对SIFT方法提出了改进,从而改善了算法的效果.最后给出了三维重建和目标追踪的实验结果.     

Recognition and analysis of cell nuclear phases for high-content screening based on morphological features

Automated analysis of molecular images has increasingly become an important research in computational life science. In this paper some new and efficient algorithms for recognizing and analyzing cell phases of high-content screening are presented. The conceptual frameworks are based on the morphological features of cell nuclei. The useful preprocessing includes: smooth following and linearization; extraction of morphological structural points; shape recognition based morphological structure; issue of touching cells for cell separation and reconstruction. Furthermore, the novel detecting and analyzing strategies of feed-forward and feed-back of cell phases are proposed based on gray feature, cell shape, geometrical features and difference information of corresponding neighbor frames. Experiment results tested the efficiency of the new method.     

Fast Object Segmentation by Growing Minimal Paths from a Single Point on 2D or 3D Images

In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the minimal path approach. First, an initial point on the desired contour is chosen by the user. Next, new keypoints are detected automatically using a front propagation approach. We assume that the desired object has a closed boundary. This a-priori knowledge on the topology is used to devise a relevant criterion for stopping the keypoint detection and front propagation. The final domain visited by the front will yield a band surrounding the object of interest. Linking pairs of neighboring keypoints with minimal paths allows us to extract a closed contour from a 2D image. This approach can also be used for finding an open curve giving extra information as stopping criteria. Detection of a variety of objects on real images is demonstrated. Using a similar idea, we can extract networks of minimal paths from a 3D image called Geodesic Meshing. The proposed method is applied to 3D data with promising results.