(Enter summary)
Abstract: A new algorithm for manifold learning is presented.
Given only samples of a finite-dimensional differentiable manifold,
and no a priori knowledge of the manifold's geometry or topology except
for its dimension, the goal is to find a description of the manifold.
The learned manifold must approximate the true manifold well, both
geometrically and topologically, when the sampling density is sufficiently
high. The proposed algorithm constructs a simplicial complex
based on approximations to the... (Update)
Context of citations to this paper: More
...of the signed distance function to the surface. The zero set of this distance function is extracted using the marching cubes algorithm [11]. Other algorithms [8, 9, 13] use a greedy approach. The ball pivoting algorithm [9] rolls a ball over the sample points; it...
Cited by: More
Moving Least Squares Multiresolution Surface Approximation - Boris Mederos Luiz (2003)
(Correct)
Smooth Surface Reconstruction from Noisy Clouds - Mederos, Velho, de Figueiredo
(Correct)
Active bibliography (related documents): More All
0.1: Probabilistic Tracking with Optimal Scale and Orientation.. - Chen, Liu (2002)
(Correct)
0.1: Using Toboggan-Based Intelligent Scissors For Image And Movie.. - Mortensen
(Correct)
0.1: Active Contours for Tracking Distributions - Daniel Freedman Computer
(Correct)
Similar documents based on text: More All
0.2: Sparse Representations with Chirplets via Maximum.. - O'Neill, Flandrin, Karl
(Correct)
0.2: Virtues and Vices of Quartic Time-Frequency Distributions - O'Neill, Flandrin (2000)
(Correct)
0.2: Detecting Shared Congestion of Flows Via End-to-end.. - Rubenstein, Kurose.. (2002)
(Correct)
Related documents from co-citation: More All
4: Curve and surface reconstruction from regular and non regular point sets
- Boyer, Petitjean - 2001
4: A new Voronoi based surface algorithm (context) - Amenta, Bern et al.
4: The ball-pivoting algorithm for surface reconstruction
- Bernardini, Mittleman et al. - 1999
BibTeX entry: (Update)
D. Freedman. Efficient simplicial reconstruction of manifolds from their samples. IEEE Transaction on Pattern Analysis and Machine Intelligence 24(10):1349--1357, 2002. http://citeseer.ist.psu.edu/article/freedman02efficient.html More
@misc{ freedman02efficient,
author = "D. Freedman",
title = "Efficient simplicial reconstruction of manifolds from their samples",
text = "D. Freedman. Efficient simplicial reconstruction of manifolds from their
samples. IEEE Transaction on Pattern Analysis and Machine Intelligence 24(10):1349--1357,
2002.",
year = "2002",
url = "citeseer.ist.psu.edu/article/freedman02efficient.html" }
Citations (may not include all citations):
1386
Snakes: active contour models (context) - Kass, Witkin et al. - 1987
364
Condensation - conditional density propagation for visual tr..
- Blake, Isard - 1998
102
Icondensation: unifying low-level and high-level tracking in..
- Isard, Blake - 1998 DBLP
55
Surface reconstruction by voronoi filtering
- Amenta, Bern ACM DBLP
8
Provably fast algorithms for contour tracking
- Freedman, Brandstein - 2000 DBLP
Documents on the same site (http://www.cs.rpi.edu/~freedd/publications.html): More
Tracking Objects Using Density Matching and Shape Priors - Zhang, Freedman (2003)
(Correct)
Manifold Reconstruction from Unorganized Points - Freedman
(Correct)
Unknown -
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC