Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
This paper demonstrates how a simple, yet effective, set of features enables to integrate ensemble classifiers in optical flow based tracking. In particular, gray value differences...
We propose a linear programming relaxation scheme for the class of multiple object tracking problems where the inter-object interaction metric is convex and the intraobject term q...
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
Thomas Windheuser, Ulrich Schlickewei, Frank R. Sc...