We study the problem of distributed filtering for state space models over networks, which aims to collaboratively estimate the states by a network of nodes. Most of existing works on this problem assume that both process and measurement noises are Gaussian and their covariances are known in advance. In some cases, this assumption breaks down and no longer holds.
Expander recovery is an iterative algorithm designed to recover sparse signals measured with binary matrices with linear complexity. In the paper, we study the expander recovery performance of the bipartite graph with girth greater than 4, which can be associated with a binary matrix with column correlations equal to either 0 or 1.
A key challenge in designing distributed particle filters is to minimize the communication overhead without compromising tracking performance. In this paper, we present two distributed particle filters that achieve robust performance with low communication overhead.
@ieeeSPS
11.3K subscribers‧180 videos
