We propose a multi-target tracking algorithm based on the Probability Hypothesis Density (PHD) filter and data association using graph matching. The PHD filter is used to compen...
Emilio Maggio, Elisa Piccardo, Carlo S. Regazzoni,...
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
In this paper, we present a graph-theoretic framework for provisioning overlay network based multimedia distribution services to a diverse set of receivers. Considering resource l...
We present a novel approach for real-time path planning of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...