550 search results - page 34 / 110 » pairing 2009 |
178
click to vote
APPROX
2009
Springer
16 years 18 days ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
199
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We study the cosegmentation problem where the objective
is to segment the same object (i.e., region) from a pair
of images. The segmentation for each image can be cast
using a p...
182
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We present an algorithm for clustering sets of detected
interest points into groups that correspond to visually dis-
tinct structure. Through the use of a suitable colour and tex...
182
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Clustering performance can often be greatly improved by
leveraging side information. In this paper, we consider constrained
clustering with pairwise constraints, which specify
s...
156
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Currently, video analysis algorithms suffer from lack of information
regarding the objects present, their interactions,
as well as from missing comprehensive annotated video
dat...