Please use this identifier to cite or link to this item:
|Title:||An analytical model for progressive mesh streaming||Authors:||Cheng, W.
|Issue Date:||2007||Citation:||Cheng, W.,Ooi, W.T.,Mondet, S.,Grigoras, R.,Morin, G. (2007). An analytical model for progressive mesh streaming. Proceedings of the ACM International Multimedia Conference and Exhibition : 737-746. ScholarBank@NUS Repository. https://doi.org/10.1145/1291233.1291399||Abstract:||3D triangular mesh is becoming an increasingly important data type for networked applications such as digital museums, online games, and virtual worlds. In these applications, a multi-resolution representation is typically desired for streaming large 3D meshes, allowing for incremental rendering at the viewers while data is still being transmitted. Such progressive coding, however, introduces dependencies between data. This paper quantitatively analyzes the effects of such dependency on the intermediate decoded mesh quality when the progressive mesh is transmitted over a lossy network, by modeling the distribution of decoding time as a function of mesh properties and network parameters. To illustrate the usefulness of our analytical model, we describe three of its applications. First, we show how it can be used to analytically compute the expected decoded mesh quality. Second, we study two extreme cases of dependency in progressive mesh and show that the effect of dependencies on decoded mesh quality diminishes with time. Finally, based on the model, we propose a packetization strategy that improves the decoded mesh quality during the initial stage of streaming. Copyright 2007 ACM.||Source Title:||Proceedings of the ACM International Multimedia Conference and Exhibition||URI:||http://scholarbank.nus.edu.sg/handle/10635/41866||ISBN:||9781595937025||DOI:||10.1145/1291233.1291399|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 15, 2019
checked on May 17, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.