Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Progressive geometry compression
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
IEEE Transactions on Visualization and Computer Graphics
Robust transmission of 3D geometry over lossy networks
Web3D '03 Proceedings of the eighth international conference on 3D Web technology
Error-resilient transmission of 3D models
ACM Transactions on Graphics (TOG)
EURASIP Journal on Applied Signal Processing
An unequal error protection method for progressively transmitted 3D models
IEEE Transactions on Multimedia
IEEE Journal on Selected Areas in Communications
Error-resilient coding of 3-D graphic models via adaptive mesh segmentation
IEEE Transactions on Circuits and Systems for Video Technology
Mesh segmentation schemes for error resilient coding of 3-D graphic models
IEEE Transactions on Circuits and Systems for Video Technology
Bit allocation for joint source and channel coding of progressively compressed 3-D models
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.00 |
We consider a state-of-the-art system that uses layered source coding and forward error correction with Reed-Solomon codes to efficiently transmit 3-D 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 compressed progressive meshes (CPM) mesh compression technique.