This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
Abstract. We propose a novel method for action detection based on a new action descriptor called a shape flow that represents both the shape and movement of an object in a holistic...
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
Pushmeet Kohli, Alexander Shekhovtsov, Carsten Rot...
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...