1. Home
2. Premium
3. IEEE ICASSP 2020 Virtual Conference May 2020
4. Estimating Centrality Blindly From Low-Pass Filtered Graph Signals

Estimating Centrality Blindly From Low-Pass Filtered Graph Signals

Collection:

IEEE ICASSP 2020 Virtual Conference May 2020

This paper considers blind methods for centrality estimation from graph signals. We model graph signals as the outcome of an unknown low-pass graph filter excited with influences governed by a sparse sub-graph. This model is compatible with a number of da

• IEEE MemberUS $11.00
• Society MemberUS $0.00
• IEEE Student MemberUS $11.00
• Non-IEEE MemberUS $15.00

Purchase

Videos in this product

Estimating Centrality Blindly From Low-Pass Filtered Graph Signals

00:13:48

0 views

This paper considers blind methods for centrality estimation from graph signals. We model graph signals as the outcome of an unknown low-pass graph filter excited with influences governed by a sparse sub-graph. This model is compatible with a number of da