Abstract
In predictive 3-D mesh geometry coding, the position of each vertex is predicted from the previously coded neighboring vertices and the resultant prediction error vectors are coded. In this work, the prediction error vectors are represented in a local coordinate system in order to cluster them around a subset of a 2-D planar subspace and thereby increase block coding efficiency. Alphabet entropy constrained vector quantization (AECVQ) of Rao and Pearlman is preferred to the previously employed minimum distortion vector quantization (MDVQ) for block coding the prediction error vectors with high coding efficiency and low implementation complexity. Estimation and compensation of the bias in the parallelogram prediction rule and partial adaptation of the AECVQ codebook to the encoded vector source by normalization using source statistics, are the other salient features of the proposed coding system. Experimental results verify the advantage of the use of the local coordinate system over the global one. The visual error of the proposed coding system is lower than the predictive coding method of Touma and Gotsman especially at low rates, and lower than the spectral coding method of Karni and Gotsman at medium-to-high rates.
Original language | English |
---|---|
Pages (from-to) | 341-353 |
Number of pages | 13 |
Journal | Journal of Visual Communication and Image Representation |
Volume | 18 |
Issue number | 4 |
DOIs | |
Publication status | Published - Aug 2007 |
Externally published | Yes |
Funding
This work was partially supported by and carried out under Project No. 103E004 of TUBITAK (The Scientific & Technological Research Council of Turkey).
Funders | Funder number |
---|---|
TUBITAK | |
Türkiye Bilimsel ve Teknolojik Araştirma Kurumu |
Keywords
- Entropy constrained vector quantization
- Local coordinate system
- Mesh geometry compression
- Parallelogram prediction
- Shannon lower bound