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.     

基于改进Delaunay三角剖分的空间目标红外辐射成像方法

空间目标的红外成像仿真技术在军事国防、空间探测等领域都具有重要意义。本文提出了一种基于改进Delaunay三角剖分的空间目标红外辐射成像方法。此方法首先根据空间目标热平衡方程,利用节点网络法求解出目标的各节点温度,然后利用STK得出探测器、目标、地球与太阳的位置关系,随后由目标节点温度求得目标红外辐射强度,最后采用提出的改进Delaunay三角剖分的方法重建目标得到红外图像。本文以某卫星为例进行了成像仿真实验,实验验证了本文成像方法的有效性与高效性,对空间目标的红外探测与识别具有重要价值。     

可自适应位移变化的玻璃厚度激光三角测量方法

传统的激光三角法测量玻璃厚度时,玻璃与测头的相对位置需保持固定,每当玻璃位置移动时,均需重新标定才能进行准确测量。针对这一问题,提出可自适应位移变化的玻璃厚度激光三角测量方法,玻璃在不同位置时均可以直接对玻璃厚度进行测量。首先分析当玻璃位于基准位置时,其前、后表面反射光的成像光斑间距与玻璃厚度之间的关系;其次分析当玻璃位移变化时,成像光斑间距与玻璃前表面位置、玻璃厚度之间的关系,建立数学模型,并相应地提出修正算法来消除玻璃位移变化对厚度测量的影响;最后设计了基于激光二极管-互补金属氧化物半导体(LD-CMOS)的激光三角测量系统,并采用多块已知厚度的玻璃样本进行标定和测量实验。实验结果表明,当玻璃位置在1~4.5 mm的范围内变动时,不同位置处玻璃厚度测量的绝对误差小于0.010 mm,并且相对误差均在0.5%以内。该方法实现了玻璃在不同位置时对玻璃厚度的高精度测量,无需重复标定,具有很好的实用性、灵活性和通用性。     

Efficiently navigating a random Delaunay triangulation

Planar graph navigation is an important problem with significant implications to both point location in geometric data structures and routing in networks. However, whilst a number of algorithms and existence proofs have been proposed, very little analysis is available for the properties of the paths generated and the computational resources required to generate them under a random distribution hypothesis for the input. In this paper we analyse a new deterministic planar navigation algorithm with constant spanning ratio (w.r.t the Euclidean distance) which follows vertex adjacencies in the Delaunay triangulation. We call this strategy cone walk. We prove that given n uniform points in a smooth convex domain of unit area, and for any start point z and query point q; cone walk applied to z and q will access at most sites with complexity with probability tending to 1 as n goes to infinity. We additionally show that in this model, cone walk is ‐memoryless with high probability for any pair of start and query point in the domain, for any positive ξ. We take special care throughout to ensure our bounds are valid even when the query points are arbitrarily close to the border. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 95–136, 2016     

空间编码与灰度投影相结合实现高效3-D形貌测量的研究

介绍了一种结合空间编码与灰度投影来实现高效三维形貌测量的方法。用空间编码完成对被测空间的粗略编码,用灰度投影完成精确编码,将它们结合起来得到被测物体表面丰富的编码信息,作为一种基于三角法的三维形貌测量方法,能够在物体表面非常不连续和外部光照造成的背景光强分布不确定的情况下工作良好。同时,与传统的空间编码方法相比,它大大提高了空间编码的效率。实验表明,该方法用５ 幅图像取得了与灰度码１０幅图像相当的测量结果。     

基于空间二进制编码的3 D形貌测量方法

介绍了一种基于空间二进制编码的非接触３ Ｄ 形貌测量方法。它用一台ＬＣＤ 投影仪对被测物体表面进行空间编码,再用一台ＣＣＤ 摄像机获取物体编码信息,最后用三角法原理从摄像机图像中获取三维形貌数据。提出了基于三角法的空间二进制码的重要特性,描述了高效编码的构造方法。用这个构造方法构造出一个完全数字化的７ 位字长的二进制编码。基于这种编码的３ Ｄ 形貌测量方法在被测物体表面非常不连续和非构造的环境下取得了良好的测量结果。     

Computing a Minimum Weight Triangulation of a Sparse Point Set*

Investigating the minimum weight triangulation of a point set with constraint is an important approach for seeking the ultimate solution of the minimum weight triangulation problem. In this paper, we consider the minimum weight triangulation of a sparse point set, and present an O(n ⁴) algorithm to compute a triangulation of such a set. The property of sparse point set can be converted into a new sufficient condition for finding subgraphs of the minimum weight triangulation. A special point set is exhibited to show that our new subgraph of minimum weight triangulation cannot be found by any currently known methods.     

Anisotropic unstructured mesh adaption for flow simulations

Three new ideas for anisotropic adaption of unstructured triangular grids are presented, with particular emphasis on fluid flow computations. © 1997 John Wiley & Sons, Ltd.