Sciweavers

16 search results - page 2 / 4
» Approximations of Geodesic Distances for Incomplete Triangul...
Sort
View
TSMC
2010
13 years 3 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer
CAD
2004
Springer
13 years 8 months ago
Reduce the stretch in surface flattening by finding cutting paths to the surface boundary
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...
Charlie C. L. Wang, Yu Wang 0010, Kai Tang, Matthe...
JMLR
2010
186views more  JMLR 2010»
13 years 3 months ago
Dimensionality Estimation, Manifold Learning and Function Approximation using Tensor Voting
We address instance-based learning from a perceptual organization standpoint and present methods for dimensionality estimation, manifold learning and function approximation. Under...
Philippos Mordohai, Gérard G. Medioni
ECCV
2008
Springer
14 years 10 months ago
Anisotropic Geodesics for Perceptual Grouping and Domain Meshing
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
Sébastien Bougleux, Gabriel Peyré, L...
IPMI
2009
Springer
14 years 3 months ago
Clustering of the Human Skeletal Muscle Fibers Using Linear Programming and Angular Hilbertian Metrics
In this paper, we present a manifold clustering method for the classification of fibers obtained from diffusion tensor images (DTI) of the human skeletal muscle. Using a linear ...
Radhouène Neji, Ahmed Besbes, Nikos Komodak...