基于周围顶点结构的多分辨率分解三角形网格几何编码

S. Watanabe, A. Kawanaka
{"title":"基于周围顶点结构的多分辨率分解三角形网格几何编码","authors":"S. Watanabe, A. Kawanaka","doi":"10.1109/ISSPIT.2008.4775699","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new polygonal mesh geometry coding scheme based on a process of structuring by acquiring surrounding vertices of the polygonal mesh one layer at a time. The structuring process begins by selecting the start vertex and proceeding by acquiring surrounding vertices of the polygonal mesh. As a result, we obtain a 2-D structured vertex table. Structured geometry data are generated according to the structured vertices and encoded by a multiresolution decomposition and space frequency quantization coding method. In our proposed scheme, the multiresolution decomposition uses the connectivity of the polygonal mesh. In addition, with a space frequency quantization coding scheme, we can reduce redundancies of decomposed coefficients at similar positions in different components of decomposition level. Experimental results show that the proposed scheme gives better coding performance at lower bit-rates than the usual schemes.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"114 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Triangular Mesh Geometry Coding with Multiresolution Decomposition Based on Structuring of Surrounding Vertices\",\"authors\":\"S. Watanabe, A. Kawanaka\",\"doi\":\"10.1109/ISSPIT.2008.4775699\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a new polygonal mesh geometry coding scheme based on a process of structuring by acquiring surrounding vertices of the polygonal mesh one layer at a time. The structuring process begins by selecting the start vertex and proceeding by acquiring surrounding vertices of the polygonal mesh. As a result, we obtain a 2-D structured vertex table. Structured geometry data are generated according to the structured vertices and encoded by a multiresolution decomposition and space frequency quantization coding method. In our proposed scheme, the multiresolution decomposition uses the connectivity of the polygonal mesh. In addition, with a space frequency quantization coding scheme, we can reduce redundancies of decomposed coefficients at similar positions in different components of decomposition level. Experimental results show that the proposed scheme gives better coding performance at lower bit-rates than the usual schemes.\",\"PeriodicalId\":213756,\"journal\":{\"name\":\"2008 IEEE International Symposium on Signal Processing and Information Technology\",\"volume\":\"114 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE International Symposium on Signal Processing and Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSPIT.2008.4775699\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Symposium on Signal Processing and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPIT.2008.4775699","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种新的多边形网格几何编码方案,该方案基于一层一层获取多边形网格周围顶点的结构化过程。构造过程首先选择起始顶点,然后获取多边形网格的周围顶点。结果,我们得到了一个二维结构化的顶点表。根据结构化顶点生成结构化几何数据,采用多分辨率分解和空间频率量化编码方法进行编码。在我们提出的方案中,多分辨率分解利用了多边形网格的连通性。此外,采用空间频率量化编码方案,可以减少分解系数在分解层次不同分量相似位置的冗余度。实验结果表明,该方案在较低比特率下具有较好的编码性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Triangular Mesh Geometry Coding with Multiresolution Decomposition Based on Structuring of Surrounding Vertices
In this paper, we propose a new polygonal mesh geometry coding scheme based on a process of structuring by acquiring surrounding vertices of the polygonal mesh one layer at a time. The structuring process begins by selecting the start vertex and proceeding by acquiring surrounding vertices of the polygonal mesh. As a result, we obtain a 2-D structured vertex table. Structured geometry data are generated according to the structured vertices and encoded by a multiresolution decomposition and space frequency quantization coding method. In our proposed scheme, the multiresolution decomposition uses the connectivity of the polygonal mesh. In addition, with a space frequency quantization coding scheme, we can reduce redundancies of decomposed coefficients at similar positions in different components of decomposition level. Experimental results show that the proposed scheme gives better coding performance at lower bit-rates than the usual schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Artificial signals addition for reducing PAPR of OFDM systems Iris Recognition System Using Combined Colour Statistics An Implementation of the Blowfish Cryptosystem Bspline based Wavelets with Lifting Implementation Advanced Bandwidth Brokering Architecture in PLC Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1