Abstract
When a 3D model is transmitted over a lossy network, some model information may inevitably be missing. Under such situation, one may not be able to visualize the receiving model unless the lost model information has been retransmitted. Progressive model transmission offers an alternative to avoid the “all or nothing situation” by allowing a model to be visualized with a degraded quality when only part of the model data has been received. Unfortunately, in case some model refinement information is missing, one may still need to wait for such information to be retransmitted before the model can be rendered with a desired visual quality. To address this problem, we have developed a novel error resilient packetization scheme. We first construct a Non-Redundant Directed Acyclic Graph to encode the dependencies among the vertex splits of a progressive mesh. A special Global Graph Equipartition Packing Algorithm is then applied to partitioning this graph into several equal size sub-graphs, which is packed as packets. The packing algorithm comprises two main phases: initial partition phase and global refinement phase. Experimental results demonstrate that the proposed scheme can minimize the dependencies between packets. Hence, it reduces the delay in rendering 3D models with proper quality at the clients.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chen Z, Barnes F J, Bodenheimer B. Hybrid and forward error correction transmission techniques for unreliable transport of 3D geometry. Multimedia Systems Journal, March 2005, 10(3): 230–244.
Al-Regib G, Altunbasak Y. 3TP: An application-layer protocol for streaming 3-D models. IEEE Transactions on Multimedia, 2005, 7(6): 1149–1156.
Peterson L L, Davie B S. Computer Networks. Academic Press, CA, 2000.
Al-Regib G, Altunbasak Y. An unequal error protection method for packet loss resilient 3-D mesh transmission. In Proc. IEEE INFOCOM, New York, USA, 2002, 2: 743–752.
Tian D, AlRegib G. On-demand transmission of 3D models over lossy networks. SIP Journal on Signal Processing: Image Communication, 2006, 21(5): 396–415.
Girod B, Stuhlmuller K, Link M, Horn U. Packet loss resilient Internet video streaming. In Proc. SPIE Visual Communication and Image Processing, San Jose, CA, USA, 1999, pp.833–844.
Chen Z, Bodenheimer B, Barnes J F. Extending progressive meshes for use over unreliable networks. In Proc. the IEEE Conference on Multimedia and Expo, Baltimore, MD, Vol.3, July 2003, pp.253–256.
Bischoff S, Kobbelt L. Towards robust broadcasting of geometry data. Computers & Graphics, 2002, 26(5): 665–675.
Sung-Bum Park, Chang-Su Kim, Sang-UK Lee. Error resilient coding of 3-D meshes. In Proc. International Conference on Image Processing, Barcelona, Vol.1, 2003, pp.I–773–I–776.
Yan Z, Kumar S, Kuo C C J. Mesh segmentation schemes for error resilient coding of 3-D graphic models. IEEE Trans. Circuits Syst. Video Techn, 2005, 15(1): 138–144.
Al-regib G, Altunbasak Y, Rossignac J. Error-resilient transmission of 3D models. ACM Transactions on Graphics, 2005, 24(2): 182–208.
Hoppe H. Progressive meshes. In Proc. SIGGRAPH 96, New Orleans, USA, 1996, pp.99–108.
Floriani L De, Magillo P. Multiresolution Mesh Representation: Models and Data Structures. Multiresolution in Geometric Modelling, Floater M, Iske A, Qwak E (eds.), Springer-Verlag, 2002, pp.363–418.
Guéziec A, Taubin G, Lazarus F, Horn W. Simplicial maps for progressive transmission of polygonal surfaces. In Proc. ACM Int. Conf. Virtual Reality and Modeling Language (VRML’98), Monterey, USA, 1998, pp.25–31.
Zheng Z, Chan T KY. View-dependent progressive mesh using non-redundant DAG hierarchy. In Proc. the 3rd Int. Conf. Computer Graphics and Interactive Techniques in Australia and South East Asia, Dunedin, New Zeeland, 2005, pp.417–420.
Pereira F, Ebrahimi T. The MPEG-4 Book [M]. IMSC Press and Prentice Hall, USA, 2002.
Harris A F, Kravets R. The design of a transport protocol for on-demand graphical rendering. In Proc. NOSSDAV, Miami, USA, 2002, pp.43–49.
Gu Y, Ooi W T. Packetization of 3D progressive meshes for streaming over lossy networks. In Proc. International Conference on Computer Communications and Networks (IC3N), San Diego, CA, USA, October 17–19, 2005, pp.415–420.
Mitchell J. Branch-and-cut for the k-way equipartition problem. Technical Report, Rensselaer Polytechnique Institute, 2001.
Frieze A, Jerrum M. Improved approximation algorithms for max k-cut and max bisection. In Proc. the Fourth IPCO Conference, Copenhagen, Denmark, 1995, pp.1–13.
Karisch S E, Rendl F. Semidenite programming and graph equipartition. Topics in Semide_nite and Interior-Point Methods, Pardalos P M, Wolkowicz H (eds.), Fields Institute Communications, AMS, 1998, 18: 77–95.
Karypis G, Kumar V. A fast and high quality multilevel scheme for partitioning, irregular graphs. SIAM Journal on Scientific Computing, 1998, 20(1): 359–392.
Kernighan B W, Lin S. An efficient heuristic procedure for partitioning graphs. Bell Sys., Tech. J., 1970, 49: 291–307.
UCB/LBNL/VINT. Network simulator ns (Version 2). Available on URL: http://www.isi.edu/nsnam/ns/.
Velten D, Hinden R. Sax v. reliable data protocol. RFC 908, 1984.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China under Grant No. 60533080, and the National Research Foundation for Doctoral Program of Higher Education of China Under Grant No. 20060335111.
Electronic supplementary material
Below is the link to the electronic supplementary material.
Rights and permissions
About this article
Cite this article
Yang, BL., Li, F.W.B., Pan, ZG. et al. An Effective Error Resilient Packetization Scheme for Progressive Mesh Transmission over Unreliable Networks. J. Comput. Sci. Technol. 23, 1015–1025 (2008). https://doi.org/10.1007/s11390-008-9195-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11390-008-9195-y