Sciweavers

Share
ECCV
2006
Springer

Riemannian Manifold Learning for Nonlinear Dimensionality Reduction

12 years 9 months ago
Riemannian Manifold Learning for Nonlinear Dimensionality Reduction
In recent years, nonlinear dimensionality reduction (NLDR) techniques have attracted much attention in visual perception and many other areas of science. We propose an efficient algorithm called Riemannian manifold learning (RML). A Riemannian manifold can be constructed in the form of a simplicial complex, and thus its intrinsic dimension can be reliably estimated. Then the NLDR problem is solved by constructing Riemannian normal coordinates (RNC). Experimental results demonstrate that our algorithm can learn the data's intrinsic geometric structure, yielding uniformly distributed and well organized low-dimensional embedding data.
Tony Lin, Hongbin Zha, Sang Uk Lee
Added 16 Oct 2009
Updated 16 Oct 2009
Type Conference
Year 2006
Where ECCV
Authors Tony Lin, Hongbin Zha, Sang Uk Lee
Comments (0)
books