Robust and Efficient Pattern Classification using Large Geometric Margin Minimum Classification Error Training

Recently, one of the standard discriminative training methods for pattern classifier design, i.e., Minimum Classification Error (MCE) training, has been revised, and its new version is called Large Geometric Margin Minimum Classification Error (LGM-MCE) training. It is formulated by replacing a conventional misclassification measure, which is equivalent to the so-called functional margin, with a geometric margin that represents the geometric distance between an estimated class boundary and its closest training pattern sample. It seeks the status of the trainable classifier parameters that simultaneously correspond to the minimum of the empirical average classification error count loss and the maximum of the geometric margin. Experimental evaluations showed the fundamental utility of LGM-MCE training. However, to increase its effectiveness, this new training required careful setting for hyperparameters, especially the smoothness degree of the smooth classification error count loss. Exploring the smoothness degree usually requires many trial-and-error repetitions of training and testing, and such burdensome repetition does not necessarily lead to an optimal smoothness setting. To alleviate this problem and further increase the effect of geometric margin employment, we apply in this paper a new idea that automatically determines the loss smoothness of LGM-MCE training. We first introduce a new formalization of it using the Parzen estimation of error count risk and formalize LGM-MCE training that incorporates a mechanism of automatic loss smoothness determination. Importantly, the geometric-margin-based misclassification measure adopted in LGM-MCE training is directly linked with the geometric margin in a pattern sample space. Based on this relation, we also prove that loss smoothness affects the production of virtual samples along the estimated class boundaries in pattern sample space. Finally, through experimental evaluations and in comparisons with other training methods, we elaborate the characteristics of LGM-MCE training and its new function that automatically determines an appropriate loss smoothness degree.     

基于遗传算法的HMM最小错识率训练方法

最小错识率（MCE）HMM训练方法是最直接的判决训练方法之一,原理上比最大似然接方法优越得多。但是,充分发挥MCE的性能的困难在于如何将非连续的经验错识率估计映射成连续的代价函数以便采用梯度搜索技术之类的忧化方法。本文所提出的基于遗传算法的最小错识率方法（GAMCE）不但可避免MCE的缺点,而且在原理上可求得全局最优解。实验结果表明,GA_MCE比MCE好得多。     

基于稀疏自编码器和边缘保持的Wishart马尔科夫随机场的极化SAR图像分类

针对极化SAR图像训练样本数目较少问题以及极化SAR图像同质区域较多的特性,提出了一种新的两层分类框架,结合了稀疏自编码器和边缘保持的Wishart马尔科夫随机场对极化SAR图像进行分类.该框架包括个步骤,第一个步骤使用稀疏自编码器来获得一个初始分类;第二个步骤使用边缘保持的Wishart马尔科夫随机场对第一层的分类结果进行修正.在应用Wishart马尔科夫随机场的过程中,由稀疏自编码器分类得到的边缘得以保持,并且提出了新的分类错误纠正策略确保分类的准确性.因此,通过稀疏自编码器得到的精确分类边缘可用于不同的区域并且在应用Wishart马尔科夫的过程中得以保持.和其他分类方法相比,该方法得到较高的分类精度,证明了新方法的有效性.     

融合原始样本和虚拟样本的人脸识别算法

由于有限的存储容量和捕获图片的时间,实际的人脸识别系统往往只能获得少量的训练样本,但是,在小训练样本情况下大多数人脸识别算法都会遇到困难.因此,为了提高人脸识别的分类正确率,提出了一种融合原始样本和虚拟样本的人脸识别方法.该方法先利用人脸的对称性来构造虚拟训练样本;然后,利用协同表示方法分别对原始训练样本和虚拟训练样本进行分析,并且分别得到每一类训练样本的重建误差;最后,将原始训练样本和虚拟训练样本的同一类重建误差进行加权融合并得到最终的分类结果.大量的实验结果比较分析表明,该方法可以获得更好的识别效果.     

适用于不平衡样本数据处理的支持向量机方法

支持向量机算法在处理不平衡样本数据时，其分类器预测具有倾向性．样本数量多的类别，其分类误差小，而样本数量少的类别，其分类误差大．本文针对这种倾向性问题，在分析其产生原因的基础上，提出了基于遗传交叉运算的改进方法．对于小类别训练样本，利用交叉运算产生新的样本，从而补偿了因训练数据类别大小差异而造成的影响．基于UCI标准数据集的仿真实验结果表明，改进方法比标准支持向量机方法具有更好的分类准确率．     

Classification‐Based Approach for Hybridizing Statistical and Rule‐Based Machine Translation

In this paper, we propose a classification‐based approach for hybridizing statistical machine translation and rule‐based machine translation. Both the training dataset used in the learning of our proposed classifier and our feature extraction method affect the hybridization quality. To create one such training dataset, a previous approach used auto‐evaluation metrics to determine from a set of component machine translation (MT) systems which gave the more accurate translation (by a comparative method). Once this had been determined, the most accurate translation was then labelled in such a way so as to indicate the MT system from which it came. In this previous approach, when the metric evaluation scores were low, there existed a high level of uncertainty as to which of the component MT systems was actually producing the better translation. To relax such uncertainty or error in classification, we propose an alternative approach to such labeling; that is, a cut‐off method. In our experiments, using the aforementioned cut‐off method in our proposed classifier, we managed to achieve a translation accuracy of 81.5% — a 5.0% improvement over existing methods.     

Adaptive adversarial prototyping network for few-shot prototypical translation

Translating multiple real-world source images to a single prototypical image is a challenging problem. Notably, these source images belong to unseen categories that did not exist during model training. We address this problem by proposing an adaptive adversarial prototype network (AAPN) and enhancing existing one-shot classification techniques. To overcome the limitations that traditional works cannot extract samples from novel categories, our method tends to solve the image translation task of unseen categories through a meta-learner. We train the model in an adversarial learning manner and introduce a style encoder to guide the model with an initial target style. The encoded style latent code enhances the performance of the network with conditional target style images. The AAPN outperforms the state-of-the-art methods in one-shot classification of brand logo dataset and achieves the competitive accuracy in the traffic sign dataset. Additionally, our model improves the visual quality of the reconstructed prototypes in unseen categories. Based on the qualitative and quantitative analysis, the effectiveness of our model for few-shot classification and generation is demonstrated.     

基于随机子空间和AdaBoost的自适应集成方法

如何构造差异性大且精确度高的基分类器是集成学习的重点,为此提出一种新的集成学习方法——利用PSO寻找使得AdaBoost依样本权重抽取的数据集分类错误率最小化的最优特征权重分布,依据此最优权重分布对特征随机抽样生成随机子空间,并应用于AdaBoost的训练过程中.这就在增加分类器间差异性的同时保证了基分类器的准确度.最后用多数投票法融合各基分类器的决策结果,并通过仿真实验验证该方法的有效性.     

Learning discriminative and meaningful samples for generalized zero shot classification

Generalized zero shot classification aims to recognize both seen and unseen samples in test sets, which has gained great attention. Recently, many works consider using generative adversarial network to generate unseen samples for solving generalized zero shot classification problem. In this paper, we study how to generate discriminative and meaningful samples. We propose a method to learn discriminative and meaningful samples for generalized zero shot classification tasks (LDMS) by generative adversarial network with the regularization of class consistency and semantic consistency. In order to make the generated samples discriminative, class consistency is used, such that the generated samples of the same classes are near and of different classes are far away. In order to make the generated samples meaningful, semantic consistency is used, such that the semantic representations of the generated samples are close to their class prototypes. It encodes the discriminative information and semantic information to the generator. In order to alleviate the bias problem, we select some confident unseen samples. We use the seen samples, the generated unseen samples and the selected confident unseen samples to train the final classifier. Extensive experiments on all datasets demonstrate that the proposed method can outperform state-of-the-art models on generalized zero shot classification tasks.     

Voice Activity Detection Based on Discriminative Weight Training Incorporating a Spectral Flatness Measure

In this paper, we present an approach to incorporate discriminative weight training into a statistical model-based voice activity detection (VAD) method. In our approach, the VAD decision rule is derived from the optimally weighted likelihood ratios (LRs) using a minimum classification error (MCE) method. An adaptive on-line means of selecting two kinds of weights based on a power spectral flatness measure (PSFM) is devised for performance improvement. The proposed approach is compared to conventional schemes under various noise conditions, and shows better performance.     

有噪声标注情况下的中医舌色分类方法

舌色是中医(TCM)望诊最关注的诊察特征之一,自动准确的舌色分类是舌诊客观化研究的重要内容。由于不同类别舌色之间的视觉界限存在模糊性以及医生标注者的主观性等,标注的舌象数据中常含有噪声,影响舌色分类模型的训练。为此,该文提出一种有噪声标注情况下的中医舌色分类方法：首先,提出一种两阶段的数据清洗方法,对含有噪声的标注样本进行识别,并进行清洗;其次,设计一种基于通道注意力机制的轻型卷积神经网络,通过增强特征的表达能力,实现舌色的准确分类;最后,提出一种带有噪声样本过滤机制的知识蒸馏策略,该策略中加入了由教师网络主导的噪声样本过滤机制,进一步剔除噪声样本,同时利用教师网络指导轻型卷积神经网络的训练,提升了分类性能。在自建的中医舌色分类数据集上的实验结果表明,该文提出的舌色分类方法能以较低的计算复杂度,显著提升分类的准确率,达到了93.88%。     

低数据资源条件下基于结构信息共享的无切分维文文档识别字符建模

无切分维吾尔文文档识别技术能够有效避免字符切分错误,但是对于低数据资源的新样本类型,原有模型往往难以获得较高的识别性能。为此,该文提出共享常用维文字体间相对稳定的字符结构信息,并用Bootstrap方法提高样本利用效率的解决方法。通过在实际书籍样本上的实验表明,仅利用规模约原始训练样本1/5的新类型样本,该方法在测试集上的平均字符识别准确率就可以达到95.05%;而与常用的最大后验概率估计方法相比,也能使识别错误率相对降低55.76%~63.84%。因此,该方法能够有效解决低数据资源条件下的维文字符建模问题,实现对新样本类型的高性能识别。     

Hyperspectral data analysis and supervised feature reduction viaprojection pursuit

As the number of spectral bands of high-spectral resolution data increases, the ability to detect more detailed classes should also increase, and the classification accuracy should increase as well. Often the number of labelled samples used for supervised classification techniques is limited, thus limiting the precision with which class characteristics can be estimated. As the number of spectral bands becomes large, the limitation on performance imposed by the limited number of training samples can become severe. A number of techniques for case-specific feature extraction have been developed to reduce dimensionality without loss of class separability. Most of these techniques require the estimation of statistics at full dimensionality in order to extract relevant features for classification. If the number of training samples is not adequately large, the estimation of parameters in high-dimensional data will not be accurate enough. As a result, the estimated features may not be as effective as they could be. This suggests the need for reducing the dimensionality via a preprocessing method that takes into consideration high-dimensional feature-space properties. Such reduction should enable the estimation of feature-extraction parameters to be more accurate. Using a technique referred to as projection pursuit (PP), such an algorithm has been developed. This technique is able to bypass many of the problems of the limitation of small numbers of training samples by making the computations in a lower-dimensional space, and optimizing a function called the projection index. A current limitation of this method is that, as the number of dimensions increases, it is likely that a local maximum of the projection index will be found that does not enable one to fully exploit hyperspectral-data capabilities     

Generalized zero-shot classification via iteratively generating and selecting unseen samples

Generalized zero-shot classification (GZSC) is a challenging task to recognize seen and unseen samples from target domain by seen samples in source domain. Since the lack of unseen data, many methods train a generative adversarial network (GAN) to generate unseen samples. However, the GAN model trained by seen samples is not suitable for generating unseen samples. For dealing with this problem, we train the GAN model by generating seen and unseen samples, simultaneously. In order to generate high-quality unseen samples, the visual prototypes of the generated unseen samples are made near to the real unseen visual prototypes. We select the confident unseen samples based on the agreement of the current two unseen classifiers and use them to update the unseen visual prototypes. Through the iteratively generating and selecting method (IGS), we can generate high-quality unseen samples and select the most confident unseen samples. Experimental results on the standard benchmarks show the superiority of the proposed model over the state-of-the-art methods for GZSC tasks.     

基于不准确图像数据清洗的分类方法研究

在使用图像数据集训练神经网络分类模型时,需要大量标注准确的图像数据集,但实际应用中的图像数据集经常含有大量标注错误的图像,标注错误的图像不利于训练准确的神经网络分类模型。然而,标注准确的数据集制作需要消耗大量的时间和人力成本。因此,本文提出了一种基于不准确图像数据清洗的分类框架。在猫狗自然图像上的实验结果表明,具有清洗环节的分类模型的分类准确率得到提升,损失函数的损失值下降。在探讨数据集中含有标签错误图像的比例与分类准确率之间的关系中发现,较深层次的神经网络对数据集中错误图像有一定的鲁棒性,但在图像数据集中标签噪音图像的比例较高时,清洗环节的引入使得较浅的神经网络分类模型也能达到与较深层次的神经网络分类模型相当的分类效果,而较浅神经网络分类模型的运算速度更快。本文为构建快速和准确的分类模型提供了一种新思路。      

A covariance estimator for small sample size classificationproblems and its application to feature extraction

A key to successful classification of multivariate data is the defining of an accurate quantitative model of each class. This is especially the case when the dimensionality of the data is high, and the problem is exacerbated when the number of training samples is limited. For the commonly used quadratic maximum-likelihood classifier, the class mean vectors and covariance matrices are required and must be estimated from the available training samples. In high dimensional cases, it has been found that feature extraction methods are especially useful, so as to transform the problem to a lower dimensional space without loss of information, however, here too class statistics estimation error is significant. Finding a suitable regularized covariance estimator is a way to mitigate these estimation error effects. The main purpose of this work is to find an improved regularized covariance estimator of each class with the advantages of Leave-One-Out Covariance Estimator (LOOC) and Bayesian LOOC (BLOOC). Besides, using the proposed covariance estimator to improve the linear feature extraction methods when the multivariate data is singular or nearly so is demonstrated. This work is specifically directed at analysis methods for hyperspectral remote sensing data     

类不均衡的半监督高斯过程分类算法

针对传统的监督学习方法难以解决真实数据集标记信息少、训练样本集中存在类不均衡的问题,提出了类不均衡的半监督高斯过程分类算法。算法引入自训练的半监督学习思想,结合高斯过程分类算法计算后验概率,向未标记数据中注入类标记以获得更多准确可信的标记数据,使得训练样本的类分布相对平衡,分类器自适应优化以获得较好的分类效果。实验结果表明,在类不均衡的训练样本及标记信息过少的情况下,该算法通过自训练分类器获得了有效标记,使分类精度得到了有效提高,为解决类不均衡数据分类提供了一个新的思路。     

基于字典优化的联合稀疏表示高光谱图像分类

针对训练样本量少导致高光谱图像分类精度低的问题,本文提出了一种基于字典优化的联合稀疏表示高光谱图像分类方法.首先,采取基于层次聚类的波段选择方法降低高光谱图像数据维度;其次,结合空间信息将高光谱数据划分为多个子集,利用已知标签信息的训练样本标记各个子集中可能成为训练样本的像元,组成训练样本备选集,根据光谱相似度准则筛选...     

面向人脸验证的可迁移对抗样本生成方法

在人脸识别模型的人脸验证任务中,传统的对抗攻击方法无法快速生成真实自然的对抗样本,且对单模型的白盒攻击迁移到其他人脸识别模型上时攻击效果欠佳。该文提出一种基于生成对抗网络的可迁移对抗样本生成方法TAdvFace。TAdvFace采用注意力生成器提高面部特征的提取能力,利用高斯滤波操作提高对抗样本的平滑度,并用自动调整策略调节身份判别损失权重,能够根据不同的人脸图像快速地生成高质量可迁移的对抗样本。实验结果表明,TAdvFace通过单模型的白盒训练,生成的对抗样本能够在多种人脸识别模型和商业API模型上都取得较好的攻击效果,拥有较好的迁移性。