期刊文献+

基于Voronoi极点特征值显著度加权的网格简化算法 被引量:6

Mesh Simplification Weighted by Voronoi Poles Feature Computed Saliency
下载PDF
导出
摘要 针对目前网格简化仅依赖局部特征而造成对尖锐特征保持差的问题,提出一种新的基于视觉显著度加权的简化算法。算法首先通过Voronoi内外极点与采样点之间的关系来计算离散曲面局部极点特征值,然后叠加不同尺度下局部特征值的高斯差分获得特征的视觉显著度。在进行网格简化时,将该显著度作为权重赋值给每个点的二次误差矩阵,从而达到对显著度较高区域特征保持的目的。实验结果表明,所提出的简化算法与传统基于局部曲率的算法相比能够更有效地保持原始网格固有几何特性,特别是对于视觉较为敏感的尖锐特征。 In this paper,we represent a novel method for mesh simplification.Compared with conventional methods that are based only on local features,our method exerts visual saliency feature as the weight to sample points during simplification,hence has better performance on persevering visual features.Firstly,the method computes the local feature values by the relationship between Voronoi-poles and the sample points.Then the global visual saliency features are computed by overlaying the Difference of Gaussian of local feature values get under different scales.Finally,the computed global visual saliency features are used as the weight to the quadric error metrics,in order to hold the positions where have of higher global visual saliency during iteration of the mesh simplification.The simplified results show that our algorithm not only gets better visual feature preservation but also smaller qualified errors comparing to state of the art methods.
作者 魏宁 徐婷婷 高开源 董方敏 WEI Ning;XU Tingting;GAO Kaiyuan;DONG Fangmin(Hubei Key Laboratory of Intelligent Vision Based Monitoring for Hydroelectric Engineering, China Three Gorges University,Yichang Hubei 443002, China)
出处 《图学学报》 CSCD 北大核心 2017年第3期314-319,共6页 Journal of Graphics
基金 国家重点研发计划项目(2016YFC0802503) 国家自然科学基金项目(61272237 61272236)
关键词 Voronoi极点 显著度估计 网格简化 Voronoi poles saliency detection mesh simplification
  • 相关文献

参考文献1

二级参考文献7

  • 1潘志庚,庞明勇.几何网格简化研究与进展[J].江苏大学学报(自然科学版),2005,26(1):67-71. 被引量:14
  • 2Hoppe H.Progressive meshes[C]//Computer Graphics Proceedings,Annual Conference Series,ACM SIGGRAPH.New York:ACM Press,1996:99-108. 被引量:1
  • 3Garland M,Heckbert P S.Surface simplification using quadric error metrics[C]//Proc.of the Computer Graphics,1997,31:209-216. 被引量:1
  • 4Cover T M,THOMAS J A.信息论基础[M].北京:清华大学出版社,2003,11. 被引量:1
  • 5Cignoni P,Rocchini C,Scopigno R.Metro:Measuring error on simplified surfaces[J].Computer Graphics Forum,1998,17(2):167-174. 被引量:1
  • 6Meyer M,Desbrun M,Schrrǒder P,et al.Discrete differential-geometry operators for triangulated 2-manifolds[C]//Proceedings of the 3rd International Workshop on Visualization and Mathematics.Berlin:Springer,2003:35-57. 被引量:1
  • 7陈伟海,徐鲤鸿,刘敬猛,王建华.网格简化中基于特征矩阵的二次误差测度算法[J].北京航空航天大学学报,2009,35(5):572-575. 被引量:12

共引文献4

同被引文献49

引证文献6

二级引证文献43

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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