Loss tolerance scheme for 3D progressive meshes streaming over networks

Nowadays, the Internet provides a convenient medium for sharing complex 3D models online. However, transmitting 3D progressive meshes over networks may encounter the problem of packets loss that can lead to connectivity inconsistency and distortion of the reconstructed meshes. In this paper, we combine reliable and unreliable channels to reduce both time delay and mesh distortion, and we propose an error-concealment scheme for tolerating packet loss when the meshes are transmitted over unreliable network channels. When the loss of connectivity data occurs, the decoder can predict the geometry data and mesh connectivity information, and construct an approximation of the original mesh. Therefore, the proposed error-concealment scheme can significantly reduce the data size required to be transmitted over reliable channels. The results show that both the computational cost of our error-concealment scheme and the distortion introduced by our scheme are small.

[1]  Hui Li,et al.  Middleware for streaming 3D progressive meshes over lossy networks , 2006, TOMCCAP.

[2]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[3]  Yücel Altunbasak,et al.  An unequal error protection method for packet loss resilient 3D mesh transmission , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[5]  Michael Deering,et al.  Geometry compression , 1995, SIGGRAPH.

[6]  Renato Pajarola,et al.  Compressed Progressive Meshes , 2000, IEEE Trans. Vis. Comput. Graph..

[7]  C.-C. Jay Kuo,et al.  Robust encoding of 3D mesh using data partitioning , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[8]  Yücel Altunbasak,et al.  Error-resilient transmission of 3D models , 2005, TOGS.

[9]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.