Proceedings Article10.1145/1057432.1057436
Comparing point clouds
Facundo Mémoli,Guillermo Sapiro +1 more
- 08 Jul 2004
- pp 32-40
TL;DR: A geometric framework for comparing manifolds given by point clouds is presented in this paper and the underlying theory is based on Gromov-Hausdorff distances, leading to isometry invariant and completely geometric comparisons.
read more
Abstract: Point clouds are one of the most primitive and fundamental surface representations. A popular source of point clouds are three dimensional shape acquisition devices such as laser range scanners. Another important field where point clouds are found is in the representation of high-dimensional manifolds by samples. With the increasing popularity and very broad applications of this source of data, it is natural and important to work directly with this representation, without having to go to the intermediate and sometimes impossible and distorting steps of surface reconstruction. A geometric framework for comparing manifolds given by point clouds is presented in this paper. The underlying theory is based on Gromov-Hausdorff distances, leading to isometry invariant and completely geometric comparisons. This theory is embedded in a probabilistic setting as derived from random sampling of manifolds, and then combined with results on matrices of pairwise geodesic distances to lead to a computational implementation of the framework. The theoretical and computational results here presented are complemented with experiments for real three dimensional shapes.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Computational geometry
F. Frances Yao
- 02 Jan 1991
TL;DR: This report documents the program and the outcomes of Dagstuhl Seminar 21181 “Computational Geometry”, which was held online in a virtual manner, and 36 participants from various countries attended it.
1.6K
Gromov–Wasserstein Distances and the Metric Approach to Object Matching
TL;DR: This paper discusses certain modifications of the ideas concerning the Gromov–Hausdorff distance which have the goal of modeling and tackling the practical problems of object matching and comparison by proving explicit lower bounds for the proposed distance that involve many of the invariants previously reported by researchers.
667
Three-Dimensional Face Recognition
TL;DR: The result is an efficient and accurate face recognition algorithm, robust to facial expressions, that can distinguish between identical twins and compare its performance to classical face recognition methods.
Blended intrinsic maps
Vladimir G. Kim,Yaron Lipman,Thomas Funkhouser +2 more
- 25 Jul 2011
TL;DR: This paper describes a fully automatic pipeline for finding an intrinsic map between two non-isometric, genus zero surfaces and solves a global optimization problem that selects candidate maps based both on their area preservation and consistency with other selected maps.
References
A global geometric framework for nonlinear dimensionality reduction.
TL;DR: An approach to solving dimensionality reduction problems that uses easily measured local metric information to learn the underlying global geometry of a data set and efficiently computes a globally optimal solution, and is guaranteed to converge asymptotically to the true structure.
An Introduction To Probability Theory And Its Applications
Feller William
- 01 Jan 1950
TL;DR: A First Course in Probability (8th ed.) by S. Ross is a lively text that covers the basic ideas of probability theory including those needed in statistics.
10.2K
Laplacian Eigenmaps for dimensionality reduction and data representation
Mikhail Belkin,Partha Niyogi +1 more
TL;DR: In this article, the authors proposed a geometrically motivated algorithm for representing high-dimensional data, based on the correspondence between the graph Laplacian, the Laplace Beltrami operator on the manifold and the connections to the heat equation.
Comparing images using the Hausdorff distance
TL;DR: Efficient algorithms for computing the Hausdorff distance between all possible relative positions of a binary image and a model are presented and it is shown that the method extends naturally to the problem of comparing a portion of a model against an image.
4.7K