A Shape Matching Method Considering Computational Feasibility

Hiroki Yamamoto, Kazunori Iwata, N. Suematsu, Kazushi Mimura
{"title":"A Shape Matching Method Considering Computational Feasibility","authors":"Hiroki Yamamoto, Kazunori Iwata, N. Suematsu, Kazushi Mimura","doi":"10.1145/3297067.3297077","DOIUrl":null,"url":null,"abstract":"Regarding shape matching, we present a novel method of determining a correspondence between shapes that is applicable to existing local descriptors and somewhat enhances them. In our method, we determine the correspondence of a focusing point of a shape, considering the correspondence of neighboring points to the focusing point. This plays a vital role in avoiding the risk of failing to notice a more appropriate correspondence. However, considering neighboring points causes another problem of computational feasibility because there is a considerable increase in the number of possible correspondences searched in matching shapes. We therefore manage this problem using an efficient approximation to reduce the number of possible correspondences. Conducting numerical analysis on shape retrieval, we show that our method is useful for obtaining a better correspondence than the conventional method that does not consider the correspondence of neighboring points.","PeriodicalId":340004,"journal":{"name":"International Conference on Signal Processing and Machine Learning","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Signal Processing and Machine Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3297067.3297077","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Regarding shape matching, we present a novel method of determining a correspondence between shapes that is applicable to existing local descriptors and somewhat enhances them. In our method, we determine the correspondence of a focusing point of a shape, considering the correspondence of neighboring points to the focusing point. This plays a vital role in avoiding the risk of failing to notice a more appropriate correspondence. However, considering neighboring points causes another problem of computational feasibility because there is a considerable increase in the number of possible correspondences searched in matching shapes. We therefore manage this problem using an efficient approximation to reduce the number of possible correspondences. Conducting numerical analysis on shape retrieval, we show that our method is useful for obtaining a better correspondence than the conventional method that does not consider the correspondence of neighboring points.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种考虑计算可行性的形状匹配方法
在形状匹配方面,我们提出了一种确定形状之间对应关系的新方法,该方法适用于现有的局部描述符,并在一定程度上增强了它们。在我们的方法中,我们考虑到相邻点对焦点的对应关系来确定形状焦点的对应关系。这在避免没有注意到更合适的通信的风险方面起着至关重要的作用。然而,考虑相邻点会引起另一个计算可行性问题,因为在匹配形状中搜索到的可能对应的数量会大大增加。因此,我们使用一个有效的近似来处理这个问题,以减少可能的对应数量。通过对形状检索的数值分析,表明该方法比不考虑相邻点对应关系的传统方法能获得更好的对应关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multi-source Radar Data Fusion via Support Vector Regression Data Link Modeling and Simulation Based on DEVS Implement AI Service into VR Training Automated Detection of Sewer Pipe Defects Based on Cost-Sensitive Convolutional Neural Network Multi-Scale Deep Convolutional Nets with Attention Model and Conditional Random Fields for Semantic Image Segmentation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1