电力电缆故障放电声自动识别与起点标定算法

针对电力电缆故障精确定点方法中存在的依赖人工判断、效率低下的缺点,提出了一种电缆故障放电声波自动识别及波形起点标定算法。通过对电缆故障放电声波进行特征分析,定义了4个概括性特征,对大量故障、非故障波形进行了特征提取并组建了训练、验证样本集;提出了基于AdaBoost-SVM(支持向量机)的故障放电声波识别算法,对所提出的4个特征在放电和噪声信号中的空间分布差异进行了学习;结合离散小波变换和高斯分布规律提出了故障波形起点自动标定算法。实验证明,所提算法在保证准确性的同时,可提升电缆故障精确定点的效率。     

基于AdaBoost BP神经网络的无参考图像质量评价的研究

提出了一种利用相关梯度特征和AdaBoost 反向传播神经网络的无参考图像质量评价方法。首先利用高斯滤波器得到水平和竖直的方向导数,然后提取相关的梯度特征,其次计算其直方图方差特征,然后训练BP神经网络得到弱分类器并利用AdaBoost算法获得最终的强分类器,最后利用得到的强分类器预测图像质量分数。实验结果表明,方法评价的结果合理、鲁棒性强、实行性好,符合人类视觉特性,并且与主观评分有较好的一致性,取得了很好的评价效果。     

R-AdaBoost带钢表面缺陷特征选择算法

带钢表面缺陷形式的复杂多变给特征的选择带来了困难,为此,提出一种融合特征筛选和样本权值更新的R-Ada Boost特征选择算法。该算法在Ada Boost算法的每个循环中通过Relief算法进行特征的筛选与降维,通过筛选后的特征利用样本的类内类间差去除噪声样本,然后根据Ada Boost的动态权值更新样本库,再利用每个循环优化选择得到的最优特征与弱分类器级联成最终的Ada Boost强分类器,进行带钢表面缺陷的检测与定位。实验结果表明,针对带钢实际生产线上的划痕、褶皱、山脉、污点等多种缺陷,该算法可以有效提取出具有高区分性和独立性的特征,同时提高了缺陷检测算法的准确率。     

一种改进的自适应增强-支持向量回归机的故障预测方法

针对支持向量回归(SVR)方法对突变故障预测精度较低的问题,提出了一种改进的自适应增强算法(AdaBoost)提升SVR故障预测性能。该方法通过AdaBoost算法获取训练样本中突变点的权重并构造加权支持向量回归机增强突变点的训练,以提高对突变故障预测精度。利用自适应权重裁减方法剔除权重较小的样本点,来提高算法的训练速度。将本文方法用于发动机磨损元素的时间序列预测中,一步预测相对误差达到了0.025. 实验结果表明该方法在保证预测精度的前提下有效地提高了故障预测速度。     

Study on AdaBoost-based link quality prediction mechanism

The link quality was vulnerable to the complexity environment in wireless sensor network.Obtaining link quality information in advance could reduce energy consumption of nodes.After analyzing the existing link quality prediction methods,AdaBoost-based link quality prediction mechanism was put forward.Link quality samples in deferent scenarios were collected.Density-based unsupervised clustering algorithm was employed to classify training samples into deferent link quality levels.The AdaBoost with SVM-based component classifiers was adopted to build link quality prediction mechanism.Experimental results show that the proposed mechanism has better prediction precision.     

Stock trend prediction based on a new status box method and AdaBoost probabilistic support vector machine

Stock trend prediction is regarded as one of the most challenging tasks of financial time series prediction. Conventional statistical modeling techniques are not adequate for stock trend forecasting because of the non-stationarity and non-linearity of the stock market. With this regard, many machine learning approaches are used to improve the prediction results. These approaches mainly focus on two aspects: regression problem of the stock price and prediction problem of the turning points of stock price. In this paper, we concentrate on the evaluation of the current trend of stock price and the prediction of the change orientation of the stock price in future. Then, a new approach named status box method is proposed. Different from the prediction issue of the turning points, the status box method packages some stock points into three categories of boxes which indicate different stock status. And then, some machine learning techniques are used to classify these boxes so as to measure whether the states of each box coincides with the stock price trend and forecast the stock price trend based on the states of the box. These results would support us to make buying or selling strategies. Comparing with the turning points prediction that only considered the features of one day, each status box contains a certain amount of points which represent the stock price trend in a certain period of time. So, the status box reflects more information of stock market. To solve the classification problem of the status box, a special features construction approach is presented. Moreover, a new ensemble method integrated with the AdaBoost algorithm, probabilistic support vector machine (PSVM), and genetic algorithm (GA) is constructed to perform the status boxes classification. To verify the applicability and superiority of the proposed methods, 20 shares chosen from Shenzhen Stock Exchange (SZSE) and 16 shares from National Association of Securities Dealers Automated Quotations (NASDAQ) are applied to perform stock trend prediction. The results show that the status box method not only have the better classification accuracy but also effectively solve the unbalance problem of the stock turning points classification. In addition, the new ensemble classifier achieves preferable profitability in simulation of stock investment and remarkably improves the classification performance compared with the approach that only uses the PSVM or back-propagation artificial neural network (BPN).     

基于集成修剪的丁苯橡胶聚合转化率软测量

针对目前丁苯橡胶聚合转化率难以在线精确测量,不利于指导生产的问题,本文提出一种基于集成修剪的软测量方法用于丁苯橡胶聚合转化率的预测.首先采用bagging方法建立多个LS-SVM弱学习器,然后利用AdaBoost.RT方法对弱学习器进行修剪,最后将修剪出的弱学习器加权输出.该方法克服了集成算法需要存储空间大和预测时间长的缺点,并且在一定程度上改善了最小二乘支持向量机的稀疏性和鲁棒性问题.仿真结果表明,聚合转化率预报绝对误差大于1.5样本的比例小于10%,能够满足实际生产要求,可以作为过程信息用于丁苯橡胶聚合过程的优化控制.     

Real‐Time License Plate Detection in High‐Resolution Videos Using Fastest Available Cascade Classifier and Core Patterns

We present a novel method for real‐time automatic license plate detection in high‐resolution videos. Although there have been extensive studies of license plate detection since the 1970s, the suggested approaches resulting from such studies have difficulties in processing high‐resolution imagery in real‐time. Herein, we propose a novel cascade structure, the fastest classifier available, by rejecting false positives most efficiently. Furthermore, we train the classifier using the core patterns of various types of license plates, improving both the computation load and the accuracy of license plate detection. To show its superiority, our approach is compared with other state‐of‐the‐art approaches. In addition, we collected 20,000 images including license plates from real traffic scenes for comprehensive experiments. The results show that our proposed approach significantly reduces the computational load in comparison to the other state‐of‐the‐art approaches, with comparable performance accuracy.     

Sparse spectral hashing

A better similarity index structure for high-dimensional feature datapoints is very desirable for building scalable content-based search systems on feature-rich dataset. In this paper, we introduce sparse principal component analysis (Sparse PCA) and Boosting Similarity Sensitive Hashing (Boosting SSC) into traditional spectral hashing for both effective and data-aware binary coding for real data. We call this Sparse Spectral Hashing (SSH). SSH formulates the problem of binary coding as a thresholding a subset of eigenvectors of the Laplacian graph by constraining the number of nonzero features. The convex relaxation and eigenfunction learning are conducted in SSH to make the coding globally optimal and effective to datapoints outside the training data. The comparisons in terms of F1 score and AUC show that SSH outperforms other methods substantially over both image and text datasets.