Copy Move Forgery Detection based on double matching

Copy Move is a technique widespreadly used in digital image tampering, meaning Copy Move Forgery Detection (CMFD) is still a significant research. In this paper, a novel CMFD method is proposed, including double matching process and region localizing process. In double matching process, the first matching is conducted on Delaunay triangles consisting of Local Intensity Order Pattern (LIOP) keypoints, to find the approximate location of suspicious regions. In order to find sufficient keypoint pairs, the existing set of matching triangles is expanded by adding their neighbors iteratively, covering the whole tampered regions, and the second matching with a looser threshold is conducted on the vertices. In the region localizing process, considering the case of multiple copies, Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is used to classify the keypoint pairs described in a new model. Experimental results indicate that the proposed method, with good robustness, outperforms some state-of-the-art methods.     

A new linearly constrained minimum variance beamformer for reconstructing EEG sparse sources

Brain source imaging based on EEG aims to reconstruct the neural activities producing the scalp potentials. This includes solving the forward and inverse problems. The aim of the inverse problem is to estimate the activity of the brain sources based on the measured data and leadfield matrix computed in the forward step. Spatial filtering, also known as beamforming, is an inverse method that reconstructs the time course of the source at a particular location by weighting and linearly combining the sensor data. In this paper, we considered a temporal assumption related to the time course of the source, namely sparsity, in the Linearly Constrained Minimum Variance (LCMV) beamformer. This assumption sounds reasonable since not all brain sources are active all the time such as epileptic spikes and also some experimental protocols such as electrical stimulations of a peripheral nerve can be sparse in time. Developing the sparse beamformer is done by incorporating L1-norm regularization of the beamformer output in the relevant cost function while obtaining the filter weights. We called this new beamformer SParse LCMV (SP-LCMV). We compared the performance of the SP-LCMV with that of LCMV for both superficial and deep sources with different amplitudes using synthetic EEG signals. Also, we compared them in localization and reconstruction of sources underlying electric median nerve stimulation. Results show that the proposed sparse beamformer can enhance reconstruction of sparse sources especially in the case of sources with high amplitude spikes.     

具有自动装卸搬运机器人的制造单元建模与分析

针对具有自动装卸搬运机器人的制造单元，着重考虑其双重资源约束的特点，提出了该系统的有限缓冲开排队网的建模方法。根据工件的加工、装卸与搬运等工艺流程，定义该系统的排队网模型的各种状态，基于连续时间马尔可夫链，采用精确解法对该模型进行分析求解，获得系统一系列的稳态性能指标。为了验证排队网建模方法的有效性，建立其对应的仿真模型，分别采用排队网模型的数值计算与仿真模型的仿真统计2种方法求出系统的性能指标进行对比，并基于排队网模型对该制造单元的系统性能进行分析，为该类制造单元的资源配置优化和设施布局优化等问题提供重要的理论支撑。     

Parameter estimation for a morphochemical reaction-diffusion model of electrochemical pattern formation

The process of electrodeposition can be described in terms of a reaction-diffusion partial differential equation (PDE) system that models the dynamics of the morphology profile and the chemical composition. Here we fit such a model to the different patterns present in a range of electrodeposited and electrochemically modified alloys using PDE constrained optimization. Experiments with simulated data show how the parameter space of the model can be divided into zones corresponding to the different physical patterns by examining the structure of an appropriate cost function. We then use real data to demonstrate how numerical optimization of the cost function can allow the model to fit the rich variety of patterns arising in experiments. The computational technique developed provides a potential tool for tuning experimental parameters to produce desired patterns.     

基于激光三角法的汽车同步带齿形轮廓参数测量

针对目前汽车同步带齿形轮廓参数测量过程中存在的测量效率低和人为因素影响大等问题,提出了一种基于激光三角法的汽车同步带齿形轮廓参数非接触式测量方案,并设计了相应的汽车同步带齿形测量装置。该装置通过激光位移传感器与汽车同步带传动速度的配合,对汽车同步带齿形轮廓数据进行采集,并提出一种改进后的分割算法对采集到的齿形截面轮廓数据进行特征分割。通过对分割后齿形数据的拟合,实现了齿形轮廓曲线特征的分段重构并获得被测带齿的轮廓参数。基于激光三角法对汽车同步带齿形轮廓参数进行测量,实现了对齿形轮廓参数自动测量提高了测量效率避免了人为因素的影响,保证了测量精度,有望在汽车同步带实际生产中得到应用。     

桥梁检测机器人作业规划与位姿优化方法研究

针对桥梁底部病害人工检测的作业难题,介绍了桥梁检测机器人的工作原理,结合桥梁的结构化特征和视觉检测拍摄参数约束,研究了桥梁检测机器人作业规划与位姿优化方法。首先,提出一种以最佳拍摄模型约束的桥梁检测机器人拍摄作业位姿规划方法。在最佳拍摄规划方法的基础上,针对小箱梁桥梁和T型梁桥梁底部的褶皱结构,研究了以安全拍摄模型为约束的拍摄位姿优化方法,设计了结合拍摄偏角和拍摄距离的权重函数,推导了优化算法公式并给出了收敛证明。通过对不同拍摄参数的配置,进行了针对空心板桥梁的拍摄作业位姿规划方法仿真;针对小箱梁桥梁的结构,在位姿规划仿真结果基础上进行了位姿优化方法的仿真。最后以研制的桥梁检测机器人为对象,进行了现场测试与验证,仿真和实验结果均表明,该规划和优化方法符合桥梁拍摄检测的要求,具有很好的鲁棒性和实时性。     

焊缝表面缺陷激光扫描三维重构测量

为检测工件焊缝表面缺陷，采用点激光位移传感测距法和数据拟合技术进行焊缝表面缺陷检测试验研究. 首先采集缺陷表面轮廓数据点，利用高斯滤波对原始数据降噪处理. 再对处理后的数据点进行Delaunay三角剖分，使散乱点连接并结合其空间坐标重构出缺陷的三维模型. 结果表明，基于点激光位移传感测距技术及焊缝表面缺陷三维重构方法可以准确判断焊缝成形情况.     

Multi-resource scheduling for FPGA systems

In modern cloud data centers, reconfigurable devices (FPGAs) are used as an alternative to Graphics Processing Units to accelerate data-intensive computations (e.g., machine learning, image and signal processing). Currently, FPGAs are configured to execute fixed workloads, repeatedly over long periods of time. This conflicts with the needs, proper to cloud computing, to flexibly allocate different workloads and to offer the use of physical devices to multiple users. This raises the need for novel, efficient FPGA scheduling algorithms that can decide execution orders close to the optimum in a short time. In this context, we propose a novel scheduling heuristic where groups of tasks that execute together are interposed by hardware reconfigurations. Our contribution is based on gathering tasks around a high-latency task that hides the latency of tasks, within the same group, that run in parallel and have shorter latencies. We evaluated our solution on a benchmark of 37500 random workloads, synthesized from realistic designs (i.e., topology, resource occupancy). For this testbench, on average, our heuristic produces optimum makespan solutions in 47.4% of the cases. It produces acceptable solutions for moderately constrained systems (i.e., the deadline falls within 10% of the optimum makespan) in 90.1% of the cases.