DeepAI AI Chat
Log In Sign Up

Fast Graph Filters for Decentralized Subspace Projection

by   Daniel Romero, et al.

A number of inference problems with sensor networks involve projecting a measured signal onto a given subspace. In existing decentralized approaches, sensors communicate with their local neighbors to obtain a sequence of iterates that asymptotically converges to the desired projection. In contrast, the present paper develops methods that produce these projections in a finite and approximately minimal number of iterations. Building upon tools from graph signal processing, the problem is cast as the design of a graph filter which, in turn, is reduced to the design of a suitable graph shift operator. Exploiting the eigenstructure of the projection and shift matrices leads to an objective whose minimization yields approximately minimum-order graph filters. To cope with the fact that this problem is not convex, the present work introduces a novel convex relaxation of the number of distinct eigenvalues of a matrix based on the nuclear norm of a Kronecker difference. To tackle the case where there exists no graph filter capable of implementing a certain subspace projection with a given network topology, a second optimization criterion is presented to approximate the desired projection while trading the number of iterations for approximation error. Two algorithms are proposed to optimize the aforementioned criteria based on the alternating-direction method of multipliers. An exhaustive simulation study demonstrates that the obtained filters can effectively obtain subspace projections markedly faster than existing algorithms.


Subspace clustering based on low rank representation and weighted nuclear norm minimization

Subspace clustering refers to the problem of segmenting a set of data po...

Differential Methods in Catadioptric Sensor Design with Applications to Panoramic Imaging

We discuss design techniques for catadioptric sensors that realize given...

Some Options for L1-Subspace Signal Processing

We describe ways to define and calculate L_1-norm signal subspaces which...

Subspace Clustering via Optimal Direction Search

This letter presents a new spectral-clustering-based approach to the sub...

Fast Approximate CoSimRanks via Random Projections

Given a graph G with n nodes, and two nodes u,v in G, the CoSim-Rank val...

On the Divergence of Decentralized Non-Convex Optimization

We study a generic class of decentralized algorithms in which N agents j...

Accurate Graph Filtering in Wireless Sensor Networks

Wireless sensor networks (WSNs) are considered as a major technology ena...