Graph Neural Networks for Intelligent Transportation Systems: A Survey

Graph neural networks (GNNs) have been extensively used in a wide variety of domains in recent years. Owing to their power in analyzing graph-structured data, they have become broadly popular in intelligent transportation systems (ITS) applications as well. Despite their widespread applications in different transportation domains, there is no...

Unrolling of Simplicial ElasticNet for Edge Flow Signal Reconstruction

The edge flow reconstruction task consists of retreiving edge flow signals from corrupted or incomplete measurements. This is typically solved by a regularized optimization problem on higher-order networks such as simplicial complexes and the corresponding regularizers are chosen based on prior knowledge. Tailoring this prior to the setting...

Distributed Adaptive Optimization with Weight-Balancing

This article addresses the continuous-time distributed optimization of a strictly convex summation-separable cost function with possibly nonconvex local functions over strongly connected digraphs. Distributed optimization methods in the literature require convexity of local functions, or balanced weights, or vanishing step sizes, or algebraic...

Fuzzy Adaptive Constrained Consensus Tracking of High-Order Multi-agent Networks: A New Event-Triggered Mechanism

This article aims to realize event-triggered constrained consensus tracking for high-order nonlinear multiagent networks subject to full-state constraints. The main challenge of achieving such goals lies in the fact that the standard designs [e.g., backstepping, event-triggered control, and barrier Lyapunov functions (BLFs)] successfully...

Online Edge Flow Imputation on Networks

An online algorithm for missing data imputation for networks with signals defined on the edges is presented. Leveraging the prior knowledge intrinsic to real-world networks, we propose a bi-level optimization scheme that exploits the causal dependencies and the flow conservation, respectively via <italic>(i)</italic> a sparse line...

A Directed Spanning Tree Adaptive Control Solution to Time-Varying Formations

In this article, the time-varying formation and time-varying formation tracking problems are solved for linear multiagent systems over digraphs without the knowledge of the eigenvalues of the Laplacian matrix associated with the digraph. The solution to these problems relies on an approach that generalizes the directed spanning tree (DST)...

Adaptive Graph Signal Processing: Algorithms and Optimal Sampling Strategies

The goal of this paper is to propose novel strategies for adaptive learning of signals defined over graphs, which are observed over a (randomly) time-varying subset of vertices. We recast two classical adaptive algorithms in the graph signal processing framework, namely, the least mean squares (LMS) and the recursive least squares (RLS)...

Autoregressive moving average graph filter design

In graph signal processing, signals are processed by explicitly taking into account their underlying structure, which is generally characterized by a graph. In this field, graph filters play a major role to process such signals in the so-called graph frequency domain. In this paper, we focus on the design of autoregressive moving average ...

Video Acceleration Magnification

The ability to amplify or reduce subtle image changes over time is useful in contexts such as video editing, medical video analysis, product quality control and sports. In these contexts there is often large motion present which severely distorts current video amplification methods that magnify change linearly. In this work we propose a method...