Fen Wang

Learning Sparse Graph Laplacian with K Eigenvector Prior via Iterative Glasso and Projection

2021

Learning a suitable graph is an important precursor to many graph signal processing (GSP) pipelines, such as graph signal compression and denoising. Previous graph learning algorithms either i) make assumptions on graph connectivity (e.g., graph …