Efficient modal identification and optimal sensor placement via dynamic DIC measurement and feature-based data compression

Wang, Weizhuo ORCID: https://orcid.org/0000-0002-1225-4011 (2023) Efficient modal identification and optimal sensor placement via dynamic DIC measurement and feature-based data compression. Vibration, 6 (4). pp. 820-842. ISSN 2571-631X

Preview

Published Version Available under License Creative Commons Attribution. Download (3MB) | Preview

Abstract

Full-field non-contact vibration measurements provide a rich dataset for analysing structural dynamics. However, implementing the identification algorithm directly using high-spatial resolution data can be computationally expensive in modal identification. To address this challenge, performing identification in a shape-preserving but lower-dimensional feature space is more feasible. The full-field mode shapes can then be reconstructed from the identified feature mode shapes. This paper discusses two approaches, namely data-dependent and data-independent, for constructing the feature spaces. The applications of these approaches to modal identification on a curved plate are studied, and their performance is compared. In a case study involving a curved plate, it was found that a spatial data compression ratio as low as 1% could be achieved without compromising the integrity of the shape features essential for a full-field modal. Furthermore, the paper explores the optimal point-wise sensor placement using the feature space. It presents an alternative, data-driven method for optimal sensor placement that eliminates the need for a normal model, which is typically required in conventional approaches. Combining a small number of point-wise sensors with the constructed feature space can accurately reconstruct the full-field response. This approach demonstrates a two-step structural health monitoring (SHM) preparation process: offline full-field identification of the structure and the recommended point-wise sensor placement for online long-term monitoring.