期刊文献+

基于Bayes-MeTiS网格划分的3D几何重构

3D Geometric Reconstruction Based on Bayes-MeTiS Mesh Partition
下载PDF
导出
摘要 为提升3D模型几何重构过程的压缩效率,提出一种基于MeTiS网格划分的贝叶斯3D模型几何重构算法。首先,在编码端采用MeTiS方法对原始3D网格进行子网划分,采用随机线性矩阵对子网几何形状进行编码,并对边界节点的邻居节点使用伪随机数生成器进行数据序列构建;然后,利用贝叶斯算法进行几何模型重构算法的设计,在理论上给出了均值、方差矩阵以及模型参数学习规则,实现了3D模型的几何重构;最后,将其与图傅里叶光谱压缩(GFT)、最小二乘压缩(LMS)和基于压缩感知的图傅里叶光谱压缩(CSGFT)等算法进行仿真对比。结果表明,所提方法具有较高的比特率压缩指标以及较低的重构误差,计算效率明显提高。 In order to improve the compression efficiency of the geometric reconstruction process of 3 D model,this paper proposed a bayesian geometric reconstruction algorithm based on MeTiS mesh partition for 3 D model.At the encoding part,the MeTiS method is used to realize the subnetting for original 3 Dgrid,the random linear matrix is used to encode the geometry of the subnet,and the pseudo random number generator is used for data sequence construction by considering the neighbor nodes of the boundary nodes.Then,the Bayesian algorithm is used to design the geometric model reconstruction algorithm,and the mean,variance matrix and the model parameters are given in theory to realize the geometric reconstruction of the 3 Dmodel.Finally,by comparing with graph Fourier transform spectral compression(GFT),least square compression(LMS)and compressed sensing based graph Fourier transform spectral compression algorithms(CSGFT),the simulation results show that the proposed method has relatively high bit rate compression index and low reconstruction error.
作者 张小华 黄波 ZHANG Xiao-hua;HUANG Bo;College of Computer Science;Sichuan University;
出处 《计算机科学》 CSCD 北大核心 2018年第6期265-269,295,共6页 Computer Science
基金 四川省教育厅科研项目(17ZB0007)资助
关键词 3D模型 几何重构 MeTiS网格划分 贝叶斯 邻居节点 3D model Geometric reconstruction MeTiS mesh partition Bias Neighbor node
  • 相关文献

参考文献5

二级参考文献129

  • 1W Wei, K C Chua. Trade-offs between mobility and density for coverage in wireless sensor networks [ A]. Proc MobiCom '07 [C]. New York:ACM,2007. 39-50.
  • 2F S Xing,C Jiming. Grid scan:a simple and effective approach for coverage issue in wireless sensor networks [ A]. Proc ICC '06 [C]. New York:IF.F.F.,2006. 3480-3484.
  • 3K Nilin, G Dimilrios. Sensor network coverage restoration [ J]. CITESEER, 2008,10( 12): 21 - 24.
  • 4X Y Li, H David. Distributed coordinate-free hole recovery [ A ]. Proc IF, F,F, GlobeCom ' 06 [ C ]. New York: IF, F,F,, 2006. 189- 194.
  • 5G Amitabha. Estimating coverage Local Computer Networks, age in mixed sensor networks E J]. holes and enhancing cover- 2009,29(2) :68 - 76.
  • 6S Anthony, Y Y Ye. On solving coverage problems in a wire- less sensor network using voronoi diagrams [ J]. LNCS, 2005, 3828: 584 - 593.
  • 7W Jiong, M Sirisha. Energy-efficient k-coverage for wireless sensor networks with variable sensing radii [ A ]. Proc IF, F,E GLOBECOM [ C]. Honolulu:lF.F,F,,2009. 1 - 6.
  • 8Y Bejeranp. Simple and efficient k-coverage verification with- out locatioan information [ A]. Proc the IEEE Conference on- Computer Communications [ C]. New York: IF, F,F,,2008. 291 - 295.
  • 9K Prasan,Z T Jang. Vector method based coverage hole re- covery in wireless sensor [ A]. Proc the Communication Sys- tems and Networks [ C]. New York: IE, EE,2010. 1- 9.
  • 10G Wang, G Cao. Movement-assisw.d sensor deployment [A ]. Proc Conference on Computer Communicafiom [ C ]. New York: IEEE,2005. 584 - 593.

共引文献27

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部