×

Normal estimation on manifolds by gradient learning. (English) Zbl 1245.62029

Summary: Normal estimation is an important topic for processing point cloud data and surface reconstruction in computer graphics. We consider the problem of estimating normals for a (unknown) submanifold of a Euclidean space of codimension 1 from random points on the manifold. We propose a kernel-based learning algorithm in an unsupervised form of gradient learning. The algorithm can be implemented by solving a linear algebra problem. Error analysis is conducted under conditions on the true normals of the manifold and the sampling distribution.

MSC:

62G05 Nonparametric estimation
68T05 Learning and adaptive systems in artificial intelligence
46N30 Applications of functional analysis in probability theory and statistics
Full Text: DOI

References:

[1] Alexa, Proceedings of the Conference on Visualization’01 pp 21– (2001) · doi:10.1109/VISUAL.2001.964489
[2] Amenta, ACM SIGGRAPH 2004 Papers pp 264– (2004) · doi:10.1145/1186562.1015713
[3] Boissonnat, Smooth surface reconstruction via natural neighbour interpolation of distance functions, Computational Geometry: Theory and Applications 22 pp 185– (2002) · Zbl 1016.68145 · doi:10.1016/S0925-7721(01)00048-7
[4] Walder, Implicit surface modelling with a globally regularised basis of compact support, Computer Graphics Forum 25 pp 635– (2006) · doi:10.1111/j.1467-8659.2006.00983.x
[5] Pauly, Shape modeling with point-sampled geometry, ACM Transactions on Graphics 22 pp 641– (2003) · doi:10.1145/882262.882319
[6] Mitra, Estimating surface normals in noisy point cloud data, International Journal of Computational Geometry and Applications 14 pp 261– (2004) · Zbl 1056.94504 · doi:10.1142/S0218195904001470
[7] Mukherjee, Learning gradients and feature selection on manifolds, Bernoulli 16 pp 181– (2010) · Zbl 1200.62070 · doi:10.3150/09-BEJ206
[8] Mukherjee, Learning coordinate covariances via gradients, Journal of Machine Learning Research 7 pp 519– (2006) · Zbl 1222.68270
[9] Mukherjee, Estimation of gradient and coordinate covariation in classification, Journal of Machine Learning Research 7 pp 2481– (2006) · Zbl 1222.62078
[10] Belkin, Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry pp 278– (2008) · Zbl 1271.65030 · doi:10.1145/1377676.1377725
[11] Belkin, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms pp 1031– (2009) · doi:10.1137/1.9781611973068.112
[12] Do Carmo, Riemannian Geometry (1992) · doi:10.1007/978-1-4757-2201-7
[13] Aronszajn, Theory of reproducing kernels, Transactions of the American Mathematical Society 68 pp 337– (1950) · Zbl 0037.20701 · doi:10.1090/S0002-9947-1950-0051437-7
[14] Wu, Learning with sample dependent hyposisthesis spaces, Computers and Mathematics with Applications 56 pp 2896– (2008) · Zbl 1165.68388 · doi:10.1016/j.camwa.2008.09.014
[15] Giné, IMS Lecture Notes-Monogragh Series, in: High Dimensional Probability pp 238– (2006) · Zbl 1124.60030 · doi:10.1214/074921706000000888
[16] Cucker, Learning Theory: An Approximation Theory Viewpoint (2007) · Zbl 1274.41001 · doi:10.1017/CBO9780511618796
[17] Smale, Learning theory estimates via integral operators and their approximations, Constructive Approximation 26 pp 153– (2007) · Zbl 1127.68088 · doi:10.1007/s00365-006-0659-y
[18] McDiarmid, On the method of bounded differences, Surveys in Combinatorics 141 pp 148– (1989) · Zbl 0712.05012
[19] Koltchinskii, High Dimensional Probability II pp 443– (2000) · doi:10.1007/978-1-4612-1358-1_29
[20] van der Vaart, Weak Convergence and Empirical Processes (1996) · Zbl 0862.60002 · doi:10.1007/978-1-4757-2545-2
[21] Ye, SVM learning and Lp approximation by Gaussians on Riemannian manifolds, Analysis and Applications 7 pp 309– (2009) · Zbl 1175.68346 · doi:10.1142/S0219530509001384
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.