Higher Order Prediction for Geometry Compression (bibtex)
by ,
Abstract:
A lot of techniques have been developed for the encoding of triangular meshes as this is a widely used representation for the description of surface models. Although methods for the encoding of the neighbor information, the connectivity, are near optimal, there is still room for better en-codings of vertex locations, the geometry. Our geometry encoding strategy follows the predictive coding paradigm, which is based on a region growing encoding order. Only the delta vectors between original and predicted locations are encoded in a local coordinate system, which splits into two tangential and one normal component. In this paper we introduce so-called higher order prediction for an improved encoding of the normal component. We first encode the tangential components with parallelogram prediction. Then we fit a higher order surface to the so far encoded geometry. As we encode the normal component as a bending angle, it is found by intersecting the higher order surface with the circle defined by the tangential components. Experimental results show that our strategy allows saving one bit per vertex for the normal component independent of the tangential prediction rule used.
Reference:
Higher Order Prediction for Geometry Compression (Stefan Gumhold, Rachida Amjoun), In Proceedings of International Conference On Shape Modelling And Applications, 2003.
Bibtex Entry:
@INPROCEEDINGS{Gumhold-2003-Highera,
	AUTHOR = {Stefan Gumhold and Rachida Amjoun},
	AFFILIATIONS = {CGV,GRIS},
	AREAS = {areagp},
  BOOKTITLE = {Proceedings of International Conference On Shape Modelling And Applications},
  TITLE = {Higher Order Prediction for Geometry Compression},
  PAGES = {59--66},
  YEAR = {2003},
	MONTH = {May},
	ABSTRACT = {A lot of techniques have been developed for the encoding of triangular meshes 
		as this is a widely used representation for the description of surface models. Although 
		methods for the encoding of the neighbor information, the connectivity, are near optimal, 
		there is still room for better en-codings of vertex locations, the geometry. Our geometry 
		encoding strategy follows the predictive coding paradigm, which is based on a region growing 
		encoding order. Only the delta vectors between original and predicted locations are encoded 
		in a local coordinate system, which splits into two tangential and one normal component. 
		In this paper we introduce so-called higher order prediction for an improved encoding of 
		the normal component. We first encode the tangential components with parallelogram prediction. 
		Then we fit a higher order surface to the so far encoded geometry. As we encode the normal 
		component as a bending angle, it is found by intersecting the higher order surface with the 
		circle defined by the tangential components. Experimental results show that our strategy 
		allows saving one bit per vertex for the normal component independent of the tangential 
		prediction rule used.},
	KEYWORDS = {computational geometry;data compression;mesh generation;surface fitting;bending angle;delta vector;geometry compression;geometry encoding;higher order prediction;local coordinate system;
		model description representation;near optimal connectivity;neighbor information;normal component encoding;parallelogram prediction;predictive coding;region growing encoding order;surface fitting;
		surface model;tangential component;triangular mesh encoding;vertex location;Application software;Computer graphics;Decoding;Encoding;Games;Image coding;Information geometry;Predictive coding;
		Predictive models;Surface fitting}, 
	DOI = {10.1109/SMI.2003.1199602},
	URL = {http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1199602}
}
Powered by bibtexbrowser