{"title":"路网约束下多表征建筑的全局优化匹配方法","authors":"Guowei Luo, K. Qin","doi":"10.3233/jcm-226820","DOIUrl":null,"url":null,"abstract":"Entity matching is one of the key technologies for geospatial data update and fusion. In response to the shortcomings of most spatial entity matching methods that use local optimisation strategies, a global optimisation matching method for multi-representation buildings using road network constraints is proposed. First, the road network is used for region segmentation to obtain candidate matches. Second, the spatial similarity among the candidate matching objects is calculated and the characteristic similarity weights are determined using the entropy weight method. Third, the matching of building entities is transformed into an allocation problem using integer programming ideas, and the Hungarian algorithm is solved to obtain the optimal matching combination with minimum global variance. Finally, two test areas are selected to validate the proposed method, and the precision, recall, and F-measure values of the experiments are 96.35%, 97.11%, and 96.73% versus 95.96%, 97.03%, and 96.49%, respectively. The matching accuracy is greatly improved compared with the local search strategy.","PeriodicalId":45004,"journal":{"name":"Journal of Computational Methods in Sciences and Engineering","volume":"23 1","pages":"2413-2424"},"PeriodicalIF":0.5000,"publicationDate":"2023-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Global optimisation matching method for multi-representation buildings constrained by road network\",\"authors\":\"Guowei Luo, K. Qin\",\"doi\":\"10.3233/jcm-226820\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Entity matching is one of the key technologies for geospatial data update and fusion. In response to the shortcomings of most spatial entity matching methods that use local optimisation strategies, a global optimisation matching method for multi-representation buildings using road network constraints is proposed. First, the road network is used for region segmentation to obtain candidate matches. Second, the spatial similarity among the candidate matching objects is calculated and the characteristic similarity weights are determined using the entropy weight method. Third, the matching of building entities is transformed into an allocation problem using integer programming ideas, and the Hungarian algorithm is solved to obtain the optimal matching combination with minimum global variance. Finally, two test areas are selected to validate the proposed method, and the precision, recall, and F-measure values of the experiments are 96.35%, 97.11%, and 96.73% versus 95.96%, 97.03%, and 96.49%, respectively. The matching accuracy is greatly improved compared with the local search strategy.\",\"PeriodicalId\":45004,\"journal\":{\"name\":\"Journal of Computational Methods in Sciences and Engineering\",\"volume\":\"23 1\",\"pages\":\"2413-2424\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Methods in Sciences and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/jcm-226820\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Methods in Sciences and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/jcm-226820","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
Global optimisation matching method for multi-representation buildings constrained by road network
Entity matching is one of the key technologies for geospatial data update and fusion. In response to the shortcomings of most spatial entity matching methods that use local optimisation strategies, a global optimisation matching method for multi-representation buildings using road network constraints is proposed. First, the road network is used for region segmentation to obtain candidate matches. Second, the spatial similarity among the candidate matching objects is calculated and the characteristic similarity weights are determined using the entropy weight method. Third, the matching of building entities is transformed into an allocation problem using integer programming ideas, and the Hungarian algorithm is solved to obtain the optimal matching combination with minimum global variance. Finally, two test areas are selected to validate the proposed method, and the precision, recall, and F-measure values of the experiments are 96.35%, 97.11%, and 96.73% versus 95.96%, 97.03%, and 96.49%, respectively. The matching accuracy is greatly improved compared with the local search strategy.
期刊介绍:
The major goal of the Journal of Computational Methods in Sciences and Engineering (JCMSE) is the publication of new research results on computational methods in sciences and engineering. Common experience had taught us that computational methods originally developed in a given basic science, e.g. physics, can be of paramount importance to other neighboring sciences, e.g. chemistry, as well as to engineering or technology and, in turn, to society as a whole. This undoubtedly beneficial practice of interdisciplinary interactions will be continuously and systematically encouraged by the JCMSE.