The standard Digital Image Correlation (DIC) algorithm samples the Region of Interest (ROI) on a regular grid to describe the displacement field on a specimen. In each sampling point, a local problem is solved. Thus, apart from the oversampling usually used when selecting the grid parameters, the solutions related to each point are statistically independent. This approach is general but usually over-restraining because the measured displacement fields are usually continuous. Using global shape functions may thus give some advantages in terms of accuracy and computational time. The standard way to achieve this objective is using a Finite-Elements-like approach, but other options are possible. This work focuses on using Radial Base Functions: various approaches to globally describe the displacement fields are possible, and different families of functions exist. We intend to compare some of them, looking at the performance (accuracy), implementation complexity, and computational time.
On the use of RBF for global field description in DIC
A. Baldi
;P. M. Santucci
In corso di stampa
Abstract
The standard Digital Image Correlation (DIC) algorithm samples the Region of Interest (ROI) on a regular grid to describe the displacement field on a specimen. In each sampling point, a local problem is solved. Thus, apart from the oversampling usually used when selecting the grid parameters, the solutions related to each point are statistically independent. This approach is general but usually over-restraining because the measured displacement fields are usually continuous. Using global shape functions may thus give some advantages in terms of accuracy and computational time. The standard way to achieve this objective is using a Finite-Elements-like approach, but other options are possible. This work focuses on using Radial Base Functions: various approaches to globally describe the displacement fields are possible, and different families of functions exist. We intend to compare some of them, looking at the performance (accuracy), implementation complexity, and computational time.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.