Sciweavers

468 search results - page 48 / 94
» Riemannian Manifold Learning
Sort
View
COMPGEOM
2010
ACM
13 years 11 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
ICCV
2007
IEEE
14 years 1 months ago
Laplacian PCA and Its Applications
Dimensionality reduction plays a fundamental role in data processing, for which principal component analysis (PCA) is widely used. In this paper, we develop the Laplacian PCA (LPC...
Deli Zhao, Zhouchen Lin, Xiaoou Tang
COLT
2005
Springer
14 years 1 months ago
From Graphs to Manifolds - Weak and Strong Pointwise Consistency of Graph Laplacians
In the machine learning community it is generally believed that graph Laplacians corresponding to a finite sample of data points converge to a continuous Laplace operator if the s...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
CVPR
2011
IEEE
12 years 11 months ago
Nonlinear Shape Manifolds as Shape Priors in Level Set Segmentation and Tracking
We propose a novel nonlinear, probabilistic and variational method for adding shape information to level setbased segmentation and tracking. Unlike previous work, we represent sha...
Victor Prisacariu, Ian Reid
ICMCS
2009
IEEE
97views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Some new directions in graph-based semi-supervised learning
In this position paper, we first review the state-of-the-art in graph-based semi-supervised learning, and point out three limitations that are particularly relevant to multimedia ...
Xiaojin Zhu, Andrew B. Goldberg, Tushar Khot