Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
256 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 15, NO. 2, FEBRUARY 2005 Bit Allocation for Joint Source and Channel Coding
 

Summary: 256 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 15, NO. 2, FEBRUARY 2005
Bit Allocation for Joint Source and Channel Coding
of Progressively Compressed 3-D Models
Ghassan Al-Regib, Yucel Altunbasak, Senior Member, IEEE, and Russell M. Mersereau, Fellow, IEEE
Abstract--This paper presents a joint source and channel coding
method for transmission of progressively compressed three-dimen-
sional (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 dif-
ferent levels of detail (LODs). In addition to optimizing the trans-
mitted bitstream with respect to the channel characteristics, we
also choose the optimum combination of quantization and tessel-
lation to maximize the expected decoded model quality. That is,
given a 3-D mesh, a total bit budget ( ) and a channel packet-loss
rate ( ), we determine the optimum combination of: 1) the ge-
ometry coordinates quantizer step size ( -bit); 2) the number of
transmitted batches ( ); 3) the total number of channel coding bits
( ); 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-allo-

  

Source: Altunbasak, Yucel - School of Electrical and Computer Engineering, Georgia Institute of Technology

 

Collections: Engineering