A Multi-Scale Tikhonov Regularization Scheme for Implicit Surface Modelling

Kernel machines have recently been considered as a promising solution for implicit surface modelling. A key challenge of machine learning solutions is how to fit implicit shape models from large-scale sets of point cloud samples efficiently. In this paper, we propose a fast solution for approximating implicit surfaces based on a multi-scale Tikhonov regularization scheme. The optimization of our scheme is formulated into a sparse linear equation system, which can be efficiently solved by factorization methods. Different from traditional approaches, our scheme does not employ auxiliary off-surface points, which not only saves the computational cost but also avoids the problem of injected noise. To further speedup our solution, we present a multi-scale surface fitting algorithm of coarse to fine modelling. We conduct comprehensive experiments to evaluate the performance of our solution on a number of datasets of different scales. The promising results show that our suggested scheme is considerably more efficient than the state-of-the-art approach.

[1]  David E. Breen,et al.  Level set surface editing operators , 2002, ACM Trans. Graph..

[2]  Marcus A. Magnor,et al.  Space-time isosurface evolution for temporally coherent 3D reconstruction , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[3]  Bernhard Schölkopf,et al.  Kernel Methods for Implicit Surface Modeling , 2004, NIPS.

[4]  Thomas Lewiner,et al.  Efficient Implementation of Marching Cubes' Cases with Topological Guarantees , 2003, J. Graphics, GPU, & Game Tools.

[5]  A. Heyden,et al.  Reconstructing open surfaces from unorganized data points , 2004, CVPR 2004.

[6]  James F. O'Brien,et al.  Interpolating and approximating implicit surfaces from polygon soup , 2005, SIGGRAPH Courses.

[7]  Peter Savadjiev,et al.  Surface Recovery from 3D Point Data Using a Combined Parametric and Geometric Flow Approach , 2003, EMMCVPR.

[8]  Bernhard Schölkopf,et al.  Support Vector Machines for 3D Shape Processing , 2005, Comput. Graph. Forum.

[9]  S. Osher,et al.  Fast surface reconstruction using the level set method , 2001, Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision.

[10]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[11]  R. Schaback Creating Surfaces from Scattered Data Using Radial Basis Functions , 1995 .

[12]  Bernhard Schölkopf,et al.  A Generalized Representer Theorem , 2001, COLT/EuroCOLT.

[13]  Hans-Peter Seidel,et al.  A multi-scale approach to 3D scattered data interpolation with compactly supported basis functions , 2003, 2003 Shape Modeling International..

[14]  Jean-Philippe Vert,et al.  Consistency and Convergence Rates of One-Class SVMs and Related Algorithms , 2006, J. Mach. Learn. Res..

[15]  H. Seidel,et al.  Multi-level partition of unity implicits , 2003 .

[16]  Bernhard Schölkopf,et al.  A tutorial on support vector regression , 2004, Stat. Comput..

[17]  Timothy A. Davis,et al.  Algorithm 8 xx : a concise sparse Cholesky factorization package , 2004 .

[18]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[19]  M. Magnor,et al.  Space-time isosurface evolution for temporally coherent 3D reconstruction , 2004, CVPR 2004.

[20]  Bernhard Schölkopf,et al.  Implicit surface modelling as an eigenvalue problem , 2005, ICML.

[21]  Richard K. Beatson,et al.  Reconstruction and representation of 3D objects with radial basis functions , 2001, SIGGRAPH.

[22]  Denis Laurendeau,et al.  3D surface modeling from range curves , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[23]  Tomaso A. Poggio,et al.  Regularization Networks and Support Vector Machines , 2000, Adv. Comput. Math..