Sciweavers

141 search results - page 23 / 29
» Grouping and dimensionality reduction by locally linear embe...
Sort
View
NIPS
2007
13 years 9 months ago
Colored Maximum Variance Unfolding
Maximum variance unfolding (MVU) is an effective heuristic for dimensionality reduction. It produces a low-dimensional representation of the data by maximizing the variance of the...
Le Song, Alex J. Smola, Karsten M. Borgwardt, Arth...
CVPR
2003
IEEE
14 years 9 months ago
Learning Appearance and Transparency Manifolds of Occluded Objects in Layers
By mapping a set of input images to points in a lowdimensional manifold or subspace, it is possible to efficiently account for a small number of degrees of freedom. For example, i...
Brendan J. Frey, Nebojsa Jojic, Anitha Kannan
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 8 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
CVPR
2007
IEEE
14 years 9 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
CVPR
2008
IEEE
14 years 9 months ago
Coherent Laplacian 3-D protrusion segmentation
In this paper, an analysis of locally linear embedding (LLE) in the context of clustering is developed. As LLE conserves the local affine coordinates of points, shape protrusions ...
Fabio Cuzzolin, Diana Mateus, David Knossow, Edmon...