利用图匹配算法对输送带上的物体进行识别

V. Ondroušek, J. Kolomazník, Marcel Vytečka
{"title":"利用图匹配算法对输送带上的物体进行识别","authors":"V. Ondroušek, J. Kolomazník, Marcel Vytečka","doi":"10.1109/MECHATRONIKA.2014.7018350","DOIUrl":null,"url":null,"abstract":"The issue of detecting machine parts on the conveyor belt is solved in this contribution. The graph matching algorithm that calculates the smallest distance between two graphs was selected to solve the given problem. Especially finding the best combination of selecting feature points from the image, creating graph structure from these points and looking for optimal parameters of the graph matching algorithm, is under discussion in this article. Accuracy of the object recognition together with the time consumption of the used methods is considered.","PeriodicalId":430829,"journal":{"name":"Proceedings of the 16th International Conference on Mechatronics - Mechatronika 2014","volume":" 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Recognition of the objects on the conveyor belt using graph matching algorithms\",\"authors\":\"V. Ondroušek, J. Kolomazník, Marcel Vytečka\",\"doi\":\"10.1109/MECHATRONIKA.2014.7018350\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The issue of detecting machine parts on the conveyor belt is solved in this contribution. The graph matching algorithm that calculates the smallest distance between two graphs was selected to solve the given problem. Especially finding the best combination of selecting feature points from the image, creating graph structure from these points and looking for optimal parameters of the graph matching algorithm, is under discussion in this article. Accuracy of the object recognition together with the time consumption of the used methods is considered.\",\"PeriodicalId\":430829,\"journal\":{\"name\":\"Proceedings of the 16th International Conference on Mechatronics - Mechatronika 2014\",\"volume\":\" 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 16th International Conference on Mechatronics - Mechatronika 2014\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MECHATRONIKA.2014.7018350\",\"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 16th International Conference on Mechatronics - Mechatronika 2014","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MECHATRONIKA.2014.7018350","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

解决了输送带上机械零件的检测问题。选择计算两个图之间最小距离的图匹配算法来解决给定问题。特别是从图像中选择特征点,从这些特征点创建图结构和寻找图匹配算法的最优参数的最佳组合,本文进行了讨论。考虑了目标识别的精度和所用方法的耗时。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Recognition of the objects on the conveyor belt using graph matching algorithms
The issue of detecting machine parts on the conveyor belt is solved in this contribution. The graph matching algorithm that calculates the smallest distance between two graphs was selected to solve the given problem. Especially finding the best combination of selecting feature points from the image, creating graph structure from these points and looking for optimal parameters of the graph matching algorithm, is under discussion in this article. Accuracy of the object recognition together with the time consumption of the used methods is considered.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信