Performance of sub-pixel registration algorithms in digital image correlation
Performance of sub-pixel registration algorithms in digital image correlation
复制标题
DOI：
10.1088/0957-0233/17/6/045
复制
发表时间：
2006-06-01
影响因子：
2.4
通讯作者：
Dai, Fu-long
中科院分区：
文献类型：
--
作者：
Pan, Bing;Xie, Hui-min;Dai, Fu-long
近二十年来，数字图像相关技术的发展使其成为实验力学中全场位移和应变测量的流行和有效的工具。在数字图像相关中，采用亚像素配准算法是提高精度的关键技术。已经开发了不同类型的亚像素配准算法。然而，很少有定量的研究已经进行了比较他们的表现。本文利用计算机模拟散斑图像，从配准精度和计算效率两个方面研究了三种常用的亚像素位移配准算法。对每种算法的性能进行了详细的研究，结果表明迭代空域互相关算法（牛顿-拉夫森方法）更准确，但比其他算法慢得多，建议在这些应用中使用。
Developments in digital image correlation in the last two decades have made it a popular and effective tool for full-field displacement and strain measurements in experimental mechanics. In digital image correlation, the use of the sub-pixel registration algorithm is regarded as the key technique to improve accuracy. Different types of sub-pixel registration algorithms have been developed. However, little quantitative research has been carried out to compare their performances. This paper investigates three types of the most commonly used sub-pixel displacement registration algorithms in terms of the registration accuracy and the computational efficiency using computer-simulated speckle images. A detailed examination of the performances of each algorithm reveals that the iterative spatial domain cross-correlation algorithm (Newton-Raphson method) is more accurate, but much slower than other algorithms, and is recommended for use in these applications.