Universal bounds for the sampling of graph signals.
Luiz F. O. ChamonAlejandro RibeiroPublished in: ICASSP (2017)
Keyphrases
- upper bound
- random sampling
- directed graph
- graph representation
- sampling algorithm
- sample size
- graph based algorithm
- monte carlo
- connected components
- upper and lower bounds
- graph theory
- lower and upper bounds
- signal processing
- lower bound
- graph partitioning
- constant factor
- directed acyclic graph
- graph theoretic
- low pass filtering
- graph databases
- weighted graph
- graph structure
- bipartite graph
- structured data
- random walk
- graph model
- error bounds
- independent component analysis
- sampling methods
- radio frequency
- variance reduction
- band limited
- worst case
- frequent subgraph mining