We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
The previous work of the authors has shown that physiological
information on the face can be extracted from
thermal infrared imagery and can be used as a biometric.
Although, th...
Pradeep Buddharaju (University of Houston), Ioanni...
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...
High-level, or holistic, scene understanding involves
reasoning about objects, regions, and the 3D relationships
between them. This requires a representation above the
level of ...
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...