Graph topology recovery for regular and irregular graphs
- 1 December 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Abstract
In this paper, we study the recovery of the graph topology or structure. We first extend our previous work on graph signal recovery to present a joint graph signal and structure recovery framework. By doing this, we allow the algorithm to learn a graph structure from noisy and incomplete graph signals and recover the graph signals at the same time. In this paper, we particularly focus on the specific subproblem of graph structure learning and develop algorithms towards this problem and analyze them. We briefly study the implications when the underlying true graph structure is irregular or regular. Finally, we validate the proposed methods for both synthetic data and the real-world recovery problem of semi-supervised digit-image classification.Keywords
This publication has 23 references indexed in Scilit:
- Network Topology Inference from Spectral TemplatesIEEE Transactions on Signal and Information Processing over Networks, 2017
- Learning Laplacian Matrix in Smooth Graph Signal RepresentationsIEEE Transactions on Signal Processing, 2016
- Generalized Laplacian precision matrix estimation for graph signal processing2016
- Sampling of Graph Signals With Successive Local AggregationsIEEE Transactions on Signal Processing, 2015
- Spectrum-blind signal recovery on graphs2015
- Discrete Signal Processing on Graphs: Sampling TheoryIEEE Transactions on Signal Processing, 2015
- Discrete Signal Processing on Graphs: Frequency AnalysisIEEE Transactions on Signal Processing, 2014
- Discrete Signal Processing on GraphsIEEE Transactions on Signal Processing, 2013
- Wavelets on graphs via spectral graph theoryApplied and Computational Harmonic Analysis, 2011
- Sparse inverse covariance estimation with the graphical lassoBiostatistics, 2007