LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Local Smoothness of Graph Signals

Photo by goumbik from unsplash

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.… Click to show full abstract

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.

Keywords: vertex frequency; graph signals; smoothness; local smoothness

Journal Title: Mathematical Problems in Engineering
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.