一种基于综合相似度的三维流线选择算法

Xiaomei Hu, Jiahong Weng, Jianfei Chai, Mingnan Zhang, Yilin Li
{"title":"一种基于综合相似度的三维流线选择算法","authors":"Xiaomei Hu, Jiahong Weng, Jianfei Chai, Mingnan Zhang, Yilin Li","doi":"10.1117/12.2671191","DOIUrl":null,"url":null,"abstract":"In order to avoid the occlusion problems and missing important features of streamlines in the flow field, this paper proposes a 3D streamline selection algorithm based on comprehensive similarity. The method starts with a hierarchical clustering of streamline sets and then extracts streamlines with high similarity based on their comprehensive similarity. The comprehensive similarity of streamlines requires the calculation of the distance and contour similarity of the streamlines. In this paper, the Hausdorff distance is improved by proposing a partially matched Hausdorff distance to reduce the influence of streamline length on the similarity calculation. Then the contour similarity is calculated according to the ICP algorithm, and the entropy weighting method is used to calculate the weights to obtain the combined similarity. The final comparison with the result of another algorithm shows that the flow field structure is clearer, more complete and more evenly distributed when the streamlines are selected using this algorithm.","PeriodicalId":227528,"journal":{"name":"International Conference on Artificial Intelligence and Computer Engineering (ICAICE 2022)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A 3D streamline selection algorithm based on comprehensive similarity\",\"authors\":\"Xiaomei Hu, Jiahong Weng, Jianfei Chai, Mingnan Zhang, Yilin Li\",\"doi\":\"10.1117/12.2671191\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to avoid the occlusion problems and missing important features of streamlines in the flow field, this paper proposes a 3D streamline selection algorithm based on comprehensive similarity. The method starts with a hierarchical clustering of streamline sets and then extracts streamlines with high similarity based on their comprehensive similarity. The comprehensive similarity of streamlines requires the calculation of the distance and contour similarity of the streamlines. In this paper, the Hausdorff distance is improved by proposing a partially matched Hausdorff distance to reduce the influence of streamline length on the similarity calculation. Then the contour similarity is calculated according to the ICP algorithm, and the entropy weighting method is used to calculate the weights to obtain the combined similarity. The final comparison with the result of another algorithm shows that the flow field structure is clearer, more complete and more evenly distributed when the streamlines are selected using this algorithm.\",\"PeriodicalId\":227528,\"journal\":{\"name\":\"International Conference on Artificial Intelligence and Computer Engineering (ICAICE 2022)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Artificial Intelligence and Computer Engineering (ICAICE 2022)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.2671191\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Artificial Intelligence and Computer Engineering (ICAICE 2022)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2671191","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了避免流场中流线的遮挡问题和遗漏重要特征,本文提出了一种基于综合相似度的三维流线选择算法。该方法首先对流线集进行分层聚类,然后根据流线集的综合相似度提取相似度较高的流线。流线的综合相似度要求计算流线的距离和轮廓相似度。本文通过提出部分匹配的Hausdorff距离来改进Hausdorff距离,以减少流线长度对相似度计算的影响。然后根据ICP算法计算轮廓相似度,并采用熵权法计算权重,得到组合相似度。最后与另一种算法的结果对比表明,采用该算法选择流线时,流场结构更清晰、更完整、分布更均匀。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A 3D streamline selection algorithm based on comprehensive similarity
In order to avoid the occlusion problems and missing important features of streamlines in the flow field, this paper proposes a 3D streamline selection algorithm based on comprehensive similarity. The method starts with a hierarchical clustering of streamline sets and then extracts streamlines with high similarity based on their comprehensive similarity. The comprehensive similarity of streamlines requires the calculation of the distance and contour similarity of the streamlines. In this paper, the Hausdorff distance is improved by proposing a partially matched Hausdorff distance to reduce the influence of streamline length on the similarity calculation. Then the contour similarity is calculated according to the ICP algorithm, and the entropy weighting method is used to calculate the weights to obtain the combined similarity. The final comparison with the result of another algorithm shows that the flow field structure is clearer, more complete and more evenly distributed when the streamlines are selected using this algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信