LAUSR

Minimax Design of Computationally-Efficient FIR Graph Filters Using Semidefinite Programming

Sign Up to like & get
recommendations!
1 Published in 2022 at "IEEE Transactions on Circuits and Systems II: Express Briefs"

DOI: 10.1109/tcsii.2022.3181540

Abstract: We propose a minimax design method for finite impulse response (FIR) graph filters in this paper. We first convert the graph filter design problem into a numerically stable equivalent problem using a shifted monomial basis.… read more here.

Keywords: graph filters; minimax; fir graph; design ... See more keywords

Adaptive Graph Filters in Reproducing Kernel Hilbert Spaces: Design and Performance Analysis

Sign Up to like & get
recommendations!
0 Published in 2021 at "IEEE Transactions on Signal and Information Processing over Networks"

DOI: 10.1109/tsipn.2020.3046217

Abstract: This paper develops adaptive graph filters that operate in reproducing kernel Hilbert spaces. We consider both centralized and fully distributed implementations. We first define nonlinear graph filters that operate on graph-shifted versions of the input… read more here.

Keywords: performance; reproducing kernel; graph; adaptive graph ... See more keywords

Blind Identification of Graph Filters

Sign Up to like & get
recommendations!
1 Published in 2017 at "IEEE Transactions on Signal Processing"

DOI: 10.1109/tsp.2016.2628343

Abstract: Network processes are often represented as signals defined on the vertices of a graph. To untangle the latent structure of such signals, one can view them as outputs of linear graph filters modeling underlying network… read more here.

Keywords: blind identification; identification graph; graph; filter ... See more keywords

Estimating Network Processes via Blind Identification of Multiple Graph Filters

Sign Up to like & get
recommendations!
0 Published in 2020 at "IEEE Transactions on Signal Processing"

DOI: 10.1109/tsp.2020.2993780

Abstract: This paper studies the problem of jointly estimating multiple network processes driven by a common unknown input, thus effectively generalizing the classical blind multi-channel identification problem to graphs. More precisely, we model network processes as… read more here.

Keywords: network processes; multiple graph; identification; graph ... See more keywords

A Cascaded Structure for Generalized Graph Filters

Sign Up to like & get
recommendations!
1 Published in 2022 at "IEEE Transactions on Signal Processing"

DOI: 10.1109/tsp.2021.3099630

Abstract: One of the main challenges of graph filters is the stability of their design. While classical graph filters allow for a stable design using optimal polynomial approximation theory, generalized graph filters tend to suffer from… read more here.

Keywords: graph filters; generalized graph; structure; graph ... See more keywords