基于核映射极限学习机的入口氮氧化物预测

针对在线贯序极限学习机(OS-ELM)算法隐含层输出不稳定、易产生奇异矩阵和在线贯序更新时没有考虑训练样本时效性的问题,提出一种基于核函数映射的正则化自适应遗忘因子(FFOS-RKELM)算法.该算法利用核函数代替隐含层,能够产生稳定的输出结果.在初始阶段加入正则化方法,通过构造非奇异矩阵提高模型的泛化能力;在贯序更新阶段,通过新到的数据自动更新遗忘因子.将FFOS-RKELM算法应用到混沌时间序列预测和入口氮氧化物时间序列预测中,相比于OS-ELM、FFOS-RELM、OS-RKELM算法,可有效地提高预测精度和泛化能力.     

具有广义正则化与遗忘机制的在线贯序超限学习机

针对非平稳时间序列预测问题,提出一种具有广义正则化与遗忘机制的在线贯序超限学习机算法.该算法以增量学习新样本的方式实现在线学习,以遗忘旧的失效样本的方式增强对非平稳系统的动态跟踪能力,并通过引入一种广义的$l_2$正则化使其具有持续的正则化功能,从而保证算法的持续稳定性.仿真实例表明,所提出算法具有较同类算法更好的稳定性和更小的预测误差,适用于具有动态变化特性的非平稳时间序列在线建模与预测.     

Sparse online kernelized actor-critic Learning in reproducing kernel Hilbert space

In this paper, we develop a novel non-parametric online actor-critic reinforcement learning (RL) algorithm to solve optimal regulation problems for a class of continuous-time affine nonlinear dynamical systems. To deal with the value function approximation (VFA) with inherent nonlinear and unknown structure, a reproducing kernel Hilbert space (RKHS)-based kernelized method is designed through online sparsification, where the dictionary size is fixed and consists of updated elements. In addition, the linear independence check condition, i.e., an online criteria, is designed to determine whether the online data should be inserted into the dictionary. The RHKS-based kernelized VFA has a variable structure in accordance with the online data collection, which is different from classical parametric VFA methods with a fixed structure. Furthermore, we develop a sparse online kernelized actor-critic learning RL method to learn the unknown optimal value function and the optimal control policy in an adaptive fashion. The convergence of the presented kernelized actor-critic learning method to the optimum is provided. The boundedness of the closed-loop signals during the online learning phase can be guaranteed. Finally, a simulation example is conducted to demonstrate the effectiveness of the presented kernelized actor-critic learning algorithm.

     

A sparse kernel algorithm for online time series data prediction

Kernel based methods have been widely applied for signal analysis and processing. In this paper, we propose a sparse kernel based algorithm for online time series prediction. In classical kernel methods, the kernel function number is very large which makes them of a high computational cost and only applicable for off-line or batch learning. In online learning settings, the learning system is updated when each training sample is obtained and it requires a higher computational speed. To make the kernel methods suitable for online learning, we propose a sparsification method based on the Hessian matrix of the system loss function to continuously examine the significance of the new training sample in order to select a sparse dictionary (support vector set). The Hessian matrix is equivalent to the correlation matrix of sample inputs in the kernel weight updating using the recursive least square (RLS) algorithm. This makes the algorithm able to be easily implemented with an affordable computational cost for real-time applications. Experimental results show the ability of the proposed algorithm for both real-world and artificial time series data forecasting and prediction.     

稀疏性正则化非负矩阵分解的在线学习方法

针对非负矩阵分解效率低的不足,提出一种基于在线学习的稀疏性非负矩阵分解的快速方法.通过对目标函数添加正则化项来控制分解后系数矩阵的稀疏性,将问题转化成稀疏表示的字典学习问题,利用在线字典学习算法求解目标函数,并对迭代过程的矩阵更新进行转换,采取块坐标下降法进行矩阵更新,提高算法收敛速度.实验结果表明,该方法在有效保持图像特征信息的同时,运行效率得到提高.     

基于自适应半耦合字典学习的超分辨率图像重建

在超分辨图像重建领域,如何平衡字典学习中表示系数的稀疏性和协同性对重建效果具有重要意义。针对该问题,在半耦合字典学习的超分辨重建基础上,利用核范数构建一个新的正则项,将稀疏性和协同性作为一个整体进行考虑,并用交替方向乘子法（ADMM）求解优化模型,得到了基于自适应半耦合字典学习的超分辨率图像重建算法。实验结果表明,该方法比现有的一些基于字典学习的重建方法具有更好的重建效果,其能根据字典的变化自适应地平衡稀疏性与关联性,并通过两者之间的协调产生一个最合适的系数,因此在噪声环境下具有一定的抗干扰能力。     

An AK-BRP dictionary learning algorithm for video frame sparse representation in compressed sensing

Sparsifying transform is an important prerequisite in compressed sensing. And it is practically significant to research the fast and efficient signal sparse representation methods. In this paper, we propose an adaptive K-BRP (AK-BRP) dictionary learning algorithm. The bilateral random projection (BRP), a method of low rank approximation, is used to update the dictionary atoms. Furthermore, in the sparse coding stage, an adaptive sparsity constraint is utilized to obtain sparse representation coefficient and helps to improve the efficiency of the dictionary update stage further. Finally, for video frame sparse representation, our adaptive dictionary learning algorithm achieves better performance than K-SVD dictionary learning algorithm in terms of computation cost. And our method produces smaller reconstruction error as well.

     

Dictionary learning with the cosparse analysis model based on summation of blocked determinants as the sparseness measure

Dictionary learning is crucially important for sparse representation of signals. Most existing methods are based on the so called synthesis model, in which the dictionary is column redundant. This paper addresses the dictionary learning and sparse representation with the so-called analysis model. In this model, the analysis dictionary multiplying the signal can lead to a sparse outcome. Though it has been studied in the literature, there is still not an investigation in the context of dictionary learning for nonnegative signal representation, while the algorithms designed for general signal are found not sufficient when applied to the nonnegative signals. In this paper, for a more efficient dictionary learning, we propose a novel cost function that is termed as the summation of blocked determinants measure of sparseness (SBDMS). Based on this measure, a new analysis sparse model is derived, and an iterative sparseness maximization scheme is proposed to solve this model. In the scheme, the analysis sparse representation problem can be cast into row-to-row optimizations with respect to the analysis dictionary, and then the quadratic programming (QP) technique is used to optimize each row. Therefore, we present an algorithm for the dictionary learning and sparse representation for nonnegative signals. Numerical experiments on recovery of analysis dictionary show the effectiveness of the proposed method.     

基于Gabor特征和支持向量引导字典学习的人脸识别

稀疏编码中的字典学习在稀疏表示的图像识别中扮演着重要的作用。由于Gabor特征对表情、光照和姿态等变化具有一定的鲁棒性,提出一种基于Gabor特征和支持向量引导字典学习（GSVGDL）的稀疏表示人脸识别算法。先提取图像的Gabor特征,然后用增广Gabor特征矩阵来构造初始字典。字典学习模型中综合了重构误差项、判别项和正则化项,判别项公式化定义为所有编码向量对平方距离的加权总和;通过字典学习同时得到字典原子与类别标签相对应的结构化字典和线性分类器。该字典学习方法能够自适应地为不同的编码向量对分配不同的权值,提高了字典的判别性能。实验结果表明该方法具有很好的识别精度和较高的识别效率。     

Sparse Representation Based Fisher Discrimination Dictionary Learning for Image Classification

The employed dictionary plays an important role in sparse representation or sparse coding based image reconstruction and classification, while learning dictionaries from the training data has led to state-of-the-art results in image classification tasks. However, many dictionary learning models exploit only the discriminative information in either the representation coefficients or the representation residual, which limits their performance. In this paper we present a novel dictionary learning method based on the Fisher discrimination criterion. A structured dictionary, whose atoms have correspondences to the subject class labels, is learned, with which not only the representation residual can be used to distinguish different classes, but also the representation coefficients have small within-class scatter and big between-class scatter. The classification scheme associated with the proposed Fisher discrimination dictionary learning (FDDL) model is consequently presented by exploiting the discriminative information in both the representation residual and the representation coefficients. The proposed FDDL model is extensively evaluated on various image datasets, and it shows superior performance to many state-of-the-art dictionary learning methods in a variety of classification tasks.     

基于截断核范数低秩分解的自适应字典学习算法

针对过完备字典直接对图像进行稀疏表示不能很好地剔除高频噪声的影响,压缩感知后图像重构质量不高的问题,提出了基于截断核范数低秩分解的自适应字典学习算法。该算法首先利用截断核范数正则化低秩分解模型对图像矩阵低秩分解得到低秩部分和稀疏部分,其中低秩部分保留了图像的主要信息,稀疏部分主要包含高频噪声及部分物体轮廓信息;然后对图像低秩部分进行分块,依据图像块纹理复杂度对图像块进行分类;最后使用K奇异值分解（K-single value decomposition, K-SVD）字典学习算法,针对不同类别训练出多个不同大小的过完备字典。仿真结果表明,本文所提算法能够对图像进行较好的稀疏表示,并在很好地保持图像块特征一致性的同时显著提升图像重构质量。     

基于稀疏表示方法的短期风电功率预测

针对短期风电功率预测,提出一种基于稀疏表示特征提取的建模方法.为了构建预测模型,将历史风电功率数据构成具有时延的输入-输出数据对,将时延输入数据向量作为初始字典,由K-均值奇异值分解(K-SVD)算法将其进行稀疏分解与变换至稀疏域以得到学习后的字典,由正交匹配追踪(OMP)算法获取相应的稀疏编码向量,再将该向量作为极限...     

An information theoretic sparse kernel algorithm for online learning

Kernel-based algorithms have been proven successful in many nonlinear modeling applications. However, the computational complexity of classical kernel-based methods grows superlinearly with the increasing number of training data, which is too expensive for online applications. In order to solve this problem, the paper presents an information theoretic method to train a sparse version of kernel learning algorithm. A concept named instantaneous mutual information is investigated to measure the system reliability of the estimated output. This measure is used as a criterion to determine the novelty of the training sample and informative ones are selected to form a compact dictionary to represent the whole data. Furthermore, we propose a robust learning scheme for the training of the kernel learning algorithm with an adaptive learning rate. This ensures the convergence of the learning algorithm and makes it converge to the steady state faster. We illustrate the performance of our proposed algorithm and compare it with some recent kernel algorithms by several experiments.     

Multiplicative noise removal via adaptive learned dictionaries and TV regularization

Multiplicative noise removal is a key issue in image processing problem. While a large amount of literature on this subject are total variation (TV)-based and wavelet-based methods, recently sparse representation of images has shown to be efficient approach for image restoration. TV regularization is efficient to restore cartoon images while dictionaries are well adapted to textures and some tricky structures. Following this idea, in this paper, we propose an approach that combines the advantages of sparse representation over dictionary learning and TV regularization method. The method is proposed to solve multiplicative noise removal problem by minimizing the energy functional, which is composed of the data-fidelity term, a sparse representation prior over adaptive learned dictionaries, and TV regularization term. The optimization problem can be efficiently solved by the split Bregman algorithm. Experimental results validate that the proposed model has a superior performance than many recent methods, in terms of peak signal-to-noise ratio, mean absolute-deviation error, mean structure similarity, and subjective visual quality.     

Synthesis K-SVD based analysis dictionary learning for pattern classification

In the fields of computer vision and pattern recognition, dictionary learning techniques have been widely applied. In classification tasks, synthesis dictionary learning is usually time-consuming during the classification stage because of the sparse reconstruction procedure. Analysis dictionary learning, which is another research line, is more favorable due to its flexible representative ability and low classification complexity. In this paper, we propose a novel discriminative analysis dictionary learning method to enhance classification performance. Particularly, we incorporate a linear classifier and the supervised information into the traditional analysis dictionary learning framework by adding a discrimination error term. A synthesis K-SVD based algorithm which can effectively constrain the sparsity is presented to solve the proposed model. Extensive comparison experiments on benchmark databases validate the satisfactory performance of our method.

     

Towards online monitoring of concrete dam displacement subject to time-varying environments: An improved sequential learning approach

Data-based models are widely applied in concrete dam health monitoring. However, most existing models are restricted to offline modeling, which cannot continuously track the displacement behavior with dynamic evolution patterns, especially in time-varying environments. In this paper, sequential learning is introduced to establish an online monitoring model for dam displacement behavior. This approach starts by considering the timeliness difference between old and new data using the forgetting mechanism, and a novel adaptive forgetting extreme learning machine (AF-ELM) is presented. A primary predictor based on AF-ELM is then formulated, which aims to sequentially learn the complex nonlinear relationship between dam displacement and main environmental factors. Considering the chaotic characteristics contained in the residual sequence of the primary predictor, a multi-scale residual-error correction (REC) strategy is devised based on divide-and-conquer scheme. Specifically, time-varying filter-based empirical mode decomposition is adopted to decompose the raw chaotic residual-error series into a set of subseries with more stationarity, which are further aggregated and reconstructed by fuzzy entropy theory and suitable approximation criterion. Finally, the corrected residual sequence is superimposed with the preliminary predictions from AF-ELM to generate the required modeling results. The effectiveness of the proposed model is verified and assessed by taking a real concrete dam as an example and comparing prediction performance with state-of-the-art models. The results show that AF-ELM performs better in displacement prediction compared with benchmark models, and the multi-scale REC can effectively identify the valuable information within the residual sequence. The proposed online monitoring model can more closely track the dynamic variations of displacement data, which provides a fire-new solution for dam behavior prediction and analysis.     

Gaussian mixture model learning based image denoising method with adaptive regularization parameters

Gaussian mixture model learning based image denoising as a kind of structured sparse representation method has received much attention in recent years. In this paper, for further enhancing the denoised performance, we attempt to incorporate the gradient fidelity term with the Gaussian mixture model learning based image denoising method to preserve more fine structures of images. Moreover, we construct an adaptive regularization parameter selection scheme by combing the image gradient with the local entropy of the image. Experiment results show that our proposed method performs an improvement both in visual effects and peak signal to noise values.     

一种进行稀疏编码的复数数据词典快速训练方法

稀疏编码理论应用于信号处理的各个领域,为了获取优化的稀疏编码,需要通过训练获取数据词典.提出了一种复数域数据词典的快速训练方法,将词典训练问题转化为最优化问题并交替地对词典原子和编码进行最优化而得到最终训练词典.在对词典原子的最优化过程中,采用具有记忆性的在线训练算法;而在对编码进行最优化的过程中,采用交换乘子方向方法进行实现.通过实验得出:所提出的算法能够有效地提高数据词典的训练效率,在保证收敛值的同时缩短训练时间,并且对于训练样本中的噪声具有鲁棒性.     

Multiplication-free radial basis function network

For the purpose of adaptive function approximation, a new radial basis function network is proposed which is nonlinear in its parameters. The goal is to reduce significantly the computational effort for a serial processor, by avoiding multiplication in both the evaluation of the function model and the computation of the parameter adaptation. The approximation scheme makes use of a grid-based Gaussian basis function network. Due to the local support of digitally implemented Gaussian functions the function representation is parametric local and therefore well suited for an online implementation on a microcomputer. A gradient descent based nonlinear learning algorithm is presented and the convergence of the algorithm is proved.     

A framework based on sparse representation model for time series prediction in smart city

Smart city driven by Big Data and Internet of Things(loT)has become a most promising trend of the future.As one important function of smart city,event alert based on time series prediction is faced with the challenge of how to extract and represent discriminative features of sensing knowledge from the massive sequential data generated by IoT devices.In this paper,a framework based on sparse representa-tion model(SRM)for time series prediction is proposed as an efficient approach to tackle this challenge.After dividing the over-complete dictionary into upper and lower parts,the main idea of SRM is to obtain the sparse representation of time series based on the upper part firstly,and then realize the prediction of future values based on the lower part.The choice of different dictionaries has a significant impact on the performance of SRM.This paper focuses on the study of dictionary construction strategy and summarizes eight variants of SRM.Experimental results demonstrate that SRM can deal with different types of time series prediction flexibly and effectively.