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.     

Discrete data clustering using finite mixture models

Finite mixture models have been applied for different computer vision, image processing and pattern recognition tasks. The majority of the work done concerning finite mixture models has focused on mixtures for continuous data. However, many applications involve and generate discrete data for which discrete mixtures are better suited. In this paper, we investigate the problem of discrete data modeling using finite mixture models. We propose a novel, well motivated mixture that we call the multinomial generalized Dirichlet mixture. The novel model is compared with other discrete mixtures. We designed experiments involving spatial color image databases modeling and summarization, and text classification to show the robustness, flexibility and merits of our approach.     

A new feature selection method for Gaussian mixture clustering

With the wide applications of Gaussian mixture clustering, e.g., in semantic video classification [H. Luo, J. Fan, J. Xiao, X. Zhu, Semantic principal video shot classification via mixture Gaussian, in: Proceedings of the 2003 International Conference on Multimedia and Expo, vol. 2, 2003, pp. 189-192], it is a nontrivial task to select the useful features in Gaussian mixture clustering without class labels. This paper, therefore, proposes a new feature selection method, through which not only the most relevant features are identified, but the redundant features are also eliminated so that the smallest relevant feature subset can be found. We integrate this method with our recently proposed Gaussian mixture clustering approach, namely rival penalized expectation-maximization (RPEM) algorithm [Y.M. Cheung, A rival penalized EM algorithm towards maximizing weighted likelihood for density mixture clustering with automatic model selection, in: Proceedings of the 17th International Conference on Pattern Recognition, 2004, pp. 633-636; Y.M. Cheung, Maximum weighted likelihood via rival penalized EM for density mixture clustering with automatic model selection, IEEE Trans. Knowl. Data Eng. 17(6) (2005) 750-761], which is able to determine the number of components (i.e., the model order selection) in a Gaussian mixture automatically. Subsequently, the data clustering, model selection, and the feature selection are all performed in a single learning process. Experimental results have shown the efficacy of the proposed approach.     

On the use of small training sets for neural network-based characterization of mixed pixels in remotely sensed hyperspectral images

In this work, neural network-based models involved in hyperspectral image spectra separation are considered. Focus is on how to select the most highly informative samples for effectively training the neural architecture. This issue is addressed here by several new algorithms for intelligent selection of training samples: (1) a border-training algorithm (BTA) which selects training samples located in the vicinity of the hyperplanes that can optimally separate the classes; (2) a mixed-signature algorithm (MSA) which selects the most spectrally mixed pixels in the hyperspectral data as training samples; and (3) a morphological-erosion algorithm (MEA) which incorporates spatial information (via mathematical morphology concepts) to select spectrally mixed training samples located in spatially homogeneous regions. These algorithms, along with other standard techniques based on orthogonal projections and a simple Maximin-distance algorithm, are used to train a multi-layer perceptron (MLP), selected in this work as a representative neural architecture for spectral mixture analysis. Experimental results are provided using both a database of nonlinear mixed spectra with absolute ground truth and a set of real hyperspectral images, collected at different altitudes by the digital airborne imaging spectrometer (DAIS 7915) and reflective optics system imaging spectrometer (ROSIS) operating simultaneously at multiple spatial resolutions.     

基于色度坐标高斯混合模型的步态检测

针对传统的基于RGB通道的高斯混合模型低对比度像素点检测效果较差的问题,提出一种基于色度坐标的高斯混合模型,使之更好地用于步态检测。该算法将RGB色彩值转换到色度坐标上,以强调色彩对比度,提高低对比度像素点的检测率,并增加亮度信息以减小阴影的影响,在前景提取部分,加入噪声抑制机制。实验结果表明,改进后的算法在相同对比度下,误检测率最多可减小一半。     

基于多种视频特征的镜头边界检测算法

针对固定场景的视频,提出一种基于时空分割的视频分割算法.该算法在时域中利用Tophat形态学滤波得到视频对象的精确位置,在空域中采用基于t混合模型和贪婪EM的聚类算法进行单帧图像分割.将时域定位和空域分割结果结合,可以准确地将视频序列中感兴趣的运动目标分割出来.实验表明,该算法能够得到完整的视频对象,有一定的理论意义和实用性.     

Texture segmentation using independent-scale component-wise Riemannian-covariance Gaussian mixture model in KL measure based multi-scale nonlinear structure tensor space

This paper proposes a novel texture segmentation approach using independent-scale component-wise Riemannian-covariance Gaussian mixture model (ICRGMM) in Kullback-Leibler (KL) measure based multi-scale nonlinear structure tensor (MSNST) space. We use the independent-scale distribution and full-covariance structure to replace the covariant-scale distribution and 1D-variance structure used in our previous research. To construct the optimal full-covariance structure, we define the full-covariance on KL, Euclidean, log-Euclidean, and Riemannian gradient mappings, and compare their performances. The comparison experiments demonstrate that the Riemannian gradient mapping leads to its optimum properties over other choices when constructing the full-covariance. To estimate and update the statistical parameters more accurately, the component-wise expectation-maximization for mixtures (CEM²) algorithm is proposed instead of the originally used K-means algorithm. The superiority of the proposed ICRGMM has been demonstrated based on texture clustering and Graph Cuts based texture segmentation using a large number of synthesis texture images and real natural scene textured images, and further analyzed in terms of error ratio and modified F-measure, respectively.     

Bayesian analysis of robust Poisson geometric process model using heavy-tailed distributions

We propose a robust Poisson geometric process model with heavy-tailed distributions to cope with the problem of outliers as it may lead to an overestimation of mean and variance resulting in inaccurate interpretations of the situations. Two heavy-tailed distributions namely Student’s t and exponential power distributions with different tailednesses and kurtoses are used and they are represented in scale mixture of normal and scale mixture of uniform respectively. The proposed model is capable of describing the trend and meanwhile the mixing parameters in the scale mixture representations can detect the outlying observations. Simulations and real data analysis are performed to investigate the properties of the models.     

一种基于场景区分算法的背景抽取方法

视频监控面对的场景具有静态的成分和缓变的成分.为了从视频流中稳定地抽取较精确的背景,提出了一种基于场景区分的背景抽取算法.首先通过混合高斯模型对视频序列中稳定的成分进行建模,然后采用Kalman滤波模型对视频序列中变化的成分进行建模,最后采用场景的区分算法将2种模型结果进行处理从而得到背景.实验结果表明:该方法能从视频...