Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI.
Madeleine S. KotzagiannidisPier Luigi DragottiPublished in: CoRR (2016)
Keyphrases
- signal reconstruction
- graph structure
- directed acyclic
- graph representation
- compressive sensing
- compressed sensing
- graph mining
- weighted graph
- directed graph
- graph construction
- graph theory
- labeled graphs
- graph databases
- image reconstruction
- graph structures
- graph theoretic
- gaussian graphical models
- band limited
- dense sampling
- frequent subgraph mining
- graph matching
- adjacency matrix
- graph theoretical
- graph model
- graph clustering
- graph properties
- graph search
- graph classification
- series parallel
- bipartite graph
- graph partitioning
- graph data
- reachability queries
- densely connected
- maximum common subgraph
- sparse sampling
- subgraph isomorphism
- spanning tree
- signal processing
- random graphs
- neighborhood graph
- structural pattern recognition
- graph layout
- connected graphs
- maximum clique
- dynamic graph
- real world graphs
- graph isomorphism
- graph patterns
- graph representations
- edge weights
- finding the shortest path
- random walk
- frequent subgraphs
- minimum spanning tree
- graph kernels
- adjacency graph
- random projections
- dense subgraphs
- least squares
- undirected graph
- fourier transform
- query graph
- shortest path
- graphical models
- topological information
- planar graphs
- bounded treewidth
- connected components
- pattern mining
- massive graphs
- sparse representation
- super resolution
- attributed relational graph
- high dimensional
- sparse signal representation