• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

¿µ¹® ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ¿µ¹® ³í¹®Áö > TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

Current Result Document : 1 / 2

ÇѱÛÁ¦¸ñ(Korean Title) 3D Mesh Model Exterior Salient Part Segmentation Using Prominent Feature Points and Marching Plane
¿µ¹®Á¦¸ñ(English Title) 3D Mesh Model Exterior Salient Part Segmentation Using Prominent Feature Points and Marching Plane
ÀúÀÚ(Author) Yiyu Hong   Jongweon Kim  
¿ø¹®¼ö·Ïó(Citation) VOL 13 NO. 03 PP. 1418 ~ 1433 (2019. 03)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
In computer graphics, 3D mesh segmentation is a challenging research field. This paper presents a 3D mesh model segmentation algorithm that focuses on removing exterior salient parts from the original 3D mesh model based on prominent feature points and marching plane. To begin with, the proposed approach uses multi-dimensional scaling to extract prominent feature points that reside on the tips of each exterior salient part of a given mesh. Subsequently, a set of planes intersect the 3D mesh; one is the marching plane, which start marching from prominent feature points. Through the marching process, local cross sections between marching plane and 3D mesh are extracted, subsequently, its corresponding area are calculated to represent local volumes of the 3D mesh model. As the boundary region of an exterior salient part generally lies on the location at which the local volume suddenly changes greatly, we can simply cut this location with the marching plane to separate this part from the mesh. We evaluated our algorithm on the Princeton Segmentation Benchmark, and the evaluation results show that our algorithm works well for some categories.
Å°¿öµå(Keyword) Marching plane   Mesh segmentation   Feature point extraction   Fast marching algorithm   Computer graphics  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå