Earticle

초록

영어

The discrete curvature is sensitive to the noise and heavy computation of feature value. In order to extract the segmentation lines of 3D meshes, this paper presents a novel and efficient algorithm which is based on regional discrete curvature. Extract prominent feature points, pre-segmentation and then obtain the constraint region. Calculate the curvature degree extremal points within the constraint region, finally utilize the curvature degree extremal points to fit plane which guaid extracting the segmentation lines. This algorithm does not need to wipe off the noise at initial stage, the experiment results show that the proposed algorithm can accurately and frequently yield meaningful segmentation lines for models which has an evident branch structure.

목차

Abstract
 1. Introduction
 2. Choose Prominent Feature Points
 3. Pre-segmentation
 4. Post-Segmentation based on Regional Discrete Curvature
  4.1. Calculate Discrete Curvature
  4.2. Get Segmentation Lines
  4.3. Contour Completion
 5. The Experiment Results Analysis
 6. Conclusion
 References

키워드

저자

• Hui Jia [ School of Computer Science & Technology, Xi’ an University of Posts and Telecommunications, Xi’ an 710121, China ]
• Jiangang Zhang [ Information and Supervision Department, Xi’an Thermal Power Research Institute Co Ltd, Xi’an 710032, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Signal Processing, Image Processing and Pattern Recognition

• 간기

  격월간

• pISSN

  2005-4254

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605