Lossless Mesh Coding based on Space Decomposition and Mesh Saliency

摘要：

In this paper, a novel lossless progressive coding algorithm is presented based on octree decomposition and mesh saliency. Firstly, the triangle mesh is represented by a form of octree structure. Then we encode the vertices of mesh during the traversal of the tree from the root to the leaves. After we calculate the priority value of the node according to its value of saliency, the nonempty node with largest priority value is divided into eight child nodes. To encode a cell subdivision, we encode the number of child cells and the nonempty-child-cell tuple of the target cell. After encoding the geometry of mesh vertices, we encode their connectivity affected by the vertex split. It is shown that the proposed mesh coder is much better than the prior method in geometry and connectivity coding efficiency and it can be easily extended to polygonal mesh coding.

关键词： Mesh compression Octree Decompostion Mesh Saliency Connectivity

作者: Zhaoyi JIANG Shengwei CHEN Bailin YANG

作者单位: College of Computer Science & Information Engineering Zhejiang Gongshang University Hangzhou, China

会议类型: 国际会议

会议名称: 2010 International Conference on Circuit and Signal Processing(2010年电路与信号处理国际会议 ICCSP 2010)

会议地点: 上海

会议语种:英文

页码: 744-747

在线出版日期: 2010-12-25（万方平台首次上网日期，不代表论文的发表时间）