A graph Hilbert transform is defined on directed graphs after minimal edge addition, which provably creates a cycle cover that supports phase analysis.
Discrete Signal Processing on Graphs,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SP 1years
2024 1verdicts
CONDITIONAL 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.