120 search results - page 15 / 24 » OPTICS: Ordering Points To Identify the Clustering Structure |
116
Voted
MIR
2004
ACM
15 years 5 months ago
2004
ACM
In this paper, we present an index structure-based method to fast and robustly search short video clips in large video collections. First we temporally segment a given long video ...
127
click to vote
EJC
2011
14 years 6 months ago
2011
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
AMAI
1999
Springer
14 years 11 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
126
click to vote
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
We propose a novel method for automatically discover-ing key motion patterns happening in a scene by observing the scene for an extended period. Our method does not rely on object ...
100
click to vote
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Gaussian mean-shift (GMS) is a clustering algorithm that has been shown to produce good image segmentations (where each pixel is represented as a feature vector with spatial and r...