Sampling Theory for Graph Signals on Product Graphs

09/26/2018
by   Rohan Varma, et al.
0

In this paper, we extend the sampling theory on graphs by constructing a framework that exploits the structure in product graphs for efficient sampling and recovery of bandlimited graph signals that lie on them. Product graphs are graphs that are composed from smaller graph atoms; we motivate how this model is a flexible and useful way to model richer classes of data that can be multi-modal in nature. Previous works have established a sampling theory on graphs for bandlimited signals. Importantly, the framework achieves significant savings in both sample complexity and computational complexity

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2018

Sampling and Reconstruction of Signals on Product Graphs

In this paper, we consider the problem of subsampling and reconstruction...
research
03/09/2020

Sampling on Graphs: From Theory to Applications

The study of sampling signals on graphs, with the goal of building an an...
research
02/27/2012

Efficiently Sampling Multiplicative Attribute Graphs Using a Ball-Dropping Process

We introduce a novel and efficient sampling algorithm for the Multiplica...
research
12/15/2020

Product Graph Learning from Multi-domain Data with Sparsity and Rank Constraints

In this paper, we focus on learning product graphs from multi-domain dat...
research
12/16/2015

Signal Representations on Graphs: Tools and Applications

We present a framework for representing and modeling data on graphs. Bas...
research
03/22/2022

Graph spatial sampling

We develop lagged Metropolis-Hastings walk for sampling from simple undi...
research
10/29/2021

Sampling low-spectrum signals on graphs via cluster-concentrated modes: examples

We establish frame inequalities for signals in Paley–Wiener spaces on tw...

Please sign up or login with your details

Forgot password? Click here to reset