The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
Carl Olsson, Martin Byr¨od, Niels Chr. Overgaard,...
In structure-from-motion with a single camera it is well
known that the scene can be only recovered up to a scale. In
order to compute the absolute scale, one needs to know the
...
Davide Scaramuzza, Friedrich Fraundorfer, Marc Pol...
We propose a polynomial-time algorithm for segmentation
and (open) boundary estimation which takes into account
a series of user-specified attraction points. In contrast
to exis...
Thomas Windheuser, Thomas Schoenemann, Daniel Crem...
Low-rank approximation of image collections (e.g., via
PCA) is a popular tool in many areas of computer vision.
Yet, surprisingly little is known justifying the observation
that...
In recent years the Markov Random Field (MRF) has
become the de facto probabilistic model for low-level vision
applications. However, in a maximum a posteriori
(MAP) framework, ...
Oliver J. Woodford, Carsten Rother, Vladimir Kolmo...