目标识别区域的递归填充算法

M. Bobyr, N. I. Khrapova, O. G. Suprunova, A. A. Dorodnykh
{"title":"目标识别区域的递归填充算法","authors":"M. Bobyr, N. I. Khrapova, O. G. Suprunova, A. A. Dorodnykh","doi":"10.21869/2223-1560-2023-27-1-126-139","DOIUrl":null,"url":null,"abstract":"Purpose of research. The recursive algorithm for painting recognized areas on a binarized image and extracting the contours of a color mark, in order to find the minimum time for counting the number of filled pixels in a recognized mark, was developed in the article.Methods. The region filling algorithm in the image is based on the recursive method. The algorithm begins the work from the central point of the image and analyzes the presence of unshaded pixels in adjacent cells. In the article is considered the definition of the shortest time for filling the recognized area in eight directions: east-south-west-north, east-north-west-south, southeast-northwest, southwest-northeast, west-south-east-north, west-north-east-south, north-east-south-west, north west south east. The algorithm contains several stages: checking the exit from the recursion provided that all areas are filled, filling the initial cell, filling the elements in four directions from the starting point, counting the number of filled elements.Results. A recursive algorithm for filling recognized areas on a binarized image with the possibility of highlighting the contours of a recognized mark has been developed. The direction of the optimal bypass, which has the shortest time in relation to other considered directions, is determined. The testing was carried out for cycles with 10, 50 and 100 iterations. According to the presented algorithm, a specialized software model was created. The number of the certificate of state registration of the computer program \"Program for filling a recognized mark\" is 2023612631.Conclusion. The results of experimental studies showed that for a cycle value of 10 iterations, the best time to fill the area is 12762 msec, for a cycle value of 50 iterations, the best time is 76008 msec, for a cycle value of 100 iterations, the best time is 160568 msec. The minimum average time to complete the filling operation was 84357 msec, therefore, the best of the eight pass combinations turned out to be the direction - north-east-south-west.","PeriodicalId":443878,"journal":{"name":"Proceedings of the Southwest State University","volume":"341 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Recursive Algorithm for Filling Areas of Recognized Objects\",\"authors\":\"M. Bobyr, N. I. Khrapova, O. G. Suprunova, A. A. Dorodnykh\",\"doi\":\"10.21869/2223-1560-2023-27-1-126-139\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Purpose of research. The recursive algorithm for painting recognized areas on a binarized image and extracting the contours of a color mark, in order to find the minimum time for counting the number of filled pixels in a recognized mark, was developed in the article.Methods. The region filling algorithm in the image is based on the recursive method. The algorithm begins the work from the central point of the image and analyzes the presence of unshaded pixels in adjacent cells. In the article is considered the definition of the shortest time for filling the recognized area in eight directions: east-south-west-north, east-north-west-south, southeast-northwest, southwest-northeast, west-south-east-north, west-north-east-south, north-east-south-west, north west south east. The algorithm contains several stages: checking the exit from the recursion provided that all areas are filled, filling the initial cell, filling the elements in four directions from the starting point, counting the number of filled elements.Results. A recursive algorithm for filling recognized areas on a binarized image with the possibility of highlighting the contours of a recognized mark has been developed. The direction of the optimal bypass, which has the shortest time in relation to other considered directions, is determined. The testing was carried out for cycles with 10, 50 and 100 iterations. According to the presented algorithm, a specialized software model was created. The number of the certificate of state registration of the computer program \\\"Program for filling a recognized mark\\\" is 2023612631.Conclusion. The results of experimental studies showed that for a cycle value of 10 iterations, the best time to fill the area is 12762 msec, for a cycle value of 50 iterations, the best time is 76008 msec, for a cycle value of 100 iterations, the best time is 160568 msec. The minimum average time to complete the filling operation was 84357 msec, therefore, the best of the eight pass combinations turned out to be the direction - north-east-south-west.\",\"PeriodicalId\":443878,\"journal\":{\"name\":\"Proceedings of the Southwest State University\",\"volume\":\"341 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Southwest State University\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21869/2223-1560-2023-27-1-126-139\",\"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 Southwest State University","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21869/2223-1560-2023-27-1-126-139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

研究目的。本文提出了一种递归算法,用于在二值化图像上绘制识别区域并提取颜色标记的轮廓,以找到计算识别标记中填充像素数的最短时间。图像中的区域填充算法是基于递归方法的。该算法从图像的中心点开始工作,并分析相邻单元中有无阴影像素的存在。本文考虑了8个方向填充认定区域最短时间的定义:东-西南-北、东-西北-南、东南-西北、西南-东北、西-东南-东北、西-东南-南、东北-西南、西北-西南、西北-东南-东。该算法包含几个阶段:检查所有区域都被填充的递归出口,填充初始单元格,从起点四个方向填充元素,计算填充元素的数量。提出了一种递归算法,用于在二值化图像上填充识别区域,并可能突出识别标记的轮廓。确定了相对于其他考虑方向时间最短的最优旁路方向。测试进行了10次、50次和100次迭代的循环。根据提出的算法,建立了专门的软件模型。计算机程序“填写认可标志程序”的国家注册证书编号为2023612631。实验研究结果表明,当周期值为10次迭代时,填充区域的最佳时间为12762 msec,当周期值为50次迭代时,填充区域的最佳时间为76008 msec,当周期值为100次迭代时,填充区域的最佳时间为160568 msec。完成充填作业的最短平均时间为84357毫秒,因此,8个通道组合中最佳的方向是东北-西南方向。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Recursive Algorithm for Filling Areas of Recognized Objects
Purpose of research. The recursive algorithm for painting recognized areas on a binarized image and extracting the contours of a color mark, in order to find the minimum time for counting the number of filled pixels in a recognized mark, was developed in the article.Methods. The region filling algorithm in the image is based on the recursive method. The algorithm begins the work from the central point of the image and analyzes the presence of unshaded pixels in adjacent cells. In the article is considered the definition of the shortest time for filling the recognized area in eight directions: east-south-west-north, east-north-west-south, southeast-northwest, southwest-northeast, west-south-east-north, west-north-east-south, north-east-south-west, north west south east. The algorithm contains several stages: checking the exit from the recursion provided that all areas are filled, filling the initial cell, filling the elements in four directions from the starting point, counting the number of filled elements.Results. A recursive algorithm for filling recognized areas on a binarized image with the possibility of highlighting the contours of a recognized mark has been developed. The direction of the optimal bypass, which has the shortest time in relation to other considered directions, is determined. The testing was carried out for cycles with 10, 50 and 100 iterations. According to the presented algorithm, a specialized software model was created. The number of the certificate of state registration of the computer program "Program for filling a recognized mark" is 2023612631.Conclusion. The results of experimental studies showed that for a cycle value of 10 iterations, the best time to fill the area is 12762 msec, for a cycle value of 50 iterations, the best time is 76008 msec, for a cycle value of 100 iterations, the best time is 160568 msec. The minimum average time to complete the filling operation was 84357 msec, therefore, the best of the eight pass combinations turned out to be the direction - north-east-south-west.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信