{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
