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.     

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.     

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

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

原对偶积极集法求解改进的有界约束图像恢复问题

为了提高模糊加噪声图像的恢复质量,提出了一种用于图像恢复处理的改进的带约束的正则化模型。该模型首先利用Levine等人提出的变指数、线性增长函数作为正则项,并根据图像局部特征选择合适的正则参数,这样既保留了总变差正则化方法在恢复图像边缘方面的优势,又减少了梯子现象;其次,为进一步提高恢复图像的质量,在此基础上再添加有界约束条件,如将灰度值固定在某范围内,以形成约束优化问题。由于它的求解相对复杂,为此可应用原对偶积极集法求解,其实质就是用半光滑Newton法来求解由约束优化问题转化所得到的方程组。数值实验表明,此方法是可行的和有效的。     

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种主流跟踪算法进...     

基于Hessian图正则稀疏NMF的高光谱解混

基于非负矩阵分解(Nonnegative Matrix Factorization, NMF)的高光谱解混(Hyperspectral Unmixing,HU)方法引起了大家的关注,因为可以将一个非负高光谱图像(Hyperspectral Imagery, HSI)数据矩阵分解为两个非负矩阵的乘积,分别对应于端元矩阵和丰度系数矩阵。目前,图约束的NMF算法已经被证明对高光谱解混是有效的,因为它们可以捕获HSI的几何特性。为了挖掘数据在混合过程中的几何结构和稀疏性,提出了一种稀疏的Hessian图正则化NMF(SHGNMF)算法。SHGNMF算法是将丰度矩阵的L1/2正则化器和Hessian图正则化项都添加到每个NMF模型中,同时采用乘法更新规则。最后用模拟数据和真实数据进行实验,验证了所提出的SHGNMF算法相对于其他NMF算法的优越性。     

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.     

Optimal parameters identification and sensitivity study for abrasive waterjet milling model

In this paper we present the work related to the parameters identification for abrasive waterjet milling (AWJM) model that appears as an ill-posed inverse problem. The necessity of studying this problem comes from the industrial milling applications where the possibility to predict and model the final surface with high accuracy is one of the primary tasks in the absence of any knowledge of the model parameters that should be used. The adjoint approach based on corresponding Lagrangian gives the opportunity to find out the unknowns of the AWJM model and their optimal values that could be used to reproduce the required trench profile. Due to the complexity of the nonlinear problem and the large number of the model parameters, we use an automatic differentiation software tool. This approach also gives us the ability to distribute the research on more complex cases and consider different types of model errors and 3D time dependent model with variations of the jet feed speed. This approach gives us a good opportunity to identify the optimal model parameters and predict the surface profile both with self-generated data and measurements obtained from the real production. Considering different types of model errors allows us to receive the results acceptable in manufacturing and to expect the proper identification of unknowns.