Compressive and Noncompressive Power Spectral Density Estimation from Periodic Nonuniform Samples

This paper presents a novel power spectral density estimation technique for band-limited, wide-sense stationary signals from sub-Nyquist sampled data. The technique employs multi-coset sampling and incorporates the advantages of compressed sensing (CS) when the power spectrum is sparse, but applies to sparse and nonsparse power spectra alike. The estimates are consistent piecewise constant approximations whose resolutions (width of the piecewise constant segments) are controlled by the periodicity of the multi-coset sampling. We show that compressive estimates exhibit better tradeoffs among the estimator's resolution, system complexity, and average sampling rate compared to their noncompressive counterparts. For suitable sampling patterns, noncompressive estimates are obtained as least squares solutions. Because of the non-negativity of power spectra, compressive estimates can be computed by seeking non-negative least squares solutions (provided appropriate sampling patterns exist) instead of using standard CS recovery algorithms. This flexibility suggests a reduction in computational overhead for systems estimating both sparse and nonsparse power spectra because one algorithm can be used to compute both compressive and noncompressive estimates.Comment: 26 pages, single spaced, 9 figure

Sparse representations and harmonic wavelets for stochastic modeling and analysis of diverse structural systems and related excitations

In this thesis, novel analytical and computational approaches are proposed for addressing several topics in the field of random vibration. The first topic pertains to the stochastic response determination of systems with singular parameter matrices. Such systems appear, indicatively, when a redundant coordinate modeling scheme is adopted. This is often associated with computational cost-efficient solution frameworks and modeling flexibility for treating complex systems. Further, structures are subject to environmental excitations, such as ground motions, that typically exhibit non-stationary characteristics. In this regard, aiming at a joint time-frequency analysis of the system response a recently developed generalized harmonic wavelet (GHW)-based solution framework is employed in conjunction with tools originated form the generalized matrix inverse theory. This leads to a generalization of earlier excitation-response relationships of random vibration theory to account for systems with singular matrices. Harmonic wavelet-based statistical linearization techniques are also extended to nonlinear multi-degree-of-freedom (MDOF) systems with singular matrices. The accuracy of the herein proposed framework is further improved by circumventing previous “local stationarity” assumptions about the response. Furthermore, the applicability of the method is extended beyond redundant coordinate modeling applications. This is achieved by a formulation which accounts for generally constrained equations of motion pertaining to diverse engineering applications. These include, indicatively, energy harvesters with coupled electromechanical equations and oscillators subject to non-white excitations modeled via auxiliary filter equations. The second topic relates to the probabilistic modeling of excitation processes in the presence of missing data. In this regard, a compressive sampling methodology is developed for incomplete wind time-histories reconstruction and extrapolation in a single spatial dimension, as well as for related stochastic field statistics estimation. An alternative methodology based on low rank matrices and nuclear norm minimization is also developed for wind field extrapolation in two spatial dimensions. The proposed framework can be employed for monitoring of wind turbine systems utilizing information from a few measured locations as well as in the context of performance-based design optimization of structural systems. Lastly, the problem of with data-driven sparse identification methods of nonlinear dynamics is considered. In particular, utilizing measured responses a Bayesian compressive sampling technique is developed for determining the governing equations of stochastically excited structural systems exhibiting diverse nonlinear behaviors and also endowed with fractional derivative elements. Compared to alternative state-of-the-art schemes that yield deterministic estimates for the identified model, the herein developed methodology exhibits additional sparsity promoting features and is capable of quantifying the uncertainty associated with the model estimates. This provides a quantifiable degree of confidence when employing the proposed framework as a predictive tool

Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

Structured random measurements in signal processing

Compressed sensing and its extensions have recently triggered interest in randomized signal acquisition. A key finding is that random measurements provide sparse signal reconstruction guarantees for efficient and stable algorithms with a minimal number of samples. While this was first shown for (unstructured) Gaussian random measurement matrices, applications require certain structure of the measurements leading to structured random measurement matrices. Near optimal recovery guarantees for such structured measurements have been developed over the past years in a variety of contexts. This article surveys the theory in three scenarios: compressed sensing (sparse recovery), low rank matrix recovery, and phaseless estimation. The random measurement matrices to be considered include random partial Fourier matrices, partial random circulant matrices (subsampled convolutions), matrix completion, and phase estimation from magnitudes of Fourier type measurements. The article concludes with a brief discussion of the mathematical techniques for the analysis of such structured random measurements.Comment: 22 pages, 2 figure

Data based identification and prediction of nonlinear and complex dynamical systems

We thank Dr. R. Yang (formerly at ASU), Dr. R.-Q. Su (formerly at ASU), and Mr. Zhesi Shen for their contributions to a number of original papers on which this Review is partly based. This work was supported by ARO under Grant No. W911NF-14-1-0504. W.-X. Wang was also supported by NSFC under Grants No. 61573064 and No. 61074116, as well as by the Fundamental Research Funds for the Central Universities, Beijing Nova Programme.Peer reviewedPostprin