Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Sampling Theory for Graph Signals on Product Graphs (1809.10049v1)

Published 26 Sep 2018 in cs.IT, cs.AI, cs.LG, and math.IT

Abstract: 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

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Rohan Varma (9 papers)
  2. Jelena Kovačević (27 papers)
Citations (9)

Summary

We haven't generated a summary for this paper yet.