通过深度神经网络的泛化实现等距测量分析中平面域的快速参数化

IF 1.3 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Computer Aided Geometric Design Pub Date : 2024-04-25 DOI:10.1016/j.cagd.2024.102313
Zheng Zhan , Wenping Wang , Falai Chen
{"title":"通过深度神经网络的泛化实现等距测量分析中平面域的快速参数化","authors":"Zheng Zhan ,&nbsp;Wenping Wang ,&nbsp;Falai Chen","doi":"10.1016/j.cagd.2024.102313","DOIUrl":null,"url":null,"abstract":"<div><p>One prominent step in isogeometric analysis (IGA) is known as domain parameterization, that is, finding a parametric spline representation for a computational domain. Typically, domain parameterization is divided into two separate steps: identifying an appropriate boundary correspondence and then parameterizing the interior region. However, this separation significantly degrades the quality of the parameterization. To attain high-quality parameterization, it is necessary to optimize both the boundary correspondence and the interior mapping simultaneously, referred to as integral parameterization. In a prior research, an integral parameterization approach for planar domains based on neural networks was introduced. One limitation of this approach is that the neural network has no ability of generalization, that is, a network has to be trained to obtain a parameterization for each specific computational domain. In this article, we propose an efficient enhancement over this work, and we train a network which has the capacity of generalization—once the network is trained, a parameterization can be immediately obtained for each specific computational via evaluating the network. The new network greatly speeds up the parameterization process by two orders of magnitudes. We evaluate the performance of the new network on the MPEG data set and a self-design data set, and experimental results demonstrate the superiority of our algorithm compared to state-of-the-art parameterization methods.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"111 ","pages":"Article 102313"},"PeriodicalIF":1.3000,"publicationDate":"2024-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fast parameterization of planar domains for isogeometric analysis via generalization of deep neural network\",\"authors\":\"Zheng Zhan ,&nbsp;Wenping Wang ,&nbsp;Falai Chen\",\"doi\":\"10.1016/j.cagd.2024.102313\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>One prominent step in isogeometric analysis (IGA) is known as domain parameterization, that is, finding a parametric spline representation for a computational domain. Typically, domain parameterization is divided into two separate steps: identifying an appropriate boundary correspondence and then parameterizing the interior region. However, this separation significantly degrades the quality of the parameterization. To attain high-quality parameterization, it is necessary to optimize both the boundary correspondence and the interior mapping simultaneously, referred to as integral parameterization. In a prior research, an integral parameterization approach for planar domains based on neural networks was introduced. One limitation of this approach is that the neural network has no ability of generalization, that is, a network has to be trained to obtain a parameterization for each specific computational domain. In this article, we propose an efficient enhancement over this work, and we train a network which has the capacity of generalization—once the network is trained, a parameterization can be immediately obtained for each specific computational via evaluating the network. The new network greatly speeds up the parameterization process by two orders of magnitudes. We evaluate the performance of the new network on the MPEG data set and a self-design data set, and experimental results demonstrate the superiority of our algorithm compared to state-of-the-art parameterization methods.</p></div>\",\"PeriodicalId\":55226,\"journal\":{\"name\":\"Computer Aided Geometric Design\",\"volume\":\"111 \",\"pages\":\"Article 102313\"},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2024-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Aided Geometric Design\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167839624000475\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Aided Geometric Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167839624000475","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

等距几何分析 (IGA) 的一个重要步骤是域参数化,即为计算域找到参数化样条线表示。通常,域参数化分为两个独立步骤:确定适当的边界对应关系,然后对内部区域进行参数化。然而,这种分离大大降低了参数化的质量。为了获得高质量的参数化,有必要同时优化边界对应和内部映射,这被称为积分参数化。在之前的研究中,提出了一种基于神经网络的平面域积分参数化方法。这种方法的一个局限是神经网络没有泛化能力,也就是说,必须对网络进行训练,才能获得每个特定计算域的参数化。在本文中,我们提出了一种有效的改进方法,即训练一个具有泛化能力的网络--一旦网络训练完成,就可以通过评估网络立即获得每个特定计算的参数化。新网络将参数化过程大大加快了两个数量级。我们在 MPEG 数据集和自我设计数据集上评估了新网络的性能,实验结果表明,与最先进的参数化方法相比,我们的算法更胜一筹。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Fast parameterization of planar domains for isogeometric analysis via generalization of deep neural network

One prominent step in isogeometric analysis (IGA) is known as domain parameterization, that is, finding a parametric spline representation for a computational domain. Typically, domain parameterization is divided into two separate steps: identifying an appropriate boundary correspondence and then parameterizing the interior region. However, this separation significantly degrades the quality of the parameterization. To attain high-quality parameterization, it is necessary to optimize both the boundary correspondence and the interior mapping simultaneously, referred to as integral parameterization. In a prior research, an integral parameterization approach for planar domains based on neural networks was introduced. One limitation of this approach is that the neural network has no ability of generalization, that is, a network has to be trained to obtain a parameterization for each specific computational domain. In this article, we propose an efficient enhancement over this work, and we train a network which has the capacity of generalization—once the network is trained, a parameterization can be immediately obtained for each specific computational via evaluating the network. The new network greatly speeds up the parameterization process by two orders of magnitudes. We evaluate the performance of the new network on the MPEG data set and a self-design data set, and experimental results demonstrate the superiority of our algorithm compared to state-of-the-art parameterization methods.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Aided Geometric Design
Computer Aided Geometric Design 工程技术-计算机:软件工程
CiteScore
3.50
自引率
13.30%
发文量
57
审稿时长
60 days
期刊介绍: The journal Computer Aided Geometric Design is for researchers, scholars, and software developers dealing with mathematical and computational methods for the description of geometric objects as they arise in areas ranging from CAD/CAM to robotics and scientific visualization. The journal publishes original research papers, survey papers and with quick editorial decisions short communications of at most 3 pages. The primary objects of interest are curves, surfaces, and volumes such as splines (NURBS), meshes, subdivision surfaces as well as algorithms to generate, analyze, and manipulate them. This journal will report on new developments in CAGD and its applications, including but not restricted to the following: -Mathematical and Geometric Foundations- Curve, Surface, and Volume generation- CAGD applications in Numerical Analysis, Computational Geometry, Computer Graphics, or Computer Vision- Industrial, medical, and scientific applications. The aim is to collect and disseminate information on computer aided design in one journal. To provide the user community with methods and algorithms for representing curves and surfaces. To illustrate computer aided geometric design by means of interesting applications. To combine curve and surface methods with computer graphics. To explain scientific phenomena by means of computer graphics. To concentrate on the interaction between theory and application. To expose unsolved problems of the practice. To develop new methods in computer aided geometry.
期刊最新文献
Optimal one-sided approximants of circular arc Editorial Board Build orientation optimization considering thermal distortion in additive manufacturing Algorithms and data structures for Cs-smooth RMB-splines of degree 2s + 1 Efficient object recognition under cluttered scenes via descriptor-based matching and single point voting
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1