动画几何的时间可伸缩压缩

Sanjib Das, H. ShahJaimeen, P. Bora
{"title":"动画几何的时间可伸缩压缩","authors":"Sanjib Das, H. ShahJaimeen, P. Bora","doi":"10.1109/NCVPRIPG.2013.6776263","DOIUrl":null,"url":null,"abstract":"Animation geometry compression involves compressing the geometry data of dynamic three-dimensional (3D) triangular meshes representing the animation frames. The scalability issue of geometry compression addresses compressing the geometry in a single scale and decompressing it in multiple scales. One of the algorithms for animation geometry compression employs the skinning based motion prediction of vertices and the temporal wavelet transform (TWT) on the prediction errors. This paper presents an encoder and a decoder structure for achieving temporally scalable implementation of the algorithm. The frame-wise prediction errors due to motion based clustering of a group of affine transformed vertices are converted into a layered structure of the frames using the TWT. The affine transformation data of vertices, weights corresponding to each cluster of vertices and the wavelet coefficients of the prediction errors are quantized and encoded using the entropy coding. The resulting bit-stream is arranged in a layered structure to achieve temporal scalability. The base layer consists of the connectivity coded first frame, indices of the clusters of vertices, weights corresponding to each cluster of a vertex, the approximation sub-band of prediction error and the affine transformations corresponding to the approximation frames. The enhancement layers consist of the detailed sub-bands of prediction error and the affine transformations corresponding to the detailed frames. The scalable encoder and decoder are tested on some standard animation sequences and the experimental results show good performance in terms of scalable rates and distortions.","PeriodicalId":436402,"journal":{"name":"2013 Fourth National Conference on Computer Vision, Pattern Recognition, Image Processing and Graphics (NCVPRIPG)","volume":"321 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Temporally scalable compression of animation geometry\",\"authors\":\"Sanjib Das, H. ShahJaimeen, P. Bora\",\"doi\":\"10.1109/NCVPRIPG.2013.6776263\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Animation geometry compression involves compressing the geometry data of dynamic three-dimensional (3D) triangular meshes representing the animation frames. The scalability issue of geometry compression addresses compressing the geometry in a single scale and decompressing it in multiple scales. One of the algorithms for animation geometry compression employs the skinning based motion prediction of vertices and the temporal wavelet transform (TWT) on the prediction errors. This paper presents an encoder and a decoder structure for achieving temporally scalable implementation of the algorithm. The frame-wise prediction errors due to motion based clustering of a group of affine transformed vertices are converted into a layered structure of the frames using the TWT. The affine transformation data of vertices, weights corresponding to each cluster of vertices and the wavelet coefficients of the prediction errors are quantized and encoded using the entropy coding. The resulting bit-stream is arranged in a layered structure to achieve temporal scalability. The base layer consists of the connectivity coded first frame, indices of the clusters of vertices, weights corresponding to each cluster of a vertex, the approximation sub-band of prediction error and the affine transformations corresponding to the approximation frames. The enhancement layers consist of the detailed sub-bands of prediction error and the affine transformations corresponding to the detailed frames. The scalable encoder and decoder are tested on some standard animation sequences and the experimental results show good performance in terms of scalable rates and distortions.\",\"PeriodicalId\":436402,\"journal\":{\"name\":\"2013 Fourth National Conference on Computer Vision, Pattern Recognition, Image Processing and Graphics (NCVPRIPG)\",\"volume\":\"321 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Fourth National Conference on Computer Vision, Pattern Recognition, Image Processing and Graphics (NCVPRIPG)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCVPRIPG.2013.6776263\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Fourth National Conference on Computer Vision, Pattern Recognition, Image Processing and Graphics (NCVPRIPG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCVPRIPG.2013.6776263","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

动画几何压缩包括对代表动画帧的动态三维(3D)三角形网格的几何数据进行压缩。几何压缩的可伸缩性问题解决了在单一尺度下压缩几何和在多个尺度下解压缩几何的问题。其中一种动画几何压缩算法采用基于蒙皮的顶点运动预测和时域小波变换(TWT)对预测误差进行处理。本文提出了一种编码器和解码器结构,用于实现该算法的临时可伸缩实现。利用行波管将一组仿射变换顶点的运动聚类引起的逐帧预测误差转换为帧的分层结构。对各点的仿射变换数据、各点簇对应的权值以及预测误差的小波系数进行量化和熵编码。所得到的比特流以分层结构排列,以实现时间可伸缩性。基础层由第一帧的连通性编码、顶点簇的指标、每个顶点簇对应的权值、预测误差的近似子带和近似帧对应的仿射变换组成。增强层由预测误差的详细子带和具体帧对应的仿射变换组成。在一些标准动画序列上对可伸缩编码器和解码器进行了测试,实验结果表明在可伸缩率和失真方面都有良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Temporally scalable compression of animation geometry
Animation geometry compression involves compressing the geometry data of dynamic three-dimensional (3D) triangular meshes representing the animation frames. The scalability issue of geometry compression addresses compressing the geometry in a single scale and decompressing it in multiple scales. One of the algorithms for animation geometry compression employs the skinning based motion prediction of vertices and the temporal wavelet transform (TWT) on the prediction errors. This paper presents an encoder and a decoder structure for achieving temporally scalable implementation of the algorithm. The frame-wise prediction errors due to motion based clustering of a group of affine transformed vertices are converted into a layered structure of the frames using the TWT. The affine transformation data of vertices, weights corresponding to each cluster of vertices and the wavelet coefficients of the prediction errors are quantized and encoded using the entropy coding. The resulting bit-stream is arranged in a layered structure to achieve temporal scalability. The base layer consists of the connectivity coded first frame, indices of the clusters of vertices, weights corresponding to each cluster of a vertex, the approximation sub-band of prediction error and the affine transformations corresponding to the approximation frames. The enhancement layers consist of the detailed sub-bands of prediction error and the affine transformations corresponding to the detailed frames. The scalable encoder and decoder are tested on some standard animation sequences and the experimental results show good performance in terms of scalable rates and distortions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信