871 search results - page 151 / 175 » Visualizing RFM Segmentation |
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Stereo matching algorithms conventionally match over a range of disparities sufficient to encompass all visible 3D scene points. Human vision however does not do this. It works ov...
106
click to vote
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
The detection and tracking of three-dimensional human body models has progressed rapidly but successful approaches typically rely on accurate foreground silhouettes obtained using...
102
click to vote
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Coarse-to-fine classification is an efficient way of organizing object recognition in order to accommodate a large number of possible hypotheses and to systematically exploit shar...
122
click to vote
ECCV
2008
Springer
16 years 1 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...
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. We consider the problem of clustering data into k 2 clusters given complex relations -- going beyond pairwise -- between the data points. The complex n-wise relations ar...