Time-scale analysis of abrupt changes corrupted by multiplicative noise

Multiplicative Abrupt Changes (ACs) have been considered in many applications. These applications include image processing (speckle) and random communication models (fading). Previous authors have shown that the Continuous Wavelet Transform (CWT) has good detection properties for ACs in additive noise. This work applies the CWT to AC detection in multiplicative noise. CWT translation invariance allows to define an AC signature. The problem then becomes signature detection in the time-scale domain. A second-order contrast criterion is defined as a measure of detection performance. This criterion depends upon the first- and second-order moments of the multiplicative process's CWT. An optimal wavelet (maximizing the contrast) is derived for an ideal step in white multiplicative noise. This wavelet is asymptotically optimal for smooth changes and can be approximated for small AC amplitudes by the Haar wavelet. Linear and quadratic suboptimal signature-based detectors are also studied. Closed-form threshold expressions are given as functions of the false alarm probability for three of the detectors. Detection performance is characterized using Receiver Operating Characteristic (ROC) curves computed from Monte-Carlo simulations

Wavelet Analysis and Denoising: New Tools for Economists

This paper surveys the techniques of wavelets analysis and the associated methods of denoising. The Discrete Wavelet Transform and its undecimated version, the Maximum Overlapping Discrete Wavelet Transform, are described. The methods of wavelets analysis can be used to show how the frequency content of the data varies with time. This allows us to pinpoint in time such events as major structural breaks. The sparse nature of the wavelets representation also facilitates the process of noise reduction by nonlinear wavelet shrinkage , which can be used to reveal the underlying trends in economic data. An application of these techniques to the UK real GDP (1873-2001) is described. The purpose of the analysis is to reveal the true structure of the data - including its local irregularities and abrupt changes - and the results are surprising.Wavelets, Denoising, Structural breaks, Trend estimation

Forecasting Time Series with VARMA Recursions on Graphs

Graph-based techniques emerged as a choice to deal with the dimensionality issues in modeling multivariate time series. However, there is yet no complete understanding of how the underlying structure could be exploited to ease this task. This work provides contributions in this direction by considering the forecasting of a process evolving over a graph. We make use of the (approximate) time-vertex stationarity assumption, i.e., timevarying graph signals whose first and second order statistical moments are invariant over time and correlated to a known graph topology. The latter is combined with VAR and VARMA models to tackle the dimensionality issues present in predicting the temporal evolution of multivariate time series. We find out that by projecting the data to the graph spectral domain: (i) the multivariate model estimation reduces to that of fitting a number of uncorrelated univariate ARMA models and (ii) an optimal low-rank data representation can be exploited so as to further reduce the estimation costs. In the case that the multivariate process can be observed at a subset of nodes, the proposed models extend naturally to Kalman filtering on graphs allowing for optimal tracking. Numerical experiments with both synthetic and real data validate the proposed approach and highlight its benefits over state-of-the-art alternatives.Comment: submitted to the IEEE Transactions on Signal Processin

Tensor decompositions for learning latent variable models

This work considers a computationally and statistically efficient parameter estimation method for a wide class of latent variable models---including Gaussian mixture models, hidden Markov models, and latent Dirichlet allocation---which exploits a certain tensor structure in their low-order observable moments (typically, of second- and third-order). Specifically, parameter estimation is reduced to the problem of extracting a certain (orthogonal) decomposition of a symmetric tensor derived from the moments; this decomposition can be viewed as a natural generalization of the singular value decomposition for matrices. Although tensor decompositions are generally intractable to compute, the decomposition of these specially structured tensors can be efficiently obtained by a variety of approaches, including power iterations and maximization approaches (similar to the case of matrices). A detailed analysis of a robust tensor power method is provided, establishing an analogue of Wedin's perturbation theorem for the singular vectors of matrices. This implies a robust and computationally tractable estimation approach for several popular latent variable models

The estimation of geoacoustic properties from broadband acoustic data, focusing on instantaneous frequency techniques

The compressional wave velocity and attenuation of marine sediments are fundamental to marine science. In order to obtain reliable estimates of these parameters it is necessary to examine in situ acoustic data, which is generally broadband. A variety of techniques for estimating the compressional wave velocity and attenuation from broadband acoustic data are reviewed. The application of Instantaneous Frequency (IF) techniques to data collected from a normal-incidence chirp profiler is examined. For the datasets examined the best estimates of IF are obtained by dividing the chirp profile into a series of sections, estimating the IF of each trace in the section using the first moments of the Wigner Ville distribution, and stacking the resulting IF to obtain a composite IF for the section. As the datasets examined cover both gassy and saturated sediments, this is likely to be the optimum technique for chirp datasets collected from all sediment environments