• Corpus ID: 219792213

Offline detection of change-points in the mean for stationary graph signals

@article{Concha2021OfflineDO,
  title={Offline detection of change-points in the mean for stationary graph signals},
  author={Alejandro de la Concha and Nicolas Vayatis and Argyris Kalogeratos},
  journal={ArXiv},
  year={2021},
  volume={abs/2006.10628}
}
This paper addresses the problem of segmenting a stream of graph signals: we aim to detect changes in the mean of the multivariate signal defined over the nodes of a known graph. We propose an offline algorithm that relies on the concept of graph signal stationarity and allows the convenient translation of the problem from the original vertex domain to the spectral domain (Graph Fourier Transform), where it is much easier to solve. Although the obtained spectral representation is sparse in real… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 34 REFERENCES

Stationary Graph Processes and Spectral Estimation

This paper proposes a definition of weak stationarity for random graph signals that takes into account the structure of the graph where the random process takes place, while inheriting many of the meaningful properties of the classical time domain definition.

Change-Point Detection of Gaussian Graph Signals with Partial Information

This work proposes a CUSUM-based algorithm for change-point detection with an arbitrary, unknown and perhaps time-varying mean shift after the change- point, and proposes a decentralized, distributed algorithm, which requires no fusion center, to reduce computational complexity, as well as costs and delays of communication.

Learning Laplacian Matrix from Bandlimited Graph Signals

The conducted experimental evaluation shows that the proposed algorithm to solve this problem outperforms a reference state-of-the-art method that is based only on the smoothness assumption, when compared in the graph learning task on synthetic and real graph signals.

Stationary Signal Processing on Graphs

This paper generalizes the traditional concept of wide sense stationarity to signals defined over the vertices of arbitrary weighted undirected graphs and shows that stationarity is expressed through the graph localization operator reminiscent of translation.

The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains

This tutorial overview outlines the main challenges of the emerging field of signal processing on graphs, discusses different ways to define graph spectral domains, which are the analogs to the classical frequency domain, and highlights the importance of incorporating the irregular structures of graph data domains when processing signals on graphs.

Learning the piece-wise constant graph structure of a varying Ising model

The aim is to identify both the moments at which significant changes occur in the Ising model, as well as the underlying graph structures, by proposing to estimate the neighborhood of each node by maximizing a penalized version of its conditional log-likelihood.

Detecting multiple change-points in the time-varying Ising model

A new optimization program consisting in the minimization of a penalized negative conditional log-likelihood is proposed, which gives a change-point consistency theorem, the first to present such theoretical result in the context of time-varying Ising model.

Discrete Signal Processing on Graphs

This paper extends to signals on graphs DSP and its basic tenets, including filters, convolution, z-transform, impulse response, spectral representation, Fourier transform, frequency response, and illustrates DSP on graphs by classifying blogs, linear predicting and compressing data from irregularly located weather stations, or predicting behavior of customers of a mobile service provider.

A Kernel Multiple Change-point Algorithm via Model Selection

A penalty for choosing the number of change-points in the kernel-based method of Harchaoui and Capp{\'e} (2007) is built and a non-asymptotic oracle inequality is proved for the proposed method, thanks to a new concentration result for some function of Hilbert-space valued random variables.

Detecting multiple change-points in the mean of Gaussian process by model selection