SPS Feed

In this paper, the particle filtering problem is investigated for a class of nonlinear/non-Gaussian systems with energy harvesting sensors subject to randomly occurring sensor saturations (ROSSs). The random occurrences of the sensor saturations are characterized by a series of Bernoulli distributed stochastic variables with known probability distributions.

Recently, soft video multicasting has gained a lot of attention, especially in broadcast and mobile scenarios where the bit rate supported by the channel may differ across receivers, and may vary quickly over time. Unlike the conventional designs that force the source to use a single bit rate according to the receiver with the worst channel quality, soft video delivery schemes transmit the video such that the video quality at each receiver is commensurate with its specific instantaneous channel quality.

Kinship recognition is a prominent research aiming to find if kinship relation exists between two different individuals. In general, child closely resembles his/her parents more than others based on facial similarities. These similarities are due to genetically inherited facial features that a child shares with his/her parents. Most existing researches in kinship recognition focus on full facial images to find these kinship similarities.

Geometry calibration is an inherent challenge in distributed acoustic sensor networks. To mitigate this problem, a passive geometry calibration approach based on distributed damped Newton optimization is proposed. Specifically, a geometric cost function incorporating direction of arrivals (DoAs) and time difference of arrivals (TDoAs) is first formulated, and then its identifiability conditions are given.

As a fundamental algorithm for collaborative processing over multi-agent systems, distributed consensus algorithm has been studied for optimizing its convergence rate. Due to the close analogy between the diffusion problem and the consensus algorithm, the previous trend in the literature is to transform the diffusion system from the spatially continuous domain into the spatially discrete one. 

In order to perform network analysis tasks, representations that capture the most relevant information in the graph structure are needed. However, existing methods learn representations that cannot be interpreted in a straightforward way and that are relatively unstable to perturbations of the graph structure. We address these two limitations by proposing node2coords, a representation learning algorithm for graphs, which learns simultaneously a low-dimensional space and coordinates for the nodes in that space.