An unrolled graph denoiser combining a truncated Taylor expansion with fixed-step conjugate gradient is proven to realize only polynomial graph filters of degree at most K(m-1), a measure-zero subset of its nominal degree budget.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SP 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Unrolling a Graph-Laplacian Denoiser Realizes Only Compositions of Polynomial Graph Filters
An unrolled graph denoiser combining a truncated Taylor expansion with fixed-step conjugate gradient is proven to realize only polynomial graph filters of degree at most K(m-1), a measure-zero subset of its nominal degree budget.