首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 187 毫秒
1.
为了提高人脸检测的速度及鲁棒性,提出了一种基于级联分类器和期望最大、主成分分析(EM PCA)的人脸检测方法.该方法在训练阶段利用不同分辨率的训练样本来训练2个fisher线性分类器,再利用EM PCA提取特征来训练非线性支持向量机(SVM);在检测阶段,首先通过2个fisher线性分类器快速过滤掉大量的背景区域,再利用非线性支持向量机对余下的候选区域进行进一步验证,以确认是否为人脸.实验结果证明了该方法的有效性和正确性.  相似文献   

2.
由于气体具有易扩散和易混合的特点,在人工嗅觉识别过程中,存在训练样本少和分类器建立困难的问题,为此,采用支持向量机这一基于小样本统计学习理论建立非线性分类器的学习算法.针对样本数目偏少的实际情况,建立了一种人工嗅觉分类器,并对好、坏、仿坏三种类别的甘草进行了分类验证.结果表明,支持向量机应用于人工嗅觉,能够取得比较好的分类效果.  相似文献   

3.
张文婷  王海军  陈莹莹  戴兰 《资源科学》2013,35(9):1871-1876
本文以潮州市建成区和近期规划区为研究区,采用训练样本获取先验概率建立朴素贝叶斯分类器,以栅格点为单位,将各栅格点的土地定级因素作用分值作为输入变量,利用朴素贝叶斯分类器进行土地定级。在作用分值确定方法上,采用障碍距离代替传统直线距离,以达到客观反映点、线等要素对城镇土地使用价值作用的程度。最后,对顾及障碍物的朴素贝叶斯定级结果分别与空间聚类结果及未顾及障碍物的定级结果进行比较,结果表明本文所提出的方法在土地定级研究中具有一定的优势,能更加真实地反映城镇土地使用价值的空间分布特征。  相似文献   

4.
将图像的像素特征与矩特征结合,构建了神经网络分类器,利用提取的特征向量对分类器进行了训练和测试。将图像二值化,并归一化为16*16大小,提取了其每个像素点的0、1特征共16*16—256维,图像的网格特征13维,及Hu矩特征7维,一共276维特征。建立了BP神经网络分类器,分别使用最速下降BP算法、动量BP算法、学习率可变BP算法对BP神经网络分类器进行了训练,得出了在相同条件下学习率可变BP算法训练时间短,收敛快的结论。建立了PNN神经网络分类器,与BP神经网络分类器性能进行比较,实验结果表明,PNN神经网络分类器性能更好。  相似文献   

5.
归纳学习训练样本能够产生决策规则或决策树,通过决策规则或决策树分类新数据的方法称为决策树。本文以大连市旅顺口区为研究区域,分析该区影像信息选取分类样本,选取合适的特征,统计分析样本的特征值,运用基于特征的决策树分类方法,设计决策树分类器,来解决该区域土地利用分类问题。  相似文献   

6.
集成分类器是目前隐写分析中的常用分类器。为进一步增强集成分类器在隐写分析中的检测精度,在Bagging集成的基础上提出了一种改进的样本抽取方法,该算法在保留一定差异性的同时,增加了基分类器之间的互补性。实验表明:与原始的集成分类器相比,本文提出的方法能够降低检测错误率。  相似文献   

7.
《科技风》2021,(5)
随着我国经济发展,高质量的稳定电网变得愈发重要。在负荷逐渐加重的今天,对变压器红外图像识别已经成为一个研究方向。本文基于小样本学习方法 Meta-Network(即MetaNet),通过微调原理改进VGG19模型,使用GRU替代传统的LSTM网络,增强了小样本情况下的学习效果。其中数据集包含600多张变压器红外图像,初步实现了减少训练样本与时间、提升分类器性能的效果。  相似文献   

8.
本文研究了基于特征脸的人脸检测算法,针对其分类能力差的特点,基于主元分析提取特征向量空间构造弱分类器,结合AdaBoost算法构造强分类器,提出了一种人脸检测算法。利用MIT+CMU人脸数据库测试该算法的性能,结果表明本算法在运行时间与检测正确率方面明显优于基于神经网路的算法和支持向量机算法。  相似文献   

9.
基于贝叶斯网的分类器因其对不确定性问题有较强的处理能力,因此在CRM客户建模中有其独特的优势。在对朴素贝叶斯分类器通用贝叶斯分类器优缺点分析的基础上,引入增强型BN分类器和贝叶斯多网分类器,详细介绍了后者的算法,并将其应用到实际电信CRM客户建模中,取得较好的效果。  相似文献   

10.
为提高集成分类器在图像隐写分析中的检测,针对传统集成分类器中简单投票方法无法体现基分类器差异性这一缺点,提出一种基于加权投票的图像隐写分析方法。首先基于随机森林的方式生成若干基分类器,然后计算每一个基分类器的投票权值并使用加权投票的方式得到最终的结果。实验结果表明,该方法能够提高集成分类器的检测精度。  相似文献   

11.
朴素贝叶斯理论是一种典型机器学习技术,能够应用于文本分类中。运用朴素贝叶斯理论阐述了贝叶斯分类器的样本训练和分类计算的过程,构造了一个文本分类器。试验表明,朴素贝叶斯理论在文本分类中有较好的分类效果。  相似文献   

12.
Many machine learning algorithms have been applied to text classification tasks. In the machine learning paradigm, a general inductive process automatically builds a text classifier by learning, generally known as supervised learning. However, the supervised learning approaches have some problems. The most notable problem is that they require a large number of labeled training documents for accurate learning. While unlabeled documents are easily collected and plentiful, labeled documents are difficultly generated because a labeling task must be done by human developers. In this paper, we propose a new text classification method based on unsupervised or semi-supervised learning. The proposed method launches text classification tasks with only unlabeled documents and the title word of each category for learning, and then it automatically learns text classifier by using bootstrapping and feature projection techniques. The results of experiments showed that the proposed method achieved reasonably useful performance compared to a supervised method. If the proposed method is used in a text classification task, building text classification systems will become significantly faster and less expensive.  相似文献   

13.
Imbalanced sample distribution is usually the main reason for the performance degradation of machine learning algorithms. Based on this, this study proposes a hybrid framework (RGAN-EL) combining generative adversarial networks and ensemble learning method to improve the classification performance of imbalanced data. Firstly, we propose a training sample selection strategy based on roulette wheel selection method to make GAN pay more attention to the class overlapping area when fitting the sample distribution. Secondly, we design two kinds of generator training loss, and propose a noise sample filtering method to improve the quality of generated samples. Then, minority class samples are oversampled using the improved RGAN to obtain a balanced training sample set. Finally, combined with the ensemble learning strategy, the final training and prediction are carried out. We conducted experiments on 41 real imbalanced data sets using two evaluation indexes: F1-score and AUC. Specifically, we compare RGAN-EL with six typical ensemble learning; RGAN is compared with three typical GAN models. The experimental results show that RGAN-EL is significantly better than the other six ensemble learning methods, and RGAN is greatly improved compared with three classical GAN models.  相似文献   

14.
Either traditional learning methods or deep learning methods have been widely applied for the early Alzheimer’s disease (AD) diagnosis, but these methods often suffer from the issue of training set bias and have no interpretability. To address these issues, this paper proposes a two-phase framework to iteratively assign weights to samples and features. Specifically, the first phase automatically distinguishes clean samples from training samples. Training samples are regarded as noisy data and thus should be assigned different weights for penalty, while clean samples are of high quality and thus are used to learn the feature weights. In the second phase, our method iteratively assigns sample weights to the training samples and feature weights to the clean samples. Moreover, their updates are iterative so that the proposed framework deals with the training set bias issue as well as contains interpretability on both samples and features. Experimental results on the Alzheimer’s Disease Neuroimaging Initiative (ADNI) dataset show that our method achieves the best classification performance in terms of binary classification tasks and has better interpretability, compared to the state-of-the-art methods.  相似文献   

15.
Dynamic Ensemble Selection (DES) strategy is one of the most common and effective techniques in machine learning to deal with classification problems. DES systems aim to construct an ensemble consisting of the most appropriate classifiers selected from the candidate classifier pool according to the competence level of the individual classifier. Since several classifiers are selected, their combination becomes crucial. However, most of current DES approaches focus on the combination of the selected classifiers while ignoring the local information surrounding the query sample needed to be classified. In order to boost the performance of DES-based classification systems, we in this paper propose a dynamic weighting framework for the classifier fusion during obtaining the final output of an DES system. In particular, the proposed method first employs a DES approach to obtain a group of classifiers for a query sample. Then, the hypothesis vector of the selected ensemble is obtained based on the analysis of consensus. Finally, a distance-based weighting scheme is developed to adjust the hypothesis vector depending on the closeness of the query sample to each class. The proposed method is tested on 30 real-world datasets with six well-known DES approaches based on both homogeneous and heterogeneous ensemble. The obtained results, supported by proper statistical tests, show that our method outperforms, both in terms of accuracy and kappa measures, the original DES framework.  相似文献   

16.
As a well-known multi-label classification method, the performance of ML-KNN may be affected by the uncertainty knowledge from samples. The rough set theory acts as an effective tool for data uncertainty analysis, which can identify the samples easy to cause misclassification in the learning process. In this paper, a hybrid framework by fusing rough sets with ML-KNN for multi-label learning is proposed, whose main idea is to depict easy misclassified samples by rough sets and to measure the discernibility of attributes for such samples. First, a rough set model titled NRFD_RS based on neighborhood relations and fuzzy decisions is proposed for multi-label data to find the heterogeneous sample pairs generated from the boundary regions of each label. Then, the weight of an attribute is defined by evaluating its discernibility to those heterogeneous sample pairs. Finally, a weighted HEOM distance is reconstructed and utilized to ML-KNN. Comprehensive experimental results with fourteen public multi-label data sets, including ten regular-scale and four larger-scale data sets, verify the effectiveness of the proposed framework relative to several state-of-the-art multi-label classification methods.  相似文献   

17.
架空输电线路铁塔结构是我国主要的输电方式,一旦发生损伤破坏将造成严重的经济损失。本文提出了一种基于随机森林的数据融合架空输电线路损伤识别方法。首先,采用多个传感器获取铁塔在不同损伤位置和程度上的振动加速度信号,并运用小波包对其进行多层分解;然后,将提取出来的各频带能量值构成特征向量输入到相应的随机森林进行训练和测试;最后,将多个随机森林分类器的次级决策进行数据融合,做出最终铁塔损失情况决策。应用该方法对500kV高压输电铁塔模型进行试验,并与单一分类器相比较。通过对实验数据的分析表明,该方法对铁塔损伤的识别效果优于单一RF分类器,可以有效地改善单一分类器的识别能力。同时也表明该方法具有较好的分类效果和容错能力。  相似文献   

18.
针对钢板表面缺陷图像分类传统深度学习算法中需要大量标签数据的问题,提出一种基于主动学习的高效分类方法。该方法包含一个轻量级的卷积神经网络和一个基于不确定性的主动学习样本筛选策略。神经网络采用简化的convolutional base进行特征提取,然后用全局池化层替换掉传统密集连接分类器中的隐藏层来减轻过拟合。为了更好的衡量模型对未标签图像样本所属类别的不确定性,首先将未标签图像样本传入到用标签图像样本训练好的模型,得到模型对每一个未标签样本关于标签的概率分布(probability distribution over classes, PDC),然后用此模型对标签样本进行预测并得到模型对每个标签的平均PDC。将两类分布的KL-divergence值作为不确定性指标来筛选未标签图像进行人工标注。根据在NEU-CLS开源缺陷数据集上的对比实验,该方法可以通过44%的标签数据实现97%的准确率,极大降低标注成本。  相似文献   

19.
提出了一种人脸关键点检测方法,该方法用了少量的正面图像,不用归一化人脸图像,而传统的人脸关键点检测方法需要对图像进行严格预处理。随机森林是一种分类器融合算法,可以很好地解决多类分类问题,虽然LBP特征简单,但其可以包含大量的纹理信息。利用改进的LBP特征与随机森林相结合,构成一种对人脸关键点检测的方法。通过高斯平滑图像的LBP特征的提取,对每个点生成特征,计算出有用的特征作为正例,并且与反例集合变为训练集。通过随机森林分类器进行分类,误差率较低,仅在10%左右。  相似文献   

20.
为去除网络入侵数据集中的冗余和噪声特征,降低数据处理难度和提高检测性能,提出一种基于特征选择和支持向量机的入侵检测方法。该方法采用提出的特征选择算法选取最优特征组合,并以支持向量机为分类器建立模型,应用于入侵检测系统。仿真结果表明,本文方法不仅可以减少特征维数,降低训练和测试时间,还能提高入侵检测的分类准确率。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号