2489 search results - page 262 / 498 » On the Subgroup Distance Problem |
156
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Mean shift clustering is a powerful unsupervised data
analysis technique which does not require prior knowledge
of the number of clusters, and does not constrain the shape
of th...
147
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
179
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
? Robust feature matching across different views of the same scene taken by two cameras with wide baseline and arbitrary rotation is still an open problem. Matching based on appear...
131
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
Identifying or matching the surface color of a moving object in surveillance video is critical for achieving reliable object-tracking and searching. Traditional color models provi...
173
Voted
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...