Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...
One of the key factors for the success of recent energy
minimization methods is that they seek to compute global
solutions. Even for non-convex energy functionals, optimization
...
Petter Strandmark, Fredrik Kahl, Niels Chr. Overga...
We present a method for tracking a hand while it is interacting
with an object. This setting is arguably the one where
hand-tracking has most practical relevance, but poses signi...
Henning Hamer, Konrad Schindler, Esther Koller-Mei...
Context is critical for minimising ambiguity in object de-
tection. In this work, a novel context modelling framework
is proposed without the need of any prior scene segmen-
tat...
embedded in a sliding-window scheme. Such exhaustive
search involves massive computation. Efficient Subwindow
Search (ESS) [11] avoids this by means of branch
and bound. However...
We investigate the problem of pedestrian detection in
still images. Sliding window classifiers, notably using the
Histogram-of-Gradient (HOG) features proposed by Dalal
and Trig...
We introduce a new problem of automatic photo composition,
and present an effective technique for finding good
views within a panoramic scene. Instead of applying heuristic
rule...
Finding correspondences between feature points is one
of the most relevant problems in the whole set of visual
tasks. In this paper we address the problem of matching
a feature ...
The One-Shot similarity measure has recently been introduced
in the context of face recognition where it was used
to produce state-of-the-art results. Given two vectors, their
O...
Background subtraction algorithms define the background
as parts of a scene that are at rest. Traditionally,
these algorithms assume a stationary camera, and identify
moving obj...