Arithmetic coding for data compression
Communications of the ACM
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Mesh reduction with error control
Proceedings of the 7th conference on Visualization '96
Geometric compression through topological surgery
ACM Transactions on Graphics (TOG)
Progressive forest split compression
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Real time compression of triangle mesh connectivity
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Tetrahedral mesh compression with the cut-border machine
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Face fixer: compressing polygon meshes with properties
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Progressive geometry compression
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Spectral compression of mesh geometry
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Progressive compression for lossless transmission of triangle meshes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Compressing polygon mesh geometry with parallelogram prediction
Proceedings of the conference on Visualization '02
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
IEEE Transactions on Visualization and Computer Graphics
Vertex Data Compression through Vector Quantization
IEEE Transactions on Visualization and Computer Graphics
3D mesh compression using fixed spectral bases
GRIN'01 No description on Graphics interface 2001
Vertex Data Compression for Triangular Meshes
PG '00 Proceedings of the 8th Pacific Conference on Computer Graphics and Applications
Higher Order Prediction for Geometry Compression
SMI '03 Proceedings of the Shape Modeling International 2003
High-pass quantization for mesh encoding
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Geometry compression of normal meshes using rate-distortion algorithms
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Geometry prediction for high degree polygons
Proceedings of the 21st spring conference on Computer graphics
An efficient bit allocation for compressing normal meshes with an error-driven quantization
Computer Aided Geometric Design - Special issue: Geometry processing
Technologies for 3D mesh compression: A survey
Journal of Visual Communication and Image Representation
Space-frequency quantization for wavelet image coding
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.00 |
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.