Local smoothness of graph signals (Q2298281): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: TFSAP / rank | |||
Normal rank |
Revision as of 15:41, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Local smoothness of graph signals |
scientific article |
Statements
Local smoothness of graph signals (English)
0 references
20 February 2020
0 references
Summary: Analysis of vertex-varying spectral content of signals on graphs challenges the assumption of vertex invariance and requires the introduction of vertex-frequency representations as a new tool for graph signal analysis. Local smoothness, an important parameter of vertex-varying graph signals, is introduced and defined in this paper. Basic properties of this parameter are given. By using the local smoothness, an ideal vertex-frequency distribution is introduced. The local smoothness estimation is performed based on several forms of the vertex-frequency distributions, including the graph spectrogram, the graph Rihaczek distribution, and a vertex-frequency distribution with reduced interferences. The presented theory is illustrated through numerical examples.
0 references