Graph Signal Processing: Overview, Challenges and Applications

Research in Graph Signal Processing (GSP) aims to develop tools for processing data defined on irregular graph domains. In this paper we first provide an overview of core ideas in GSP and their connection to conventional digital signal processing. We then summarize recent developments in developing basic GSP tools, including methods for sampling, filtering or graph learning. Next, we review progress in several application areas using GSP, including processing and analysis of sensor network data, biological data, and applications to image processing and machine learning. We finish by providing a brief historical perspective to highlight how concepts recently developed in GSP build on top of prior research in other areas.Comment: To appear, Proceedings of the IEE

Wavelet Lifting over Information-Based EEG Graphs for Motor Imagery Data Classification

The imagination of limb movements offers an intuitive paradigm for the control of electronic devices via brain computer interfacing (BCI). The analysis of electroencephalographic (EEG) data related to motor imagery potentials has proved to be a difficult task. EEG readings are noisy, and the elicited patterns occur in different parts of the scalp, at different instants and at different frequencies. Wavelet transform has been widely used in the BCI field as it offers temporal and spectral capabilities, although it lacks spatial information. In this study we propose a tailored second generation wavelet to extract features from these three domains. This transform is applied over a graph representation of motor imaginary trials, which encodes temporal and spatial information. This graph is enhanced using per-subject knowledge in order to optimise the spatial relationships among the electrodes, and to improve the filter design. This method improves the performance of classifying different imaginary limb movements maintaining the low computational resources required by the lifting transform over graphs. By using an online dataset we were able to positively assess the feasibility of using the novel method in an online BCI context

Learning parametric dictionaries for graph signals

In sparse signal representation, the choice of a dictionary often involves a tradeoff between two desirable properties -- the ability to adapt to specific signal data and a fast implementation of the dictionary. To sparsely represent signals residing on weighted graphs, an additional design challenge is to incorporate the intrinsic geometric structure of the irregular data domain into the atoms of the dictionary. In this work, we propose a parametric dictionary learning algorithm to design data-adapted, structured dictionaries that sparsely represent graph signals. In particular, we model graph signals as combinations of overlapping local patterns. We impose the constraint that each dictionary is a concatenation of subdictionaries, with each subdictionary being a polynomial of the graph Laplacian matrix, representing a single pattern translated to different areas of the graph. The learning algorithm adapts the patterns to a training set of graph signals. Experimental results on both synthetic and real datasets demonstrate that the dictionaries learned by the proposed algorithm are competitive with and often better than unstructured dictionaries learned by state-of-the-art numerical learning algorithms in terms of sparse approximation of graph signals. In contrast to the unstructured dictionaries, however, the dictionaries learned by the proposed algorithm feature localized atoms and can be implemented in a computationally efficient manner in signal processing tasks such as compression, denoising, and classification