Numerical approximation of solution of nonhomogeneous backward heat conduction problem in bounded region

In this paper we consider a numerical approximation of solution of nonhomogeneous backward heat conduction problem (BHCP) in bounded region based on Tikhonov regularization method. Error estimate at t=0$t=0$ for this method is provided. According to the error estimate, a selection of regularization parameter is given. Meanwhile, a numerical implementation is described and the numerical results show that our algorithm is effective.     

Rollout sampling approximate policy iteration

Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervised learning problem. This paper proposes variants of an improved policy iteration scheme which addresses the core sampling problem in evaluating a policy through simulation as a multi-armed bandit machine. The resulting algorithm offers comparable performance to the previous algorithm achieved, however, with significantly less computational effort. An order of magnitude improvement is demonstrated experimentally in two standard reinforcement learning domains: inverted pendulum and mountain-car.     

Over-Parameterized Variational Optical Flow

A novel optical flow estimation process based on a spatio-temporal model with varying coefficients multiplying a set of basis functions at each pixel is introduced. Previous optical flow estimation methodologies did not use such an over parameterized representation of the flow field as the problem is ill-posed even without introducing any additional parameters: Neighborhood based methods of the Lucas–Kanade type determine the flow at each pixel by constraining the flow to be described by a few parameters in small neighborhoods. Modern variational methods represent the optic flow directly via the flow field components at each pixel. The benefit of over-parametrization becomes evident in the smoothness term, which instead of directly penalizing for changes in the optic flow, accumulates a cost of deviating from the assumed optic flow model. Our proposed method is very general and the classical variational optical flow techniques are special cases of it, when used in conjunction with constant basis functions. Experimental results with the novel flow estimation process yield significant improvements with respect to the best results published so far.     

基于遗传算法和广义交叉原理求解正则参数

本文研究了正则化方法中正则参数的求解问题,提出了一种新的正则参数求解策略,即利用遗传算法基于广义交叉检验准则求解正则参数,数值模拟验证了该方法的可行性和有效性。     

StreamJacobi： Efficient implementation of 2-D Jacobi on a stream processor

Stream processors, with the stream programming model, have demonstrated significant performance advantages in the domains signal processing, multimedia and graphics applications. In this paper we examine the applicability of a stream processor to 2-D Jacobi iteration which is widely used to solve partial differential equations, an important class of scientific programs. We first map 2-D Jacobi iteration in FORTRAN version to the stream processor in a straightforward way. In a stream processor system, the management of system resources is the programmers＇ responsibility. We then present several optimizations, which avail the stream program for 2-D Jacobi iteration, called StreamJacobi, of various aspects of the stream processor architecture. Finally, we analyze the performance of StreamJacobi, with different scales, and the presented optimizations. The final stream program StreamJacobi is from 2.31 to 6.42 times faster than the corresponding FORTRAN programs on a Xeon 5100 processor, with the optimizations playing an important role in realizing the performance improvement.     

The anti-reflective algebra: structural and computational analysis with application to image deblurring and denoising

Anti-reflective (AR) boundary conditions (BC) have been introduced recently in connection with fast deblurring algorithms, both in the case of signals and images. Here we extend such BCs to d dimensions (d ≥ 1) and we study in detail the algebra induced by the AR-BCs, with strongly symmetric point spread functions (PSF), both from a structural and computational point of view. The use of the re-blurring idea and the computational features of the AR-algebra allow us to apply Tikhonov-like techniques within O(n ^d log(n)) arithmetic operations, where n ^d is the number of pixels of the reconstructed object. Extensive numerical experimentation concerning 2D images and strongly symmetric PSFs confirms the effectiveness of our proposal.      

稀疏约束的时空正则相关滤波无人机视觉跟踪

目的 基于相关滤波的跟踪算法在无人机(unmanned aerial vehicle,UAV)视觉跟踪领域表现出卓越的性能。现有的相关滤波类跟踪算法从样本区域的所有特征中学习滤波器,然而某些来自遮挡或形变的特征可能会污染滤波器,降低模型判别能力。针对此问题,提出一种稀疏约束的时空正则相关滤波跟踪算法。方法 在相关滤波目标函数上施加空间弹性网络约束以自适应地抑制跟踪过程中的干扰特征,同时集成空间—时间正则相关滤波算法(spatial-temporal regularized correlation filter,STRCF)中的时间正则项以增强滤波器抑制畸变的能力。采用交替方向乘子法(alternating direction method of multipliers,ADMM)将带有约束项的目标函数转化为两个具有闭式解的子问题迭代求局部最优解。此外,提出一种相关滤波框架通用的加速策略,根据当前帧的目标位移量,对检测定位阶段的特征矩阵进行等距离的循环移位,将其作为在线学习阶段的特征矩阵,每帧可节省一次训练样本的特征提取操作,提高跟踪速度。结果 在3个UAV数据集上与14种主流跟踪算法进...     

基于B2B-MMC的柔性互联变电站优化调度方法

针对传统变电站内主变之间采用单母线分段开关难以准确调控潮流问题,提出一种基于背靠背模块化多电平换流器（B2B-MMC）的柔性互联变电站优化调度方法。首先,提出含柔性互联变电站的配电网架构,实现潮流的连续性控制及多区域间互相协调;然后,设计柔性互联变电站架构下的一种潮流优化调度方法,采用遗传算法对换流器进行赋值,利用改进交替迭代法进行潮流计算,实现配电网潮流的主动调控;最后,通过仿真模型验证了本文所提控制方法的有效性和合理性。     

增量式块主成分分析的焊缝图像特征提取算法北大核心CSCD

针对焊缝图像特征提取的实时性问题,该文提出一种增量式块主成分分析(incremental block principal component analysis,IBlockPCA)算法,用于焊缝特征主成分的提取。该算法先将焊缝表面图像分割成子图像块并对其进行重构,然后利用提出的IBlockPCA算法对局部块图像进行增量式特征提取,并采用KNN算法对提取的特征主成分进行分类识别;最后在焊缝数据集上进行了算法的性能对比。实验结果表明,该算法在收敛率、分类率及复杂度等方面均优于其他主成分分析(principal component analysis,PCA)算法,其分类识别率为97.5%,其平均处理速度可达50 frame/s,能够满足焊缝表面图像的实时性处理需求。     

Cold-Start Link Prediction via Weighted Symmetric Nonnegative Matrix Factorization with Graph Regularization

Link prediction has attracted wide attention among interdisciplinary researchers as an important issue in complex network. It aims to predict the missing links in current networks and new links that will appear in future networks. Despite the presence of missing links in the target network of link prediction studies, the network it processes remains macroscopically as a large connected graph. However, the complexity of the real world makes the complex networks abstracted from real systems often contain many isolated nodes. This phenomenon leads to existing link prediction methods not to efficiently implement the prediction of missing edges on isolated nodes. Therefore, the cold-start link prediction is favored as one of the most valuable subproblems of traditional link prediction. However, due to the loss of many links in the observation network, the topological information available for completing the link prediction task is extremely scarce. This presents a severe challenge for the study of cold-start link prediction. Therefore, how to mine and fuse more available non-topological information from observed network becomes the key point to solve the problem of cold-start link prediction. In this paper, we propose a framework for solving the cold-start link prediction problem, a joint-weighted symmetric nonnegative matrix factorization model fusing graph regularization information, based on low-rank approximation algorithms in the field of machine learning. First, the nonlinear features in high-dimensional space of node attributes are captured by the designed graph regularization term. Second, using a weighted matrix, we associate the attribute similarity and first order structure information of nodes and constrain each other. Finally, a unified framework for implementing cold-start link prediction is constructed by using a symmetric nonnegative matrix factorization model to integrate the multiple information extracted together. Extensive experimental validation on five real networks with attributes shows that the proposed model has very good predictive performance when predicting missing edges of isolated nodes.