Downsampling graphs using spectral theory

In this paper we present methods for downsampling datasets defined on graphs (i.e., graph-signals) by extending downsampling results for traditional N-dimensional signals. In particular, we study the spectral properties of k-regular bipartite graphs (K-RBG) and prove that downsampling in these graphs is governed by a Nyquist-like criteria. The results are useful for designing critically sampled filter-banks in various data-domains where the underlying relations between data locations can be represented by undirected graphs. In order to illustrate our results we represent images as a set of k-RBG graphs and apply our downsampling results to them. The results show that common 2-D lattice downsampling methods can be seen special cases of (k-RBG) based downsampling. Further we demonstrate new downsampling schemes for images with non-rectangular connectivity.

[1]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Z. Rudnick,et al.  Eigenvalue Spacings for Regular Graphs , 1999 .

[3]  Mark Crovella,et al.  Graph wavelets for spatial traffic analysis , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[4]  Antonio Ortega,et al.  Optimized distributed 2D transforms for irregularly sampled sensor network grids using wavelet lifting , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[5]  Sunil K. Narang,et al.  Local two-channel critically sampled filter-banks on graphs , 2010, 2010 IEEE International Conference on Image Processing.

[6]  Jianqin Zhou,et al.  On discrete cosine transform , 2011, ArXiv.

[7]  Pierre Vandergheynst,et al.  Wavelets on Graphs via Spectral Graph Theory , 2009, ArXiv.

[8]  R. Mersereau,et al.  The processing of periodically sampled multidimensional signals , 1983 .