A graph Fourier basis defined by ℓ1 variation minimization has k-th vector with at most k distinct values, and a greedy grouping algorithm approximates the basis.
The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Graph Fourier Transform Based on $\ell_1$ Norm Variation Minimization
A graph Fourier basis defined by ℓ1 variation minimization has k-th vector with at most k distinct values, and a greedy grouping algorithm approximates the basis.