Sparse coding of dense 3D meshes in mobile cloud applications

With the growing demand for easy and reliable generation of 3D models representing real-world objects and environments in mobile cloud computing platforms, new schemes for acquisition, storage and transmission of 3D meshes are required. In general, 3D meshes consist of two distinct components: vertex positions and vertex connectivity. Vertex position encoders are much more resource demanding than connectivity encoders, stressing the need for novel geometry compression schemes. The design of an accurate and energy efficient geometry compression system can be achieved by: i) reducing the amount of data that should be transmitted ii) minimizing the computational operations executed at the encoder. In this paper, we propose a Bayesian learning approach that allows processing large meshes in parts and reconstructing the Cartesian coordinates of each part from a small number of random linear combinations. The proposed compression/reconstruction approaches minimize the samples that are required for transmission yet assuring accurate reconstruction at the receiver, by exploiting specific local characteristics of the surface geometry in the graph Fourier domain. Simulation studies show that the proposed schemes, as compared to the state of the art approaches, achieve competitive Compression Ratios (CRs), offering at the same time significantly lower compression computational complexity, which is essential for mobile cloud computing platforms.

[1]  Ramsay Dyer,et al.  Spectral Mesh Processing , 2010, Comput. Graph. Forum.

[2]  Pierre Alliez,et al.  Valence‐Driven Connectivity Encoding for 3D Meshes , 2001, Comput. Graph. Forum.

[3]  Esther Rodriguez-Villegas,et al.  Compressive sensing: From “Compressing while Sampling” to “Compressing and Securing while Sampling” , 2010, 2010 Annual International Conference of the IEEE Engineering in Medicine and Biology.

[4]  Zhuo-Ming Du,et al.  3-D geometric signal compression method based on compressed sensing , 2011, 2011 International Conference on Image Analysis and Signal Processing.

[5]  Andrei Khodakovsky,et al.  Progressive geometry compression , 2000, SIGGRAPH.

[6]  Craig Gotsman,et al.  Spectral compression of mesh geometry , 2000, EuroCG.

[7]  Olga Sorkine-Hornung,et al.  Laplacian Mesh Processing , 2005, Eurographics.

[8]  Bruno Lévy,et al.  Spectral Mesh Processing , 2009, SIGGRAPH '10.

[9]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[10]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[11]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[12]  Sivan Toledo,et al.  Algebraic analysis of high-pass quantization , 2005, TOGS.

[13]  Danco Davcev,et al.  Mobile Cloud Computing Environment as a Support for Mobile Learning , 2012, CLOUD 2012.

[14]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[15]  Yung-Hsiang Lu,et al.  Cloud Computing for Mobile Users: Can Offloading Computation Save Energy? , 2010, Computer.