首页> 外文会议>International Conference on Computational Science - ICCA 2003 Pt.1 Jun 2-4, 2003 Melbourne, Australia and St. Petersburg, Russia >Probability Distribution of Index Distances in Normal Index Array for Normal Vector Compression
【24h】

Probability Distribution of Index Distances in Normal Index Array for Normal Vector Compression

机译:法向矢量压缩的法向索引阵列中索引距离的概率分布

获取原文
获取原文并翻译 | 示例

摘要

Shape models are in these days frequently transmitted over Internet and the research of their compression has been started. Considering the large portion of shape model can be normal vectors, a new scheme was recently presented to compress normal vectors using clustering and mixed indexing scheme. Presented in this paper is a mathematical investigation of the scheme to analyze the probability distribution of normal index distances in Normal Index array which is critical for the compression. The probability distribution is formulated so that the values can be easily calculated once the relative probabilities of C, R, E, S, and L op-codes in Edgebreaker are known. It can be shown that the distribution of index distances can be easily transformed into a few measures for the compression performance of the proposed algorithm.
机译:如今,形状模型经常通过Internet传输,并且已经开始对其压缩进行研究。考虑到形状模型的大部分可以是法向矢量,最近提出了一种新的方案,即使用聚类和混合索引方案来压缩法向矢量。本文提出了一种对该方案进行数学分析的方法,以分析对压缩至关重要的正态索引数组中正态索引距离的概率分布。公式化了概率分布,以便一旦知道Edgebreaker中C,R,E,S和L操作码的相对概率,就可以轻松计算值。可以看出,索引距离的分布可以很容易地转化为所提出算法的压缩性能的几种度量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号