— Multi-agent coordination problems can be cast as distributed optimization tasks. Probability Collectives (PCs) are techniques that deal with such problems in discrete and conti...
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
We present an efficient method for maximizing energy functions with first and second order potentials, suitable for MAP labeling estimation problems that arise in undirected graph...
In this paper, we propose a probabilistic method to model the dynamic traffic flow across nonoverlapping camera views. By assuming the transition time of object movement follows a...
We propose an algorithm for large displacement opti-
cal flow estimation which does not require the commonly
used coarse-to-fine warping strategy. It is based on a
quadratic rel...