检索结果-内蒙古大学图书馆

mesh segmentation by combining mesh saliency with spectral clustering

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2018年 329卷 134-146页

作者： Jiao, Xue Wu, Tieru Qin, Xuzhou Jilin Univ Inst Math Changchun Jilin Peoples R China

In this paper, we present a new mesh segmentation method that achieves visually meaningful segmentation by combining mesh saliency with spectral clustering. Our method solves the segmentation problem by embedding the original mesh model into spectral space. Firstly, the mesh concave regions are determined according to the minimum rule in visual theory, and then a Laplacian matrix is defined by considering the mesh saliency and curvature information. Next, we calculate the first k eigenvectors of the Laplacian matrix by eigen-decomposition process, and embed the original mesh into a k-dimensional spectral space. Finally, we can achieve the visually meaningful segmentation by utilizing the Gaussian Mixture method, and the initial cluster centers are decided by mesh saliency. The experimental results have demonstrated the effectiveness of the proposed segmentation method. Especially for the model with convex regions and branch components, our method can achieve better visual quality. (C) 2017 Elsevier B.V. All rights reserved.

关键词： mesh segmentation Spectral embedding mesh saliency Clustering

来源：评论

学校读者我要写书评

暂无评论

mesh segmentation schemes for error resilient coding of 3-D graphic models

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2005年第1期15卷 138-144页

作者： Yan, ZD Kumar, S Kuo, CCJ J2 Global Commun Hollywood CA 90028 USA Clarkson Univ Dept Elect & Comp Engn Potsdam NY 13699 USA Univ So Calif Integrated Media Syst Ctr Los Angeles CA 90089 USA Univ So Calif Dept Elect Engn Los Angeles CA 90089 USA

Most existing coding techniques for three-dimensional (3-D) graphic models focus on coding efficiency. Due to irregular structure of the 3-D mesh and the use of variable length entropy codes, channel errors often propagate in the coded bit-stream and severely distort the decoded model. By segmenting a 3-D graphic model (or its connected components) into small pieces, the impact of channel errors is confined to directly corrupted pieces rather than the whole mesh. The mesh segmentation schemes should be compatible with the underlying encoding techniques to achieve the low computational and coding overhead. In this research, we examine four mesh segmentation schemes, i.e., multiseed traversal, threshold traversal, morphing-based volume splitting, and content-based segmentation, and apply them to the context of error resilient mesh coding based on the constructive traversal coding technique. The advantages and shortcomings of each segmentation method are discussed. These schemes segment a mesh into pieces according to the target piece size that is determined-according to the channel error rate.

关键词： constructive traversal error resiliency mesh partitioning mesh segmentation 3-D graphic model 3-D mesh

来源：评论

学校读者我要写书评

暂无评论

mesh segmentation based on curvatures using the GPU

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2015年第10期74卷 3401-3412页

作者： Lee, Jung Kim, Seokhun Kim, Sun-Jeong Korea Univ Dept Informat & Commun Seoul 136701 South Korea Suwon Womens Univ Dept Mobile Media Suwon 441748 Gyeonggi Do South Korea Hallym Univ Dept Ubiquitous Comp Chuncheon Si 200702 Gangwon Do South Korea

This paper proposes an efficient algorithm for decomposition of a 3D arbitrary triangular mesh into surface patches. Our method is based on the discrete curvatures for an accurate partitioning criterion and presents a fast clustering scheme of vertices using quick shift algorithm. It was implemented on the GPU (Graphics Processing Unit) because it is common for object geometry to exist in graphic memory so that more computational work is done directly on the graphic device. The proposed method results in fast estimation of curvatures and high quality of mesh segmentation. Also we applied it to NPR drawing of 3D meshes.

关键词： mesh segmentation Discrete curvatures Quick shift GP-GPU programming CUDA

来源：评论

学校读者我要写书评

暂无评论

mesh segmentation driven by Gaussian curvature

引用

VISUAL COMPUTER 2005年第8-10期21卷 659-668页

作者： Yamauchi, H Gumhold, S Zayer, R Seidel, HP MPI Informat Saarbrucken Germany

mesh parameterization is a fundamental problem in computer graphics as it allows for texture mapping and facilitates many mesh processing tasks. Although there exists a variety of good parameterization methods for meshes that are topologically equivalent to a disk, the segmentation into nicely parameterizable charts of higher genus meshes has been studied less. In this paper we propose a new segmentation method for the generation of charts that can be flattened efficiently. The integrated Gaussian curvature is used to measure the developability of a chart, and a robust and simple scheme is proposed to integrate the Gaussian curvature. The segmentation approach evenly distributes Gaussian curvature over the charts and automatically ensures a disklike topology of each chart. For numerical stability, we use an area on the Gauss map to represent Gaussian curvature. The resulting parameterization shows that charts generated in this way have less distortion compared to charts generated by other methods.

关键词： mesh segmentation Gauss map Gaussian curvature parameterization developability

来源：评论

学校读者我要写书评

暂无评论

mesh segmentation using feature point and core extraction

引用

VISUAL COMPUTER 2005年第8-10期21卷 649-658页

作者： Katz, S Leifman, G Tal, A Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

mesh segmentation has become a necessary ingredient in many applications in computer graphics. This paper proposes a novel hierarchical mesh segmentation algorithm, which is based on new methods for prominent feature point and core extraction. The algorithm has several benefits. First, it is invariant both to the pose of the model and to different proportions between the model's components. Second, it produces correct hierarchical segmentations of meshes, both in the coarse levels of the hierarchy and in the fine levels, where tiny segments are extracted. Finally, the boundaries between the segments go along the natural seams of the models.

关键词： mesh segmentation mesh decomposition feature point extraction

来源：评论

学校读者我要写书评

暂无评论

mesh segmentation WITH CONNECTING PARTS FOR 3D OBJECT PROTOTYPING

MESH SEGMENTATION WITH CONNECTING PARTS FOR 3D OBJECT PROTOT...

引用

IEEE International Conference on Image Processing (ICIP)

作者： Apaza-Agueero, Karl Silva, Luciano Bellon, Olga R. P. Univ Fed Parana IMAGO Res Grp BR-80060000 Curitiba Parana Brazil

ISBN: (纸本)9781479983391

Using 3D printers for manufacturing objects has become an easy, low cost process in a variety of emerging applications, such as assistive technologies. To this end, it may be necessary to split the object in smaller parts, providing that they precisely connect. This work presents a framework to build objects with connecting parts, which is divided in main three steps: 3D reconstruction;mesh segmentation;and 3D printing. The framework includes a new method for 3D model segmentation, which allows the generation of connecting parts from cutting planes. The segmentation process uses a binary space partitioning tree to represent cut regions of the mesh obtained from the scanned object. To close these cut regions and, at the same time, to consider constraints defined by the added connectors, it is used a Constrained Delaunay Triangulation. Thus, it is guaranteed a set of closed meshes for 3D printing. Experimental results show the application of this framework in two different areas: assistive technologies, by creating anatomically adjustable orthoses;and cultural heritage, where parts of scanned sculptures can be printed for preservation and restoration activities.

关键词： 3D scanning 3D reconstruction mesh segmentation 3D printing

来源：评论

学校读者我要写书评

暂无评论

mesh segmentation and Texture Mapping for Dimensional Inspection in Web3D 17

Mesh Segmentation and Texture Mapping for Dimensional Inspec...

引用

22nd International Conference on 3D Web Technology

作者： Mejia, Daniel Sanchez, Jairo R. Segura, Alvaro Ruiz-Salguero, Oscar Posada, Jorge Cadavid, Carlos Univ EAFIT Lab CAD CAM CAE Medellin Colombia Vicomtech IK4 San Sebastian Spain

ISBN: (纸本)9781450349550

Traditionally, the data generated by industrial metrology software is stored as static reports that metrology experts produce for engineering and production departments. Nevertheless, industry demands new approaches that provide ubiquitous and real time access to overall geometry, manufacturing and other data. Web3D technologies can help to improve the traditional metrology methods and offer new ways to convey this information in web-based continuous friendly manner. However, enriched point clouds may be massive, thus presenting transmission and display limitations. To partially overcome these limitations, this article presents an algorithm that computes efficient metrology textures, which are then transferred and displayed through Web3D standards. Texture coordinates are computed only once for the reference CAD mesh on the server using in-house thermal-based segmentation and Hessian-based parameterization algorithms. The metrology data is then encoded in a texture file, which becomes available instantly for interactive visual inspection through the Web3D platform.

关键词： Web3D Texture Mapping mesh segmentation Dimensional Inspection Metrology

来源：评论

学校读者我要写书评

暂无评论

mesh segmentation guided by seed points

Mesh segmentation guided by seed points

引用

Asian Conference on Design and Digital Engineering (ACDDE 2014)

作者： Jiao, Xue Zhang, Huixin Wu, Tieru Jilin Univ Inst Math Changchun 130012 Jilin Peoples R China

Segmenting 3D models into meaningful parts is a fundamental problem in computer graphics. In this paper, we present an algorithm which is guided by the mesh vertices for segmenting a mesh into meaningful sub-meshes. First, a candidate set of feature points is selected to highlight the most significant features of the model. After that, a diversity measure is calculated by using Hausdorff distance. The collection of seed points we defined is a subset of the candidate set. The collection of seed points consists of two parts, namely, the basic point and lucky points. By maximizing the diversity measure between the seed set and candidate set, an appropriate seed point is selected. Based on the collection of seed points, the segmentation process can be guided by these seeds. Because humans generally perceive desirable segmentations at concave regions, and the geodesic distance and curvature are well-known noise sensitive. Considering the above factors, in order to partition the target into meaningful parts, we define a distance function between each pair of mesh vertices. This function is formed by arc length, angular distance and curvature-related correction term. We have tested the method developed in this paper with 3D meshes from the Princeton segmentation benchmark. Moreover, our segmentation method also has been compared with other methods. The experimental results have demonstrated the effectiveness of the proposed segmentation method.

关键词： mesh segmentation Seed point Clustering Distance function Geometric feature

来源：评论

学校读者我要写书评

暂无评论

mesh segmentation driven by Gaussian curvature

Mesh segmentation driven by Gaussian curvature

引用

13th Pacific Conference on Computer Graphics and Applications

作者： Yamauchi, H Gumhold, S Zayer, R Seidel, HP MPI Informat Saarbrucken Germany