Bit allocation for joint source and channel coding of progressively compressed 3-D models
Al-Regib, G.
Altunbasak, Y.
Mersereau, R.M.
Center for Signal & Image Process., Georgia Inst. of Technol., Atlanta, GA, USA;
This paper appears in: Circuits and Systems for Video Technology, IEEE Transactions on
Publication Date: Feb. 2005
Volume: 15,
Issue: 2
On page(s): 256- 268
ISSN: 1051-8215
INSPEC Accession Number: 8278475
Digital Object Identifier: 10.1109/TCSVT.2004.841638
Current Version Published: 2005-02-07
Abstract
This work presents a joint source and channel coding method for transmission of progressively compressed three-dimensional (3-D) models where the bit budget is allocated optimally. The proposed system uses the Compressed Progressive Mesh (CPM) algorithm to produce a hierarchical bitstream representing different levels of detail (LODs). In addition to optimizing the transmitted bitstream with respect to the channel characteristics, we also choose the optimum combination of quantization and tessellation to maximize the expected decoded model quality. That is, given a 3-D mesh, a total bit budget (B) and a channel packet-loss rate (PLR), we determine the optimum combination of: 1) the geometry coordinates quantizer step size (l-bit); 2) the number of transmitted batches (L); 3) the total number of channel coding bits (C); and 4) the distribution of these channel coding bits among the transmitted levels (CL). Experimental results show that, with our unequal error protection approach that uses the proposed bit-allocation algorithm, the decoded model quality degrades more gracefully (compared to either no error protection or equal error protection methods) as the packet-loss rate increases.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
