Please wait a minute...
浙江大学学报(工学版)
J4  2011, Vol. 45 Issue (6): 999-1005    DOI: 10.3785/j.issn.1008-973X.2011.06.006
自动化技术、计算机技术     
基于张量投票的快速网格分割算法
舒振宇1,2, 汪国昭1
1. 浙江大学 数学系图像图形研究所,浙江 杭州 310027；2. 浙江大学宁波理工学院
信息处理与优化设计研究所,浙江 宁波 315100
Fast mesh segmentation algorithm based on tensor voting
SHU Zhen-yu1,2, WANG Guo-zhao1
1. Institute of Computer Graphics and Image Processing, Department of Mathematics, Zhejiang University,
Hangzhou 310027, China; 2. Laboratory of Information and Optimization Technologies, Ningbo Institute of
Technology, Zhejiang University, Ningbo 315100, China
 全文: PDF  HTML
摘要：

为了根据网格模型上的尖锐几何特征对三角网格曲面进行合理分片,提出一种新的基于张量投票（tensor voting）理论的三角网格分割算法.该算法将输入网格模型上所有的三角面片聚类成由用户指定数目的若干个区域,使得区域内部三角面片上点的尖锐几何特征尽可能接近.根据网格模型顶点上基于法向的张量投票矩阵的特征值分布与顶点尖锐几何特征的对应关系,算法将网格分割转化为能量最小化问题,并适当简化能量函数的形式,用快速聚类算法求解.通过引入启发式约束,算法较好地防止了分割区域的分离.实验表明：与已有算法相比,该算法具有较快的速度,同时能够较好地分割网格曲面上的尖锐几何特征区域.
Abstract:

A novel algorithm for triangular mesh segmentation based on tensor voting theory was proposed to correctly segment the input triangular mesh according to the sharp geometrical features on the mesh. All triangles of the input mesh clustered to a user-specified number of regions such that the sharp geometrical features of vertices belonging to the same region were as similar as possible. With the correspondence between the sharp geometrical features and the distribution of normal tensor voting matrix’s eigen values, the mesh segmentation was converted to an energy minimization problem. Then a fast clustering method was applied to solve the problem with simplified energy terms. By introducing a heuristic constraint, no segment was separated into disconnected parts with the algorithm. Experimental results show that the algorithm is faster and the regions with sharp geometrical features are segmented better compared with some existing algorithms.
出版日期: 2011-07-14
:  TP 391.4  
基金资助:

国家自然科学基金资助项目(60773179,60970079)；国家自然科学基金资助项目(60933008)；宁波市自然科学基金资助项目(2009A610071).
通讯作者: 汪国昭,男,教授,博导.     E-mail: wanggz@zju.edu.cn
作者简介: 舒振宇(1979—),男,博士生,从事计算机图形学、数字几何处理的研究. E-mail: shuzhenyu@163.com
服务　　
把本文推荐给朋友
加入引用管理器
E-mail Alert
作者相关文章　　

引用本文:

舒振宇, 汪国昭. 基于张量投票的快速网格分割算法[J]. J4, 2011, 45(6): 999-1005.

SHU Zhen-yu, WANG Guo-zhao. Fast mesh segmentation algorithm based on tensor voting. J4, 2011, 45(6): 999-1005.

链接本文:

https://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2011.06.006    或    https://www.zjujournals.com/eng/CN/Y2011/V45/I6/999

［1］ SHU Z, WANG G, DONG C. Adaptive triangular mesh coarsening with centroidal Voronoi tessellations［J］. Journal of Zhejiang UniversityScience A, 2009, 10(4): 535-545.
［2］ COHENSTEINER D, ALLIEZ P, DESBRUN M. Variational shape approximation［C］∥ ACM SIGGRAPH 2004 Papers. Los Angeles: ACM, 2004: 905-914.
［3］ GELFAND N, GUIBAS L J. Shape segmentation using local slippage analysis［C］∥ Proceedings of the 2004 Eurographics/ACM SIGGRAPH Symposium on Geometry Processing. Nice, France: ACM, 2004: 214-223.
［4］ RENIERS D, TELEA A. Hierarchical parttype segmentation using voxelbased curve skeletons［J］. The Visual Computer, 2008, 24(6): 383-395.
［5］ LAI Y K, HU S M, MARTIN R R, et al. Fast mesh segmentation using random walks［C］∥ Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling. New York: ACM, 2008: 183-191.
［6］ MORTARA M, PATAN G, SPAGNUOLO M. From geometric to semantic human body models［J］. Computers & Graphics, 2006, 30(2): 185-196.
［7］ VARADY T, MARTIN R R, COX J. Reverse engineering of geometric models--an introduction［J］. ComputerAided Design, 1997, 29(4): 255-268.
［8］ SHAH J J, ANDERSON D, KIM Y S, et al. A discourse on geometric feature recognition from CAD models［J］. Journal of Computing and Information Science in Engineering, 2001, 1(1): 41-51.
［9］ IP C Y, REGLI W C. Manufacturing classification of CAD models using curvature and SVMs［C］∥ Proceedings of the International Conference on Shape Modeling and Applications 2005. Cambridge: IEEE Computer Society, 2005: 363-367.
［10］ SANDER P V, SNYDER J, GORTLER S J, et al. Texture mapping progressive meshes［C］∥ Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques. New York: ACM, 2001: 409-416.
［11］ SORKINE O, COHENOR D, GOLDENTHAL R, et al. Boundeddistortion piecewise mesh parameterization［C］∥ Proceedings of the Conference on Visualization ’02. Boston: IEEE Computer Society, 2002: 355-362.
［12］ ZHANG E, MISCHAIKOW K, TURK G. Featurebased surface parameterization and texture mapping［J］. ACM Transactions on Graphics, 2005, 24(1): 1-27.
［13］ SANDER P V, WOOD Z J, GORTLER S J, et al. Multichart geometry images［C］∥ Proceedings of the 2003 Eurographics/ACM SIGGRAPH Symposium on Geometry processing. Aachen: Eurographics Association, 2003: 146-155.
［14］ KALVIN A D, TAYLOR R H. Superfaces: Polygonal Mesh Simplification with Bounded Error［J］. IEEE Computer Graphics and Applications, 1996, 16(3): 64-77.
［15］ GARLAND M, WILLMOTT A, HECKBERT P S. Hierarchical face clustering on polygonal surfaces［C］∥ Proceedings of the 2001 Symposium on Interactive 3D graphics. New York: ACM, 2001: 49-58.
［16］ SHEFFER A. Model simplification for meshing using face clustering［J］. ComputerAided Design, 2001, 33(13): 925-934.
［17］ ZUCKERBERGER E, TAL A, SHLAFMAN S. Polyhedral surface decomposition with applications［J］. Computers & Graphics, 2002, 26(5): 733-743.
［18］ BOIERMARTIN I M. Domain decomposition for multiresolution analysis［C］∥ Proceedings of the 2003 Eurographics/ACM SIGGRAPH Symposium on Geometry processing. Aachen: Eurographics Association, 2003: 31-40.
［19］ INOUE K, ITOH T, YAMADA A, et al. Face clustering of a largescale CAD model for surface mesh generation［J］. ComputerAided Design, 2001, 33(3): 251-261.
［20］ PETITJEAN S. A survey of methods for recovering quadrics in triangle meshes［J］. ACM Computing Surveys, 2002, 34(2): 211-262.
［21］ LAVOU G, DUPONT F, BASKURT A. A new CAD mesh segmentation method, based on curvature tensor analysis［J］. ComputerAided Design, 2005, 37(10): 975-987.
［22］ WU Jianhua, LEIF K. Structure recovery via hybrid variational surface approximation［J］. Computer Graphics Forum, 2005, 24(3): 277-284.
［23］ ATTENE M, FALCIDIENO B, SPAGNUOLO M. Hierarchical mesh segmentation based on fitting primitives［J］. The Visual Computer, 2006, 22(3): 181-193.<
[1] 徐嵩,孙秀霞,何衍. 利用直线段成像特性的摄像机畸变迭代标定方法[J]. J4, 2014, 48(3): 404-413.
[2] 谢天, 解利军, 宋广华, 郑耀. 基于平面颜色分布的增强现实自然特征注册算法[J]. J4, 2013, 47(12): 2243-2252.
[3] 杨帮华, 何美燕, 刘丽, 陆文宇. 脑机接口中基于BISVM的EEG分类[J]. J4, 2013, 47(8): 1431-1436.
[4] 杨冰, 许端清, 杨鑫, 赵磊, 唐大伟. 基于艺术风格相似性规则的绘画图像分类[J]. J4, 2013, 47(8): 1486-1492.
[5] 楼晓俊, 孙雨轩, 刘海涛. 聚类边界过采样不平衡数据分类方法[J]. J4, 2013, 47(6): 944-950.
[6] 孟子博, 姜虹, 陈婧, 袁波, 王立强. 基于特征剪裁的AdaBoost算法及在人脸检测中的应用[J]. J4, 2013, 47(5): 906-911.
[7] 何智翔, 丁晓青, 方驰, 文迪. 基于LBP和CCS-AdaBoost的多视角人脸检测[J]. J4, 2013, 47(4): 622-629.
[8] 刘晓芳,叶修梓,张三元,张引. 并行磁共振图像的非二次正则化保边性重建[J]. J4, 2012, 46(11): 2035-2043.
[9] 张远辉,韦巍. 在线角速度估计的乒乓球机器人视觉测量方法[J]. J4, 2012, 46(7): 1320-1326.
[10] 施锦河, 沈继忠, 王攀. 四类运动想象脑电信号特征提取与分类算法[J]. J4, 2012, 46(2): 338-344.
[11] 张大尉, 朱善安. 基于核邻域保持判别嵌入的人脸识别[J]. J4, 2011, 45(10): 1842-1847.
[12] 徐舒畅, 张三元, 张引. 基于彩色图像的皮肤色素浓度提取算法[J]. J4, 2011, 45(2): 253-258.
[13] 佘青山, 孟明, 罗志增, 马玉良. 基于多核学习的下肢肌电信号动作识别[J]. J4, 2010, 44(7): 1292-1297.
[14] 薛凌云, 段会龙, 向学勤, 范影乐. 基于FitzHughNaguno神经元随机共振机制的图像复原[J]. J4, 2010, 44(6): 1103-1107.
[15] 张远辉, 韦巍, 虞旦. 基于实时图像的乒乓机器人Kalman跟踪算法[J]. J4, 2009, 43(09): 1580-1584.