完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHo, Tan-Chien_US
dc.contributor.authorChuang, Jung-Hongen_US
dc.date.accessioned2014-12-08T15:23:55Z-
dc.date.available2014-12-08T15:23:55Z-
dc.date.issued2012-07-01en_US
dc.identifier.issn1016-2364en_US
dc.identifier.urihttp://hdl.handle.net/11536/16644-
dc.description.abstract"Mesh segmentation has become a key ingredient in many mesh applications in computer graphics. In this paper, we propose a hierarchical segmentation that decomposes a polygonal object into meaningful parts in such a way that not only components on a higher level reveal higher degree of salience than their descendant parts but also the components on each level of hierarchy have similar degree of salience. Moreover, the number of boundaries on each level of the hierarchy is determined automatically. The proposed segmentation is based on the Minimum Slice Perimeter (MSP) function [1], which represents non-local shape features and has better interpretation for the object parts. The gradient of MSP function is used to locate the segmentation regions and a new measure of part salience is proposed to evaluate the significance of the segmentation regions. For each level of hierarchy, some most perceptually significant segmentation regions are selected based on their salience measures and boundaries are then computed from the selected segmentation regions by using a capacity that considers both the curvature and MSP gradient."en_US
dc.language.isoen_USen_US
dc.subjectshape analysisen_US
dc.subjectmesh segmentationen_US
dc.subjectminimum slice perimeteren_US
dc.subjectcomputer graphicsen_US
dc.subjectgeometric modelingen_US
dc.titleVolume Based Mesh Segmentationen_US
dc.typeArticleen_US
dc.identifier.journalJOURNAL OF INFORMATION SCIENCE AND ENGINEERINGen_US
dc.citation.volume28en_US
dc.citation.issue4en_US
dc.citation.epage705en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000306677000005-
dc.citation.woscount2-
顯示於類別:期刊論文


文件中的檔案:

  1. 000306677000005.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。