A graph Hilbert transform is defined on directed graphs after minimal edge addition, which provably creates a cycle cover that supports phase analysis.
Signal denoising on graphs via graph filtering,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
eess.SP 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Hilbert Transform on Graphs: Let There Be Phase
A graph Hilbert transform is defined on directed graphs after minimal edge addition, which provably creates a cycle cover that supports phase analysis.