检索结果-南通市图书馆

A Deep Learning Approach to mesh segmentation

Computer Modeling in Engineering & Sciences 2023年第5期135卷 1745-1763页

作者： Abubakar Sulaiman Gezawa Qicong Wang Haruna Chiroma Yunqi Lei Department of Computer Science School of InformaticsXiamen UniversityXiamen361005China Shenzen Research Institute Xiamen UniversityShenzen518000China College of Computer Science and Engineering University of Hafr Al BatinHafr Albatin39524Saudi Arabia

In the shape analysis community,decomposing a 3D shape intomeaningful parts has become a topic of interest.3D model segmentation is largely used in tasks such as shape deformation,shape partial matching,skeleton extraction,shape correspondence,shape annotation and texture *** approaches have attempted to provide better segmentation solutions;however,the majority of the previous techniques used handcrafted features,which are usually focused on a particular attribute of 3Dobjects and so are difficult to *** this paper,we propose a three-stage approach for using Multi-view recurrent neural network to automatically segment a 3D shape into visually meaningful *** first stage involves normalizing and scaling a 3D model to fit within the unit sphere and rendering the object into different *** viewpoints,on the other hand,might not have been associated,and a 3D region could correlate into totally distinct outcomes depending on the *** address this,we ran each view through(shared weights)CNN and Bolster block in order to create a probability boundary *** Bolster block simulates the area relationships between different views,which helps to improve and refine the *** stage two,the feature maps generated in the previous step are correlated using a Recurrent Neural network to obtain compatible fine detail responses for each ***,a layer that is fully connected is used to return coherent edges,which are then back project to 3D objects to produce the final *** on the Princeton segmentation Benchmark dataset show that our proposed method is effective for mesh segmentation tasks.

关键词： Deep learning mesh segmentation 3D shape shape features

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A fast and efficient mesh segmentation method based on improved region growing

引用

Applied Mathematics(A Journal of Chinese Universities) 2014年第4期29卷 468-480页

作者： YANG Fei ZHOU Fan WANG Ruo-mei LIU Li LUO Xiao-nan School of Information Science and Technology Sun Yat-sen University National Engineering Research Center of Digital Life

mesh segmentation is one of the important issues in digital geometry processing. Region growing method has been proven to be a efficient method for 3D mesh segmentation. However, in mesh segmentation, feature line extraction algorithm is computationally costly, and the over-segmentation problem still exists during region merging processing. In order to tackle these problems, a fast and efficient mesh segmentation method based on improved region growing is proposed in this paper. Firstly, the dihedral angle of each non-boundary edge is defined and computed simply, then the sharp edges are detected and feature lines are extracted. After region growing process is finished, an improved region merging method will be performed in two steps by considering some geometric criteria. The experiment results show the feature line extraction algorithm can obtain the same geometric information fast with less computational costs and the improved region merging method can solve over-segmentation well.

关键词： mesh segmentation feature line region growing dihedral angle.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

User-controllable mesh segmentation using shape harmonic signature

引用

Progress in Natural Science:Materials International 2009年第4期19卷 471-478页

作者： Yongwei Miao a,b, Jieqing Fenga, Jinrong Wanga,c, Xiaogang Jin a a State Key Laboratory of CAD & CG, Zhejiang University, Hangzhou 310027, China b College of Science, Zhejiang University of Technology, Hangzhou 310032, China c Information Science & Engineering School, Hangzhou Normal University, Hangzhou 310036, China State Key Laboratory of CAD & CG Zhejiang University Hangzhou 310027 China College of Science Zhejiang University of Technology Hangzhou 310032 China Information Science & Engineering School Hangzhou Normal University Hangzhou 310036 China

Due to different shape modeling applications, partitioning a given complex 3D mesh model into some patches or meaningful subparts is one of the fundamental problems in digital geometry processing. By using the high-dimensional mean-shift clustering scheme in shape signature space, a new method is proposed which can generate user-specified segmentation results automatically for different applications. The shape signature is composed of mesh geometric attributes and its spectral harmonics. The latter one can reflect mesh frequency spectrum information. The low frequency components are essential for semantics-oriented segmentation, while the high frequency components are important for purely geometry-oriented segmentation. The effects of the proposed method are demonstrated by several examples.

关键词： mesh segmentation Manifold harmonic analysis Shape harmonic signature Mean-shift clustering

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Fast mesh segmentation by approximated spherical patches

Fast mesh segmentation by approximated spherical patches

引用

2009中国控制与决策会议

作者： Zhenyu Shu~(1,2),Guozhao Wang 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

＜正＞In this paper,we present a fast method for segmentation of triangular mesh surfaces into simple patches, where each patch is an approximation of a part of spherical *** a mesh surface,all triangles of it cluster to a user-specified number of patches by energy *** patches of result meshes are as spherical as possible with our *** results show that our algorithm is efficient and robust.

关键词： mesh segmentation Spherical surface Clustering

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Connectivity-Based segmentation for GPU-Accelerated mesh Decompression

引用

Journal of Computer Science & Technology 2012年第6期27卷 1110-1118页

作者：赵杰伊唐敏童若锋 College of Computer Science and Technology Zhejiang University

We present a novel algorithm to partition large 3D meshes for GPU-accelerated decompression. Our formulation focuses on minimizing the replicated vertices between patches, and balancing the numbers of faces of patches for emcient parallel computing. First we generate a topology model of the original mesh and remove vertex positions. Then we assign the centers of patches using geodesic farthest point sampling and cluster the faces according to the geodesic distance to the centers. After the segmentation we swap boundary faces to fix jagged boundaries and store the boundary vertices for whole-mesh preservation. The decompression of each patch runs on a thread of GPU, and we evaluate its performance on various large benchmarks. In practice, the GPU-based decompression algorithm runs more than 48x faster on NVIDIA GeForce GTX 580 GPU compared with that on the CPU using single core.

关键词： parallel decompression mesh segmentation connectivity compression GPU Edgebreaker

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A Spectral segmentation Method for Large meshes

引用

Communications in Mathematics and Statistics 2023年第3期11卷 583-607页

作者： Xiaohan Bao Weihua Tong Falai Chen School of Mathematical Sciences University of Science and Technology of ChinaHefei230026AnhuiPeople’s Republic of China

mesh segmentation is a fundamental and critical task in mesh processing,and it has been studied extensively in computer graphics and geometric modeling ***,current methods are not well suited for segmenting large meshes which are now common in many *** paper proposes a new spectral segmentation method specifically designed for large meshes inspired by multi-resolution *** on edge collapse operators and progressive mesh representations,we first devise a feature-aware simplification algorithm that can generate a coarse mesh which keeps the same topology as the input mesh and preserves as many features of the input mesh as ***,using the spectral segmentation method proposed in Tong et al.(IEEE Trans Vis Comput Graph 26(4):1807–1820,2020),we perform partition on the coarse mesh to obtain a coarse segmentation which mimics closely the desired segmentation of the input *** reversing the simplification process through vertex split operators,we present a fast algorithm which maps the coarse segmentation to the input mesh and therefore obtain an initial segmentation of the input ***,to smooth some jaggy boundaries between adjacent parts of the initial segmentation or align with the desired boundaries,we propose an efficient method to evolve those boundaries driven by geodesic curvature *** demonstrated by experimental results on a variety of large meshes,our method outperforms the state-of-the-art segmentation method in terms of not only speed but also usability.

关键词： mesh segmentation Spectral method Progressive mesh Feature-aware simplification Geodesic curvature flow

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Cluster parallel rendering based on encoded mesh

引用

Journal of Zhejiang University-Science A(Applied Physics & Engineering) 2006年第7期7卷 1124-1133页

作者： QIN Ai-hong XIONG Hua PENG Hao-yu LIU Zhen SHI Jiao-ying State Key Lab of CAD ＆ CG Zhejiang University Hangzhou 310027 China School of Computer and lnformation Technology Shanxi University Taiyuan 030006 China

Use of compressed mesh in parallel rendering architecture is still an unexplored area, the main challenge of which is to partition and sort the encoded mesh in compression-domain. This paper presents a mesh compression scheme PRMC (Parallel Rendering based mesh Compression) supplying encoded meshes that can be partitioned and sorted in parallel rendering system even in encoded-domain. First, we segment the mesh into submeshes and clip the submeshes’ boundary into Runs, and then piecewise compress the submeshes and Runs respectively. With the help of several auxiliary index tables, compressed submeshes and Runs can serve as rendering primitives in parallel rendering system. Based on PRMC, we design and implement a parallel rendering architecture. Compared with uncompressed representation, experimental results showed that PRMC meshes applied in cluster parallel rendering system can dramatically reduce the communication requirement.

关键词： Cluster Parallel rendering Rendering Compression algorithm mesh coding mesh segmentation

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Feature-aligned segmentation using correlation clustering

引用

Computational Visual Media 2017年第2期3卷 147-160页

作者： Yixin Zhuang Hang Dou Nathan Carr Tao Ju National Digital Switching System Engineering & Technological Research Center Washington University in St. Louis Adobe

We present an algorithm for segmenting a mesh into patches whose boundaries are aligned with prominent ridge and valley lines of the shape. Our key insight is that this problem can be formulated as correlation clustering(CC), a graph partitioning problem originating from the data mining *** formulation lends two unique advantages to our method over existing segmentation methods. First,since CC is non-parametric, our method has few parameters to tune. Second, as CC is governed by edge weights in the graph, our method offers users direct and local control over the segmentation result. Our technical contributions include the construction of the weighted graph on which CC is defined, a strategy for rapidly computing CC on this graph, and an interactive tool for editing the segmentation. Our experiments show that our method produces qualitatively better segmentations than existing methods on a wide range of inputs.

关键词： mesh segmentation correlation clustering(CC) feature lines

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A framework from point clouds to workpieces

引用

Visual Computing for Industry,Biomedicine,and Art 2022年第1期5卷 250-267页

作者： Li‑Yong Shen Meng‑Xing Wang Hong‑Yu Ma Yi‑Fei Feng Chun‑Ming Yuan School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049China KLMM Academy of Mathematics and Systems SciencesUniversity of Chinese Academy of SciencesBeijing 100049China

Combining computer-aided design and computer numerical control(CNC)with global technical connections have become interesting topics in the manufacturing industry.A framework was implemented that includes point clouds to workpieces and consists of a mesh generation from geometric data,optimal surface segmentation for CNC,and tool path planning with a certified scallop *** latest methods were introduced into the mesh generation with implicit geometric regularization and total generalized *** the mesh model was obtained,a fast and robust optimal surface segmentation method is provided by establishing a weighted graph and searching for the minimum spanning tree of the graph for extraordinary *** method is easy to implement,and the number of segmented patches can be controlled while preserving the sharp features of the ***,a contour parallel tool-path with a confined scallop height is generated on each patch based on B-spline *** results show that the proposed framework is effective and robust.

关键词： Computer numerical control mesh reconstruction mesh segmentation Path planning Scallop height

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：