Pattern recognition using boundary data of component distributions

In statistical pattern recognition, a Gaussian mixture model is sometimes used for representing the distribution of vectors. The parameters of the Gaussian mixture model are usually estimated from given sample data by the expectation maximization algorithm. However, when the number of data attributes is large, the parameters cannot be estimated correctly. In this paper, we propose a novel approach for estimating the parameters of the Gaussian mixture model by using sample data located on the boundary of regions defined by the component density functions. Experiments are carried out to show the characteristics of the proposed method.     

Pattern recognition approach to identify natural clusters of acoustic emission signals

A new approach is introduced to identify natural clusters of acoustic emission signals. The presented technique is based on an exhaustive screening taking into account all combinations of signal features extracted from the recorded acoustic emission signals. For each possible combination of signal features an investigation of the classification performance of the k-means algorithm is evaluated ranging from two to ten classes. The numerical degree of cluster separation of each partition is calculated utilizing the Davies-Bouldin and Tou indices, Rousseeuw’s silhouette validation method and Hubert’s Gamma statistics. The individual rating of each cluster validation technique is cumulated based on a voting scheme and is evaluated for the number of clusters with best performance. This is defined as the best partitioning for the given signal feature combination. As a second step the numerical ranking of all these partitions is evaluated for the globally optimal partition in a second voting scheme using the cluster validation methods results. This methodology can be used as an automated evaluation of the number of natural clusters and their partitions without previous knowledge about the cluster structure of acoustic emission signals. The suitability of the current approach was evaluated using artificial datasets with defined degree of separation. In addition the application of the approach to clustering of acoustic emission signals is demonstrated for signals obtained from failure during loading of carbon fiber reinforced plastic specimens.     

Type-2 fuzzy Gaussian mixture models

This paper presents a new extension of Gaussian mixture models (GMMs) based on type-2 fuzzy sets (T2 FSs) referred to as T2 FGMMs. The estimated parameters of the GMM may not accurately reflect the underlying distributions of the observations because of insufficient and noisy data in real-world problems. By three-dimensional membership functions of T2 FSs, T2 FGMMs use footprint of uncertainty (FOU) as well as interval secondary membership functions to handle GMMs uncertain mean vector or uncertain covariance matrix, and thus GMMs parameters vary anywhere in an interval with uniform possibilities. As a result, the likelihood of the T2 FGMM becomes an interval rather than a precise real number to account for GMMs uncertainty. These interval likelihoods are then processed by the generalized linear model (GLM) for classification decision-making. In this paper we focus on the role of the FOU in pattern classification. Multi-category classification on different data sets from UCI repository shows that T2 FGMMs are consistently as good as or better than GMMs in case of insufficient training data, and are also insensitive to different areas of the FOU. Based on T2 FGMMs, we extend hidden Markov models (HMMs) to type-2 fuzzy HMMs (T2 FHMMs). Phoneme classification in the babble noise shows that T2 FHMMs outperform classical HMMs in terms of the robustness and classification rate. We also find that the larger area of the FOU in T2 FHMMs with uncertain mean vectors performs better in classification when the signal-to-noise ratio is lower.     

空间约束混合高斯运动目标检测

目的 针对传统混合高斯模型前景检测运算量过大问题,提出一种基于空间约束的混合高斯前景检测算法。方法 通过快速初始化缩短模型的初始建立过程;采用双重背景模型机制,以自适应背景减法的前景检测结果作为混合高斯前景检测的空间约束条件,降低模型在背景区域的冗余运算;运用多策略自适应模型更新,提高前景检测的准确性。结果 在各种测试场景下,与传统混合高斯法、CodeBook、GMG、偏差均值混合高斯模型(MODGMM)等算法相比,该算法具有更好的准确率以及4倍以上的处理速度。结论 在固定相机场景下的运动目标检测中,算法能有效提高传统混合高斯法的准确性且具有极高的实时性。     

Multiple-step-ahead prediction in control systems with Gaussian process models and TS-fuzzy models

In this paper one-step-ahead and multiple-step-ahead predictions of time series in disturbed open loop and closed loop systems using Gaussian process models and TS-fuzzy models are described. Gaussian process models are based on the Bayesian framework where the conditional distribution of output measurements is used for the prediction of the system outputs. For one-step-ahead prediction a local process model with a small past horizon is built online with the help of Gaussian processes. Multiple-step-ahead prediction requires the knowledge of previous outputs and control values as well as the future control values. A “naive” multiple-step-ahead prediction is a successive one-step-ahead prediction where the outputs in each consecutive step are used as inputs for the next step of prediction. A global TS-fuzzy model is built to generate the nominal future control trajectory for multiple-step-ahead prediction. In the presence of model uncertainties a correction of the so computed control trajectory is needed. This is done by an internal feedback between the two process models. The method is tested on disturbed time invariant and time variant systems for different past horizons. The combination of the TS-fuzzy model and the Gaussian process model together with a correction of the control trajectory shows a good performance of the multiple-step-ahead prediction for systems with uncertainties.     

The Supervised Learning Gaussian Mixture Model

The traditional Gaussian Mixture Model(GMM)for pattern recognition is an unsupervised learning method.The parameters in the model are derived only by the training samples in one class without taking into account the effect of sample distributions of other classes,hence,its recognition accuracy is not ideal sometimes.This paper introduces an approach for estimating the parameters in GMM in a supervising way.The Supervised Learning Gaussian Mixture Model(SLGMM)improves the recognition accuracy of the GMM.An experimental example has shown its effectiveness.The experimental results have shown that the recognition accuracy derived by the approach is higher than those obtained by the Vector Quantization(VQ)approach,the Radial Basis Function (RBF) network model,the Learning Vector Quantization (LVQ) approach and the GMM.In addition,the training time of the approach is less than that of Multilayer Perceptrom(MLP).     

Simultaneous feature selection and Gaussian mixture model estimation for supervised classification problems

A new expectation maximization (EM) algorithm for time-critical supervised classification tasks in remote sensing is proposed. Compared to standard EM and other approaches, it has the following advantages: (1) No knowledge about the class distributions is needed. (2) The number of components is estimated. (3) It does not require careful initialization. (4) Singular estimates are avoided due to the ability of pruning components. (5) The best discriminating features are identified simultaneously. (6) The features are identified by incorporating Mahalanobis distances.     

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.     

Combination of wavelet and SIFT features for image classification using trained Gaussian mixture model

This paper presents an effective combination of Wavelet-based features and SIFT features. For the combined feature patches extracted from images we then adopt the PCA transformation to reduce the dimensionality of their feature vectors. And the reduced vectors are used to train Gaussian Mixture Models （GMMs） in which the mixture weights and Gaussian parameters are updated iteratively. We performed the method on Caltech datasets and compared the results with several other methods. It shown that the combination of salient feature vectors and GMM gives a much better improvement in image classification.     

Speaker identification using hybrid Karhunen-Loeve transform and Gaussian mixture model approach

This paper proposes a classification scheme that incorporates Karhunen-Loeve transform (KLT) and Gaussian mixture model (GMM) for text-independent speaker identification. Our results show that the combination is beneficial to both classification accuracy and computational cost. For a database with 500 Mandarin speakers, it is demonstrated that accuracy improvement of up to 4% and computational cost saving of 10 times compared to those of the conventional GMM model can be achieved.     

基于FPGA的混合高斯背景建模实现

为了解决PC机上高清视频运动目标检测的实时性瓶颈问题,设计了一种基于FPGA的运动目标检测系统.系统采用基于自适应混合高斯背景模型的背景差分法,对环境扰动具有很好的适应性.本设计应用于1 280×1 024高清视频的运动目标检测,针对硬件实现的特点,对OpenCV混合高斯背景模型算法进行改进和适当的参数定点化,设计了适...     

An MLP-orthogonal Gaussian mixture model hybrid model for Chinese bank check printed numeral recognition

A hybrid model based on the combination of an orthogonal Gaussian mixture model (OGMM) and a multilayer perceptron (MLP) is proposed in this paper that is to be used for Chinese bank check machine printed numeral recognition. The combination of MLP with OGMM produces a hybrid model with high recognition accuracy as well as an excellent outlier rejection ability. Experimental results show that the proposed model can satisfy the requirements of Chinese bank check printed numeral recognition where high recognition accuracy, high processing speed, and high reliability are needed. Correspondence to: Hui Zhu     

混合高斯模型的自适应前景提取

复杂场景下的运动前景提取是计算机视觉研究领域的研究重点。为解决复杂场景中的前景目标提取问题,本文提出一种应用于复杂变化场景中的基于混合高斯模型的自适应前景提取方法。本方法可以对视频帧中每个像素的高斯分布数进行动态控制,并且通过在线EM算法对高斯分布的各参数进行学习,此外每个像素的权值更新速率可根据策略进行调整。实验结果表明本方法对复杂变化场景具有较好的适应性,可有效、快速地提取前景目标,提取结果具有较好的查准率和查全率。     

一种新的基于高斯混合模型的线性判别分析

Fisher准则函数的前提条件就是假设每类样本数据满足单峰高斯分布,即各类样本在模式空间的分布近似椭球状,但是当训练样本数据较多且呈多峰分布时,传统的Fisher准则函数并不能准确反映样本数据的分布,显然基于Fisher准则函数的线性判别分析得到的最优判别矢量集也不是最优的。针对这种情况,通过引入高斯混合模型的概念,提出了一种新的基于高斯混合模型的线性判别分析方法,同时也给出了在该模型下的最优判别矢量集的直接求解方法,并通过实验证明了该算法的有效性。     

融合高斯混合模型和小波变换的运动目标检测

当前景目标与背景在颜色上接近时,仅采用高斯混合模型进行目标检测容易导致误判。为了提高模型分割算法的鲁棒性,提出一种融合高斯混合模型和小波变换的运动目标检测算法。通过小波变换提取图像的纹理特征信息,利用高斯混合模型拟合背景信息。将两者融合起来,把纹理信息作为颜色信息的补偿,保证了模型在线更新背景信息时模型的稳定性和收敛性,同时弥补了目标分割中前景与背景颜色信息接近时容易导致误判的不足。实验结果表明,本文方法比经典高斯混合模型方法具有较高的分割精度。     

高斯混合模型、求解算法及视觉应用综述

高斯混合模型(GMMs)是统计学习理论的基本模型,在可视媒体领域应用广泛。近些年来,随着可视媒体信息的增长和分析技术的深入,GMMs在(纹理)图像分割、视频分析、图像配准、聚类等领域有了进一步的发展。从GMMs的基本模型出发,从理论和应用的角度讨论和分析了GMMs的求解算法,包括EM算法、变化形式等,论述了GMMs的模型选择问题:在线学习和模型约简。在视觉应用领域,介绍了GMMs在图像分段、视频分析、图像配准、图像降噪等领域的扩展模型与方法,详细地阐述了一些最新的典型模型的原理与过程,如用于图像分段的空间约束GMMs、图像配准中的关联点漂移算法。最后,讨论了一些潜在的发展方向与存在的困难问题。     

Pattern recognition using Markov random field models

In this paper, we propose Markov random field models for pattern recognition, which provide a flexible and natural framework for modelling the interactions between spatially related random variables in their neighbourhood systems. The proposed approach is superior to conventional approaches in many aspects. This paper introduces the concept of states into Markov random filed models, presents a theoretic analysis of the approach, discusses issues of designing neighbourhood system and cliques, and analyses properties of the models. We have applied our method to the recognition of unconstrained handwritten numerals. The experimental results show that the proposed approach can achieve high performance.