Optimal packet loss protection of progressively compressed 3D meshes

De Montfort University Open Research Archive

Show simple item record

dc.contributor.author Ahmad, Shakeel
dc.contributor.author Hamzaoui, Raouf
dc.contributor.author Al-Akaidi, Marwan, 1959-
dc.date.accessioned 2010-01-05T10:29:10Z
dc.date.available 2010-01-05T10:29:10Z
dc.date.issued 2009-11
dc.identifier.citation Ahmad, S., Hamzaoui, R. and Al-Akaidi, M. (2009) Optimal packet loss protection of progressively compressed 3D meshes. IEEE Transactions on Multimedia, 11 (7) pp. 1381-1387. en
dc.identifier.uri http://hdl.handle.net/2086/3202
dc.description ©20009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. en
dc.description This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
dc.description.abstract We consider a state of the art system that uses layered source coding and forward error correction with Reed- Solomon codes to efficiently transmit 3D meshes over lossy packet networks. Given a transmission bit budget, the performance of this system can be optimized by determining how many layers should be sent, how each layer should be packetized, and how many parity bits should be allocated to each layer such that the expected distortion at the receiver is minimum. The previous solution for this optimization problem uses exhaustive search, which is not feasible when the transmission bit budget is large.We propose instead an exact algorithm that solves this optimization problem in linear time and space. We illustrate the advantages of our approach by providing experimental results for the CPM (Compressed Progressive Meshes) mesh compression technique en
dc.description.sponsorship DFG Research Training Group GK-1042. en
dc.language.iso en en
dc.publisher IEEE en
dc.title Optimal packet loss protection of progressively compressed 3D meshes en
dc.type Article en
dc.identifier.doi http://dx.doi.org/10.1109/TMM.2009.2030546
dc.researchgroup Centre for Electronic and Communications Engineering
dc.peerreviewed Yes en
dc.ref2014.selected 1366964034_0610680179770_15_4


Files in this item

This item appears in the following Collection(s)

Show simple item record