最小二乘属性图匹配的图分解方法

Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004. Pub Date : 2004-08-23 DOI:10.1109/ICPR.2004.1334265

Jianfeng Lu, T. Caelli, Jing-yu Yang

{"title":"最小二乘属性图匹配的图分解方法","authors":"Jianfeng Lu, T. Caelli, Jing-yu Yang","doi":"10.1109/ICPR.2004.1334265","DOIUrl":null,"url":null,"abstract":"A graph decomposition model is combined with recent developments in least squares methods for matching attributed graphs. In particular, we show how this approach improves the robustness of graph matching and also reveals important structural similarities between subgraphs of target and model graphs.","PeriodicalId":335842,"journal":{"name":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A graph decomposition approach to least squares attributed graph matching\",\"authors\":\"Jianfeng Lu, T. Caelli, Jing-yu Yang\",\"doi\":\"10.1109/ICPR.2004.1334265\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A graph decomposition model is combined with recent developments in least squares methods for matching attributed graphs. In particular, we show how this approach improves the robustness of graph matching and also reveals important structural similarities between subgraphs of target and model graphs.\",\"PeriodicalId\":335842,\"journal\":{\"name\":\"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-08-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.2004.1334265\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.2004.1334265","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

结合最小二乘匹配属性图的最新进展，提出了一种图分解模型。特别是，我们展示了这种方法如何提高图匹配的鲁棒性，并揭示了目标图和模型图的子图之间重要的结构相似性。

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

查看原文本刊更多论文

A graph decomposition approach to least squares attributed graph matching

A graph decomposition model is combined with recent developments in least squares methods for matching attributed graphs. In particular, we show how this approach improves the robustness of graph matching and also reveals important structural similarities between subgraphs of target and model graphs.

求助全文

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

来源期刊

Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.

自引率

0.00%

发文量