基于矩阵分解的地图相似性测试

2009 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2009-11-04 DOI:10.1109/INCOS.2009.74

J. Dvorský, V. Snás̃el, V. Voženílek

{"title":"基于矩阵分解的地图相似性测试","authors":"J. Dvorský, V. Snás̃el, V. Voženílek","doi":"10.1109/INCOS.2009.74","DOIUrl":null,"url":null,"abstract":"The similarity of two maps can be most easily compared visually. In this case, the degree of similarity is very subjective. It is therefore necessary to find an objective method for measuring similarity. This paper presents a method based on Singular Value Decomposition (SVD).","PeriodicalId":145328,"journal":{"name":"2009 International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Map Similarity Testing Using Matrix Decomposition\",\"authors\":\"J. Dvorský, V. Snás̃el, V. Voženílek\",\"doi\":\"10.1109/INCOS.2009.74\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The similarity of two maps can be most easily compared visually. In this case, the degree of similarity is very subjective. It is therefore necessary to find an objective method for measuring similarity. This paper presents a method based on Singular Value Decomposition (SVD).\",\"PeriodicalId\":145328,\"journal\":{\"name\":\"2009 International Conference on Intelligent Networking and Collaborative Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Intelligent Networking and Collaborative Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INCOS.2009.74\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCOS.2009.74","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 22

摘要

两张地图的相似性最容易在视觉上进行比较。在这种情况下，相似程度是非常主观的。因此，有必要找到一种客观的方法来衡量相似性。本文提出了一种基于奇异值分解(SVD)的方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Map Similarity Testing Using Matrix Decomposition

The similarity of two maps can be most easily compared visually. In this case, the degree of similarity is very subjective. It is therefore necessary to find an objective method for measuring similarity. This paper presents a method based on Singular Value Decomposition (SVD).

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 International Conference on Intelligent Networking and Collaborative Systems

自引率

0.00%

发文量