118
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
Graph-cuts based algorithms are effective for a variety
of segmentation tasks in computer vision. Ongoing research
is focused toward making the algorithms even more general,
as ...
116
Voted
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
Given an arbitrary image, our goal is to segment all distinct
texture subimages. This is done by discovering distinct,
cohesive groups of spatially repeating patterns, called tex...
102
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
In this paper, we introduce a new approach for modeling
visual context. For this purpose, we consider the leaves of a
hierarchical segmentation tree as elementary units. Each
le...
153
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
We present an algorithm for detecting human actions
based upon a single given video example of such actions.
The proposed method is unsupervised, does not require
learning, segm...
121
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
We propose an algorithm for large displacement opti-
cal flow estimation which does not require the commonly
used coarse-to-fine warping strategy. It is based on a
quadratic rel...