Performance of sub-pixel registration algorithms in digital image correlation | |
Pan, Bing ; Xie, Hui-min ; Xu, Bo-qin ; Dai, Fu-long | |
2010-05-07 ; 2010-05-07 | |
关键词 | digital image correlation sub-pixel curve-fitting gradient-based algorithm Newton-Raphson method DEFORMATION MEASUREMENTS SPECKLE CORRELATION SYSTEMATIC-ERRORS STRAIN DISPLACEMENT GRADIENT Engineering, Multidisciplinary Instruments & Instrumentation |
中文摘要 | 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. |
语种 | 英语 ; 英语 |
出版者 | IOP PUBLISHING LTD ; BRISTOL ; DIRAC HOUSE, TEMPLE BACK, BRISTOL BS1 6BE, ENGLAND |
内容类型 | 期刊论文 |
源URL | [http://hdl.handle.net/123456789/16063] ![]() |
专题 | 清华大学 |
推荐引用方式 GB/T 7714 | Pan, Bing,Xie, Hui-min,Xu, Bo-qin,et al. Performance of sub-pixel registration algorithms in digital image correlation[J],2010, 2010. |
APA | Pan, Bing,Xie, Hui-min,Xu, Bo-qin,&Dai, Fu-long.(2010).Performance of sub-pixel registration algorithms in digital image correlation.. |
MLA | Pan, Bing,et al."Performance of sub-pixel registration algorithms in digital image correlation".(2010). |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论