Title: New methods for progressive compression of colored 3D Mesh
Authors: Lee, Ho
Lavoué, Guillaume
Dupont, Florent
Citation: WSCG 2010: Communication Papers Proceedings: 18th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision in co-operation with EUROGRAPHICS, p. 199-206.
Issue Date: 2010
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/WSCG2010/Papers_2010/!_2010_Short-proceedings.pdf
ISBN: 978-80-86943-87-9
Keywords: progresivní komprese;kolorovaná 3D mřížka
Keywords in different language: progressive compression;colored 3D mesh
Abstract: In this paper, we present two methods to compress colored 3D triangular meshes in a progressive way. Although many progressive algorithms exist for efficient encoding of connectivity and geometry, none of these techniques consider the color data in spite of its considerable size. Based on the powerful progressive algorithm from Alliez and Desbrun [All01a], we propose two extensions for progressive encoding and reconstruction of vertex colors: a prediction-based method and a mapping table method. In the first one, after transforming the initial RGB space into the Lab space, each vertex color is predicted by a specific scheme using information of its neighboring vertices. The second method considers a mapping table with reduced number of possible colors in order to improve the rate-distortion tradeoff. Results show that the prediction method produces quite good results even in low resolutions, while the mapping table method delivers similar visual results but with a fewer amount of bits transmitted depending on the color complexity of the model.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG 2010: Communication Papers Proceedings

Files in This Item:
File Description SizeFormat 
Lee.pdfPlný text503,03 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/11060

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.