A Unifying Analysis of Shift Operators on a Graph

08/05/2019
by   Bruno Scalzo Dees, et al.
0

The maximum entropy principle is employed to introduce a general class of shift operators (GSO) for random signals on a graph. By virtue of the assumed probabilistic framework, the proposed GSO is shown to be both bounded and to exhibit the desired property of asymptotic power preservation over graph shifts. For rigour, the sensitivity of the GSO to a graph topology misspecification is also addressed. The advantages of the proposed operator are demonstrated in a real-world multi-sensor signal average setting.

READ FULL TEXT
research
09/12/2019

Unitary Shift Operators on a Graph

A unitary shift operator (GSO) for signals on a graph is introduced, whi...
research
11/03/2017

A mathematical framework for graph signal processing of time-varying signals

We propose a general framework from which to understand the design of fi...
research
08/28/2021

How likely is a random graph shift-enabled?

The shift-enabled property of an underlying graph is essential in design...
research
01/25/2021

Learning Parametrised Graph Shift Operators

In many domains data is currently represented as graphs and therefore, t...
research
03/10/2020

Methods of Adaptive Signal Processing on Graphs Using Vertex-Time Autoregressive Models

The concept of a random process has been recently extended to graph sign...
research
04/27/2023

Universal Obstructions of Graph Parameters

We introduce a graph-parametric framework for obtaining obstruction char...
research
10/14/2021

A Functional Abstraction of Typed Invocation Contexts

In their paper "A Functional Abstraction of Typed Contexts", Danvy and F...

Please sign up or login with your details

Forgot password? Click here to reset