Correlation-based Graph Smoothness Measures In Graph Signal Processing

Loading...
Thumbnail Image

Access rights

openAccess
acceptedVersion

URL

Journal Title

Journal ISSN

Volume Title

A4 Artikkeli konferenssijulkaisussa

Date

2023

Major/Subject

Mcode

Degree programme

Language

en

Pages

5

Series

31st European Signal Processing Conference, EUSIPCO 2023 - Proceedings, pp. 1848-1852, European Signal Processing Conference

Abstract

Graph smoothness is an important prior used for designing sampling strategies for graph signals as well as for regularizing the problem of graph learning. Additionally, smoothness is an appropriate assumption for graph signal processing (GSP) tasks such as filtering or signal recovery from samples. The most popular measure of smoothness is the quadratic form of the Laplacian, which naturally follows from the factor analysis approach. This paper presents a novel smoothness measure based on the graph correlation. The proposed measure enhances the applicability of graph smoothness measures across a variety of GSP tasks, by facilitating interoperability and generalizing across shift operators.

Description

Publisher Copyright: © 2023 European Signal Processing Conference, EUSIPCO. All rights reserved.

Keywords

graph autocorrelation, graph autocovariance, Graph signal processing, graph smoothness measures

Other note

Citation

Miettinen, J, Vorobyov, S A, Ollila, E & Wang, X 2023, Correlation-based Graph Smoothness Measures In Graph Signal Processing . in 31st European Signal Processing Conference, EUSIPCO 2023 - Proceedings . European Signal Processing Conference, European Association For Signal and Image Processing, pp. 1848-1852, European Signal Processing Conference, Helsinki, Finland, 04/09/2023 . https://doi.org/10.23919/EUSIPCO58844.2023.10289784