875 search results - page 47 / 175 » Linear Manifold Clustering |
130
click to vote
ECCV
2008
Springer
16 years 2 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...
114
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
The dynamic texture (DT) is a probabilistic generative model, defined over space and time, that represents a video as the output of a linear dynamical system (LDS). The DT model ...
132
Voted
ICIP
2008
IEEE
16 years 2 months ago
2008
IEEE
Subspace learning techniques are widespread in pattern recognition research. They include PCA, ICA, LPP, etc. These techniques are generally linear and unsupervised. The problem o...
111
Voted
ICIP
2006
IEEE
16 years 2 months ago
2006
IEEE
Linear techniques are widely used to reduce the dimension of image representation spaces in applications such as image indexing and object recognition. Optimal Component Analysis ...
126
click to vote
ICIP
2005
IEEE
15 years 6 months ago
2005
IEEE
Averaging, filtering and interpolation of 3-D object orientation data is important in both computer vision and computer graphics, for instance to smooth estimates of object orien...