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}
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.