Integral estimation from point cloud in d-dimensional space: a geometric view

Integration over a domain, such as a Euclidean space or a Riemannian manifold, is a fundamental problem across scientific fields. Many times, the underlying domain is only accessible through a discrete approximation, such as a set of points sampled from it, and it is crucial to be able to estimate integral in such discrete settings. In this paper, we study the problem of estimating the integral of a function defined over a k-submanifold embedded in $d$-dimensional space, from its function values at a set of sample points. Previously, such estimation is usually obtained in a statistical setting, where input data is typically assumed to be drawn from certain probabilistic distribution. Our paper is the first to consider this important problem of estimating integral from point clouds data (PCD) under the more general non-statistical setting, and provide certain theoretical guarantees. Our approaches consider the problem from a geometric point of view. Specifically, we estimate the integral by computing a weighted sum, and propose two weighting schemes: the Voronoi and the Principle Eigenvector schemes. The running time of both methods depends mostly on the intrinsic dimension of the underlying manifold, instead of on the ambient dimensions. We show that the estimation based on the Voronoi scheme converges to the true integral under the so-called (ε, δ)-sampling condition with explicit error bound presented. This is the first result of this sort for estimating integral from general PCD. For the Principle Eigenvector scheme, although no theoretical guarantee is established, we present its connection to the Heat diffusion operator, and illustrate justifications behind its construction. Experimental results show that both new methods consistently produce more accurate integral estimations than common statistical methods under various sampling conditions.

[1]  Yajun Wang,et al.  Provable dimension detection using principal component analysis , 2005, Symposium on Computational Geometry.

[2]  Ralph R. Martin,et al.  Using low-discrepancy sequences and the Crofton formula to compute surface areas of geometric models , 2003, Comput. Aided Des..

[3]  D. Ross Computer-aided design , 1961, CACM.

[4]  A. Macbeath STUDIES IN GLOBAL GEOMETRY AND ANALYSIS , 1970 .

[5]  Jun-Hai Yong,et al.  A quasi-Monte Carlo method for computing areas of point-sampled surfaces , 2006, Comput. Aided Des..

[6]  Joachim Giesen,et al.  Shape dimension and intrinsic metric from samples of manifolds with high co-dimension , 2003, SCG '03.

[7]  J. Hammersley MONTE CARLO METHODS FOR SOLVING MULTIVARIABLE PROBLEMS , 1960 .

[8]  Jiří Zelinka,et al.  Kernel Density Estimation Toolbox for Matlab , 2011 .

[9]  Siu-Wing Cheng,et al.  Dimension detection via slivers , 2009, SODA.

[10]  S. Rosenberg The Laplacian on a Riemannian Manifold: An Introduction to Analysis on Manifolds , 1997 .

[11]  Mikhail Belkin,et al.  Discrete laplace operator on meshed surfaces , 2008, SCG '08.

[12]  Mikhail Belkin,et al.  Towards a theoretical foundation for Laplacian-based manifold methods , 2005, J. Comput. Syst. Sci..

[13]  Leonidas J. Guibas,et al.  Manifold Reconstruction in Arbitrary Dimensions Using Witness Complexes , 2007, SCG '07.

[14]  Sunghee Choi,et al.  A simple algorithm for homeomorphic surface reconstruction , 2000, SCG '00.

[15]  Tamal K. Dey,et al.  Shape Dimension and Approximation from Samples , 2002, SODA '02.

[16]  György Elekes,et al.  A geometric inequality and the complexity of computing volume , 1986, Discret. Comput. Geom..

[17]  Mikhail Belkin,et al.  Convergence of Laplacian Eigenmaps , 2006, NIPS.

[18]  Mikhail Belkin,et al.  Constructing Laplace operator from point clouds in Rd , 2009, SODA.

[19]  Tamal K. Dey,et al.  Curve and Surface Reconstruction , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[20]  Sariel Har-Peled,et al.  Projective clustering in high dimensions using core-sets , 2002, SCG '02.

[21]  Marshall W. Bern,et al.  Surface Reconstruction by Voronoi Filtering , 1998, SCG '98.

[22]  Zoltán Füredi,et al.  Computing the volume is difficult , 1986, STOC '86.

[23]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.