550 search results - page 34 / 110 » pairing 2009 |
144
Voted
APPROX
2009
Springer
15 years 10 months 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...
164
Voted
CVPR
2009
IEEE
16 years 11 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...
140
Voted
CVPR
2009
IEEE
16 years 10 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...
147
Voted
ICCV
2009
IEEE
16 years 8 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...
125
Voted
ICCV
2009
IEEE
16 years 8 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...