A sub-Nyquist co-prime sampling music spectral approach for natural frequency identification of white-noise excited structures

Motivated by practical needs to reduce data transmission payloads in wireless sensors for vibration-based monitoring of civil engineering structures, this paper proposes a novel approach for identifying resonant frequencies of white-noise excited structures using acceleration measurements acquired at rates significantly below the Nyquist rate. The approach adopts the deterministic co-prime sub-Nyquist sampling scheme, originally developed to facilitate telecommunication applications, to estimate the autocorrelation function of response acceleration time-histories of low-amplitude white-noise excited structures treated as realizations of a stationary stochastic process. This is achieved without posing any sparsity conditions to the signals. Next, the standard MUSIC algorithm is applied to the estimated autocorrelation function to derive a denoised super-resolution pseudo-spectrum in which natural frequencies are marked by prominent spikes. The accuracy and applicability of the proposed approach is numerically assessed using computer-generated noise-corrupted acceleration time-history data obtained by a simulation-based framework pertaining to a white-noise excited structural system with two closely-spaced modes of vibration carrying the same amount of energy, and a third isolated weakly excited vibrating mode. All three natural frequencies are accurately identified by sampling at as low as 78% below Nyquist rate for signal to noise ratio as low as 0dB (i.e., energy of additive white noise equal to the signal energy), suggesting that the proposed approach is robust and noise-immune while it can reduce data transmission requirements in acceleration wireless sensors for natural frequency identification of engineering structures

Theory and Algorithms for Reliable Multimodal Data Analysis, Machine Learning, and Signal Processing

Modern engineering systems collect large volumes of data measurements across diverse sensing modalities. These measurements can naturally be arranged in higher-order arrays of scalars which are commonly referred to as tensors. Tucker decomposition (TD) is a standard method for tensor analysis with applications in diverse fields of science and engineering. Despite its success, TD exhibits severe sensitivity against outliers —i.e., heavily corrupted entries that appear sporadically in modern datasets. We study L1-norm TD (L1-TD), a reformulation of TD that promotes robustness. For 3-way tensors, we show, for the first time, that L1-TD admits an exact solution via combinatorial optimization and present algorithms for its solution. We propose two novel algorithmic frameworks for approximating the exact solution to L1-TD, for general N-way tensors. We propose a novel algorithm for dynamic L1-TD —i.e., efficient and joint analysis of streaming tensors. Principal-Component Analysis (PCA) (a special case of TD) is also outlier responsive. We consider Lp-quasinorm PCA (Lp-PCA) for