Sciweavers

5092 search results - page 116 / 1019
» Clustering the Feature Space
Sort
View
ICCV
2007
IEEE
16 years 6 months ago
Noise Robust Spectral Clustering
This paper aims to introduce the robustness against noise into the spectral clustering algorithm. First, we propose a warping model to map the data into a new space on the basis o...
Zhenguo Li, Jianzhuang Liu, Shifeng Chen, Xiaoou T...
NIPS
2004
15 years 5 months ago
Limits of Spectral Clustering
An important aspect of clustering algorithms is whether the partitions constructed on finite samples converge to a useful clustering of the whole data space as the sample size inc...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...
PAKDD
2005
ACM
112views Data Mining» more  PAKDD 2005»
15 years 10 months ago
Approximated Clustering of Distributed High-Dimensional Data
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
117
Voted
ICPR
2008
IEEE
15 years 11 months ago
Non-Abelian invariant feature detection
We present a novel formulation of non-Abelian invariant feature detection. By choosing suitable measuring functions, we show that the measuring space and the corresponding feature...
Yaniv Gur, Nir A. Sochen
142
Voted
TVCG
2010
180views more  TVCG 2010»
15 years 2 months ago
Result-Driven Exploration of Simulation Parameter Spaces for Visual Effects Design
—Graphics artists commonly employ physically-based simulation for the generation of effects such as smoke, explosions, and similar phenomena. The task of finding the correct par...
Stefan Bruckner, Torsten Möller