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

From spline wavelet to sampling theory on circulant graphs and beyond– conceiving sparsity in graph signal processing

Graph Signal Processing (GSP), as the field concerned with the extension of classical signal processing concepts to the graph domain, is still at the beginning on the path toward providing a generalized theory of signal processing. As such, this thesis aspires to conceive the theory of sparse representations on graphs by traversing the cornerstones of wavelet and sampling theory on graphs. Beginning with the novel topic of graph spline wavelet theory, we introduce families of spline and e-spline wavelets, and associated filterbanks on circulant graphs, which lever- age an inherent vanishing moment property of circulant graph Laplacian matrices (and their parameterized generalizations), for the reproduction and annihilation of (exponen- tial) polynomial signals. Further, these families are shown to provide a stepping stone to generalized graph wavelet designs with adaptive (annihilation) properties. Circulant graphs, which serve as building blocks, facilitate intuitively equivalent signal processing concepts and operations, such that insights can be leveraged for and extended to more complex scenarios, including arbitrary undirected graphs, time-varying graphs, as well as associated signals with space- and time-variant properties, all the while retaining the focus on inducing sparse representations. Further, we shift from sparsity-inducing to sparsity-leveraging theory and present a novel sampling and graph coarsening framework for (wavelet-)sparse graph signals, inspired by Finite Rate of Innovation (FRI) theory and directly building upon (graph) spline wavelet theory. At its core, the introduced Graph-FRI-framework states that any K-sparse signal residing on the vertices of a circulant graph can be sampled and perfectly reconstructed from its dimensionality-reduced graph spectral representation of minimum size 2K, while the structure of an associated coarsened graph is simultaneously inferred. Extensions to arbitrary graphs can be enforced via suitable approximation schemes. Eventually, gained insights are unified in a graph-based image approximation framework which further leverages graph partitioning and re-labelling techniques for a maximally sparse graph wavelet representation.Open Acces

M-Channel compactly supported biorthogonal cosine-modulated wavelet bases

In this correspondence, we generalize the theory of compactly supported biorthogonal two-channel wavelet bases to M -channel. A sufficient condition for the M-channel perfect reconstruction filter banks to construct M-channel biorthogonal bases of compactly supported wavelets is derived. It is shown that the construction of biorthogonal Af-channel wavelet bases is equivalent to the design of a Af-channel perfect reconstruction filter bank with some added regularity conditions. A family of M-channel biorthogonal wavelet bases based on the cosinemodulated filter bank (CMFB) is proposed. It has the advantages of simple design procedure, efficient implementation, and good filter quality. A new method for imposing the regularity on the CMFB's is also introduced, and several design examples are given. ©1998 IEEE.published_or_final_versio

Optimal channel equalization for filterbank transceivers in presence of white noise

Filterbank transceivers are widely employed in data communication networks to cope with inter-symbol-interference (ISI) through the use of redundancies. This dissertation studies the design of the optimal channel equalizer for both time-invariant and time-varying channels, and wide-sense stationary (WSS) and possible non-stationary white noise processes. Channel equalization is investigated via the filterbank transceivers approach. All perfect reconstruction (PR) or zero-forcing (ZF) receiver filterbanks are parameterized in an affine form, which eliminate completely the ISI. The optimal channel equalizer is designed through minimization of the mean-squared-error (MSE) between the detected signals and the transmitted signals. Our main results show that the optimal channel equalizer has the form of state estimators, and is a modified Kalman filter. The results in this dissertation are applicable to discrete wavelet multitone (DWMT) systems, multirate transmultiplexers, orthogonal frequency division multiplexing (OFDM), and direct-sequence/spread-spectrum (DS/SS) based code division multiple access (CDMA) networks. Design algorithms for the optimal channel equalizers are developed for different channel models, and white noise processes, and simulation examples are worked out to illustrate the proposed design algorithms

Image interpolation using Shearlet based iterative refinement

This paper proposes an image interpolation algorithm exploiting sparse representation for natural images. It involves three main steps: (a) obtaining an initial estimate of the high resolution image using linear methods like FIR filtering, (b) promoting sparsity in a selected dictionary through iterative thresholding, and (c) extracting high frequency information from the approximation to refine the initial estimate. For the sparse modeling, a shearlet dictionary is chosen to yield a multiscale directional representation. The proposed algorithm is compared to several state-of-the-art methods to assess its objective as well as subjective performance. Compared to the cubic spline interpolation method, an average PSNR gain of around 0.8 dB is observed over a dataset of 200 images

A practical approach for the design of nonuniform lapped transforms

We propose a simple method for the design of lapped transforms with nonuniform frequency resolution and good time localization. The method is a generalization of an approach previously proposed by Princen, where the nonuniform filter bank is obtained by joining uniform cosine-modulated filter banks (CMFBs) using a transition filter. We use several transition filters to obtain a near perfect-reconstruction (PR) nonuniform lapped transform with significantly reduced overall distortion. The main advantage of the proposed method is in reducing the length of the transition filters, which leads to a reduction in processing delay that can be useful for applications such as real-time audio coding

Biorthogonality in lapped transforms : a study in high-quality audio compression

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.Includes bibliographical references (leaves 76-82).by Shiufun Cheung.Ph.D