174 search results - page 1 / 35 » Dimensionality reduction using magnitude and shape approxima... |
CIKM
2003
Springer
15 years 5 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
118
click to vote
ICIP
2007
IEEE
16 years 1 months ago
2007
IEEE
Image segmentation with shape priors has received a lot of attention over the past years. Most existing work focuses on a linearized shape space with small deformation modes aroun...
127
click to vote
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
100
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
139
click to vote
SDM
2007
SIAM
15 years 1 months ago
2007
SIAM
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...