Reducing and Filtering Point Clouds With Enhanced Vector Quantization

Modern scanners are able to deliver huge quantities of three-dimensional (3-D) data points sampled on an object's surface, in a short time. These data have to be filtered and their cardinality reduced to come up with a mesh manageable at interactive rates. We introduce here a novel procedure to accomplish these two tasks, which is based on an optimized version of soft vector quantization (VQ). The resulting technique has been termed enhanced vector quantization (EVQ) since it introduces several improvements with respect to the classical soft VQ approaches. These are based on computationally expensive iterative optimization; local computation is introduced here, by means of an adequate partitioning of the data space called hyperbox (HB), to reduce the computational time so as to be linear in the number of data points N, saving more than 80% of time in real applications. Moreover, the algorithm can be fully parallelized, thus leading to an implementation that is sublinear in N. The voxel side and the other parameters are automatically determined from data distribution on the basis of the Zador's criterion. This makes the algorithm completely automatic. Because the only parameter to be specified is the compression rate, the procedure is suitable even for nontrained users. Results obtained in reconstructing faces of both humans and puppets as well as artifacts from point clouds publicly available on the web are reported and discussed, in comparison with other methods available in the literature. EVQ has been conceived as a general procedure, suited for VQ applications with large data sets whose data space has relatively low dimensionality

[1]  Gabriel Taubin,et al.  The ball-pivoting algorithm for surface reconstruction , 1999, IEEE Transactions on Visualization and Computer Graphics.

[2]  Paul L. Zador,et al.  Asymptotic quantization error of continuous signals and the quantization dimension , 1982, IEEE Trans. Inf. Theory.

[3]  Mauro Maggioni,et al.  Multiscale approximation with hierarchical radial basis functions networks , 2004, IEEE Transactions on Neural Networks.

[4]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.

[5]  Dinesh Manocha,et al.  Simplifying complex environments using incremental textured depth meshes , 2003, ACM Trans. Graph..

[6]  C. Ian Connolly,et al.  Cumulative generation of octree models from range data , 1984, ICRA.

[7]  Tony DeRose,et al.  Surface reconstruction from unorganized points , 1992, SIGGRAPH.

[8]  Peter Tino,et al.  IEEE Transactions on Neural Networks , 2009 .

[9]  Bernd Fritzke,et al.  Growing cell structures--A self-organizing network for unsupervised and supervised learning , 1994, Neural Networks.

[10]  Gerd Hirzinger,et al.  A self-organizing algorithm for multisensory surface reconstruction , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

[11]  Michael Garland,et al.  Efficient adaptive simplification of massive meshes , 2001, Proceedings Visualization, 2001. VIS '01..

[12]  Jürgen Schmidhuber,et al.  Self-organizing nets for optimization , 2004, IEEE Transactions on Neural Networks.

[13]  Gerhard Roth,et al.  An Efficient Volumetric Method for Building Closed Triangular Meshes from 3-D Image and Point Data , 1997, Graphics Interface.

[14]  Vladimir Cherkassky,et al.  Learning rate schedules for self-organizing maps , 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 3 - Conference C: Signal Processing (Cat. No.94CH3440-5).

[15]  Paolo Cignoni,et al.  A comparison of mesh simplification algorithms , 1998, Comput. Graph..

[16]  Marc Levoy,et al.  A volumetric method for building complex models from range images , 1996, SIGGRAPH.

[17]  Palma Blonda,et al.  A survey of fuzzy clustering algorithms for pattern recognition. I , 1999, IEEE Trans. Syst. Man Cybern. Part B.

[18]  Giancarlo Ferrigno,et al.  Autoscan: A Flexible and Portable 3D Scanner , 1998, IEEE Computer Graphics and Applications.

[19]  Markus H. Gross,et al.  Spectral processing of point-sampled geometry , 2001, SIGGRAPH.

[20]  Vincenzo Piuri,et al.  Automatic multiscale meshing through HRBF networks , 2005, IEEE Transactions on Instrumentation and Measurement.

[21]  Anath Fischer,et al.  Parameterization and Reconstruction from 3D Scattered Points Based on Neural Network and PDE Techniques , 2001, IEEE Trans. Vis. Comput. Graph..

[22]  T. Hastie,et al.  Principal Curves , 2007 .

[23]  Martin Isenburg,et al.  Out-of-core compression for gigantic polygon meshes , 2003, ACM Trans. Graph..

[24]  Benjamin Watson,et al.  Model Simplification Through Refinement , 2000, Graphics Interface.

[25]  John E. Moody,et al.  Note on Learning Rate Schedules for Stochastic Optimization , 1990, NIPS.

[26]  Markus H. Gross,et al.  Efficient simplification of point-sampled surfaces , 2002, IEEE Visualization, 2002. VIS 2002..

[27]  Jarek Rossignac,et al.  Out‐of‐core compression and decompression of large n‐dimensional scalar fields , 2003, Comput. Graph. Forum.

[28]  Jarek Rossignac,et al.  Multi-resolution 3D approximations for rendering complex scenes , 1993, Modeling in Computer Graphics.

[29]  William E. Lorensen,et al.  Marching cubes: a high resolution 3D surface construction algorithm , 1996 .

[30]  Marc Levoy,et al.  The digital Michelangelo project: 3D scanning of large statues , 2000, SIGGRAPH.

[31]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[32]  Michael Petrov,et al.  Optical 3D Digitizers: Bringing Life to the Virtual World , 1998, IEEE Computer Graphics and Applications.

[33]  Joachim M. Buhmann,et al.  Competitive learning algorithms for robust vector quantization , 1998, IEEE Trans. Signal Process..

[34]  Heinrich Müller,et al.  Interpolation and Approximation of Surfaces from Three-Dimensional Scattered Data Points , 1997, Scientific Visualization Conference (dagstuhl '97).

[35]  M. V. Velzen,et al.  Self-organizing maps , 2007 .

[36]  Tony DeRose,et al.  Piecewise smooth surface reconstruction , 1994, SIGGRAPH.

[37]  Essaid Bouktache,et al.  A Fast Algorithm for the Nearest-Neighbor Classifier , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[38]  Frédo Durand,et al.  Non-iterative, feature-preserving mesh smoothing , 2003, ACM Trans. Graph..

[39]  Giancarlo Ferrigno,et al.  AUTOSCAN: A flexible and portable scanner of 3D surfaces , 1998 .

[40]  Thomas Ertl,et al.  Computer Graphics - Principles and Practice, 3rd Edition , 2014 .

[41]  M. Carter.  Computer graphics: Principles and practice , 1997 .

[42]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[43]  Kok-Lim Low,et al.  Model simplification using vertex-clustering , 1997, SI3D.

[44]  Marc Levoy,et al.  Real-time 3D model acquisition , 2002, ACM Trans. Graph..

[45]  Sunghee Choi,et al.  The power crust , 2001, SMA '01.

[46]  Thomas Martinetz,et al.  'Neural-gas' network for vector quantization and its application to time-series prediction , 1993, IEEE Trans. Neural Networks.

[47]  Ming Xie,et al.  Color clustering and learning for image segmentation based on neural networks , 2005, IEEE Trans. Neural Networks.