3D Mesh Segmentation Based on Markov Random Fields and Graph Cuts

被引:0
作者
Shi, Zhenfeng [1 ,2 ]
Le, Dan [1 ]
Yu, Liyang [1 ]
Niu, Xiamu [1 ]
机构
[1] Harbin Inst Technol, Sch Comp Sci & Technol, Harbin 150006, Peoples R China
[2] Harbin Inst Technol, Dept Math, Harbin 150006, Peoples R China
基金
中国国家自然科学基金;
关键词
mesh segmentation; markov random field; graph cuts; SDF;
D O I
10.1587/transinf.E95.D.703
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
3D Mesh segmentation has become an important research field in computer graphics during the past few decades. Many, geometry based and semantic oriented approaches for 3D mesh segmentation has been presented. However, only a few algorithms based on Markov Random Field (MRF) has been presented for 3D object segmentation. In this letter, we present a definition of mesh segmentation according to the labeling problem. Inspired by the capability of MRF combining the geometric information and the topology information of a 3D mesh, we propose a novel 3D mesh segmentation model based on MRF and Graph Cuts. Experimental results show that our MRF-based schema achieves an effective segmentation.
引用
收藏
页码:703 / 706
页数:4
相关论文
共 15 条
[1]  
Andersen V., 2007, THESIS IT U COPENHAG
[2]   Hierarchical mesh segmentation based on fitting primitives [J].
Attene, M ;
Falcidieno, B ;
Spagnuolo, M .
VISUAL COMPUTER, 2006, 22 (03) :181-193
[3]  
Attene M., 2008, P IEEE C SHAP MOD AP, P7
[4]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[5]   An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision [J].
Boykov, Y ;
Kolmogorov, V .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (09) :1124-1137
[6]  
Hammersley JM, 1968, MARKOV FIELDS UNPUB
[7]   Mesh segmentation using feature point and core extraction [J].
Katz, S ;
Leifman, G ;
Tal, A .
VISUAL COMPUTER, 2005, 21 (8-10) :649-658
[8]   What energy functions can be minimized via graph cuts? [J].
Kolmogorov, V ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (02) :147-159
[9]  
Lavoue Guillaume., 2008, 3DOR@ Eurographics, P25
[10]  
Li Stan Z., 2001, COMP SCI W, P165