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.     

基于分水岭变换和图割的彩色图像快速分割

基于图割理论的图像分割具有结合多种知识的统一图像分割框架,可获取全局最优解,但海量的像素级处理单元以及为达到一定分割精度而采用的迭代求解模式,导致算法分割效率不高。以GrabCut算法为基础,通过分水岭变换,将图像划分成区域内颜色相似的若干分块,以各个块内像素的RGB均值代表所在分块的全部像素点来估计高斯混合模型参数,使问题规模减小,算法效率得到提高。     

求解昂贵区间多目标优化问题的高斯代理模型

本文将数据挖掘(高斯过程回归建模)和智能进化算法(GA,NSGA-Ⅱ)进行结合,用于解决优化函数未知的昂贵区间多目标优化问题.首先利用高斯过程对采用中点和不确定度表示的未知目标函数和约束函数进行建模,由于相关性和准确性是区间函数模型的两个必备条件,故提出一种融合多属性决策的双层种群筛选策略,并将其嵌入到遗传算法求解高斯模型参数的过程中,第1层根据相关性属性排除候选解集中部分劣解,第2层根据准确性属性排除候选解集中其余超出种群规模的劣解,两属性的权重系数决定两层排除劣解的比例.然后将所建模型作为优化对象的代理模型引导区间NSGA-II算法优化求解,从而获得所需的Pareto前沿.     

后验Monte Carlo-Gaussian采样粒子滤波WSN网络定位*

环境因素导致无线传感器网络定位存在噪声影响,实质上是非平滑的非线性问题,针对传统粒子滤波算法在处理该问题时精度不高的缺点,提出一种基于后验泊松分布的Monte Carlo-Gaussian重采样粒子滤波算法的无线传感器网络定位算法。首先,基于粒子滤波算法,借鉴扩展卡尔曼滤波算法采用近似后验高斯分布思想,设计了后验泊松分布Monte Carlo-Gaussian重采样粒子滤波器。其次,采用该滤波器设计实现了无线传感器网络定位算法,解决了非平滑非线性的噪声干扰定位问题。最后,分别对滤波器和定位算法的性能进行了对比仿真实验,结果验证了所提算法的有效性。     

基于克里金空间插值的位置指纹数据库建立算法*

为解决室内定位系统中建立位置指纹数据库工作量庞大的问题,提出了一种融合信号衰减因素的普通克里金空间插值建库算法。该方法首先采用高斯滤波对有限预选参考点的信号强度采样数据进行预处理,并基于球状模型由参考点预处理数据拟合出空间变异函数,然后采用普通克里金插值法对其它位置的信号强度进行估值并生成相应的位置指纹,最后由有限实测数据生成大容量高分辨位置指纹数据库,并通过KNN_Filter算法和对数权重算法完成了定位仿真,验证了该建库方法的有效性。仿真实验结果表明,该算法在保证定位精度的前提下相比传统建库方法可降低40%左右的工作量,提高了室内位置指纹定位方法的工作效率。     

Structured Bayesian compressive sensing with spatial location dependence via variational Bayesian inference

In this paper, a novel non-parametric Bayesian compressive sensing algorithm is proposed to enhance reconstruction performance of sparse entries with a continuous structure by exploiting the location dependence of entries. An approach is proposed which involves the logistic model and location-dependent Gaussian kernel. The variational Bayesian inference scheme is used to perform the posterior distributions and acquire an approximately analytical solution. Compared to the conventional clustered based methods, which only exploit the information of neighboring pixels, the proposed approach takes the relationship between the pixels of the entire image into account to enable the utilization of the underlying sparse signal structure. It significantly reduces the required number of observations for sparse reconstruction. Both real-valued signal applications, including one-dimension signal and two-dimension image, and complex-valued signal applications, including single-snapshot direction-of-arrival (DOA) estimation of distributed sources and inverse synthetic aperture radar (ISAR) imaging with a limited number of pluses, demonstrate the superiority of the proposed algorithm.     

基于非线性重构模型的植物叶片图像集分类方法

提出一种基于非线性重构模型的植物叶片图像集的分类识别方法。该方法首先使用高斯受限玻尔兹曼机(GRBMs)通过非监督预训练来初始化模型的权值;然后针对每一个植物叶片图像集用初始化的模型训练得到一个特定的模型;最后根据测试样本的最小重构误差和测试样本集的最多投票策略来判定测试样本集的类别。该方法通过图像预处理来处理图像,避免了图像在缩放时发生形变,并采用基于k-means的特征提取方法来提取植物叶片图像特征。实验结果表明,该方法能够准确地对植物叶片图像集进行分类识别。     

基于改进高斯核度量和KPCA的数据聚类新方法

大多数超椭球聚类（hyper-ellipsoidal clustering,HEC）算法都使用马氏距离作为距离度量,已经证明在该条件下划分聚类的代价函数是常量,导致HEC无法实现椭球聚类.本文说明了使用改进高斯核的HEC算法可以解释为寻找体积和密度都紧凑的椭球分簇,并提出了一种实用HEC算法-K-HEC,该算法能够有效地处理椭球形、不同大小和不同密度的分簇.为实现更复杂形状数据集的聚类,使用定义在核特征空间的椭球来改进K-HEC算法的能力,提出了EK-HEC算法.仿真实验证明所提出算法在聚类结果和性能上均优于K-means算法、模糊C-means算法、GMM-EM算法和基于最小体积椭球（minimum-volume ellipsoids,MVE）的马氏HEC算法,从而证明了本文算法的可行性和有效性.     

Stochastic system transformation using generalized orthonormal basis functions with applications to continuous-time system identification

This paper studies the system transformation using generalized orthonormal basis functions that include the Laguerre basis as a special case. The transformation of the deterministic systems is studied in the literature, which is called the Hambo transform. The aim of the paper is to develop a transformation theory for stochastic systems. The paper establishes the equivalence of continuous and transformed-discrete-time stochastic systems in terms of solutions. The method is applied to the continuous-time system identification problem. It is shown that using the transformed signals the PO-MOESP subspace identification algorithm yields consistent estimates for system matrices. An example is included to illustrate the efficacy of the proposed identification method, and to make a comparison with the method using the Laguerre filter.