一种多连通粒子分割方法

Xing-Qiang Wu, J. Kemeny
{"title":"一种多连通粒子分割方法","authors":"Xing-Qiang Wu, J. Kemeny","doi":"10.1109/ACV.1992.240305","DOIUrl":null,"url":null,"abstract":"An automatic particle segmentation system is developed for calculating the size distribution of rock fragments created by blasting. A rock composite due to blasting is often fully multi-connected in which individual particles cannot be delineated by the existing segmentation algorithms. Two algorithms are proposed to approach this multi-connected segmentation problem. The first algorithm analyzes the shape of each shadow (a simply-connected region) and 'splits' the particles from shadow boundary convexity points if a relatively large gradient path occurs. The second algorithm finds clusters of rock particles which may not be delineated due to the lack of a strong gradient along the touching portions and delineates them using a shape heuristics. A large number of test results show that the method is fast and accurate.<<ETX>>","PeriodicalId":153393,"journal":{"name":"[1992] Proceedings IEEE Workshop on Applications of Computer Vision","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"A segmentation method for multi-connected particle delineation\",\"authors\":\"Xing-Qiang Wu, J. Kemeny\",\"doi\":\"10.1109/ACV.1992.240305\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An automatic particle segmentation system is developed for calculating the size distribution of rock fragments created by blasting. A rock composite due to blasting is often fully multi-connected in which individual particles cannot be delineated by the existing segmentation algorithms. Two algorithms are proposed to approach this multi-connected segmentation problem. The first algorithm analyzes the shape of each shadow (a simply-connected region) and 'splits' the particles from shadow boundary convexity points if a relatively large gradient path occurs. The second algorithm finds clusters of rock particles which may not be delineated due to the lack of a strong gradient along the touching portions and delineates them using a shape heuristics. A large number of test results show that the method is fast and accurate.<<ETX>>\",\"PeriodicalId\":153393,\"journal\":{\"name\":\"[1992] Proceedings IEEE Workshop on Applications of Computer Vision\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings IEEE Workshop on Applications of Computer Vision\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACV.1992.240305\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings IEEE Workshop on Applications of Computer Vision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACV.1992.240305","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

研制了一种自动颗粒分割系统,用于计算爆破产生的岩屑尺寸分布。由爆破引起的岩石复合材料通常是完全多连通的,其中单个颗粒无法用现有的分割算法来描绘。针对这种多连接分割问题,提出了两种算法。第一种算法分析每个阴影(单连通区域)的形状,如果出现相对较大的梯度路径,则从阴影边界凸点“分裂”粒子。第二种算法找到可能由于缺乏沿接触部分的强梯度而无法描绘的岩石颗粒簇,并使用形状启发式描绘它们。大量试验结果表明,该方法快速、准确。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A segmentation method for multi-connected particle delineation
An automatic particle segmentation system is developed for calculating the size distribution of rock fragments created by blasting. A rock composite due to blasting is often fully multi-connected in which individual particles cannot be delineated by the existing segmentation algorithms. Two algorithms are proposed to approach this multi-connected segmentation problem. The first algorithm analyzes the shape of each shadow (a simply-connected region) and 'splits' the particles from shadow boundary convexity points if a relatively large gradient path occurs. The second algorithm finds clusters of rock particles which may not be delineated due to the lack of a strong gradient along the touching portions and delineates them using a shape heuristics. A large number of test results show that the method is fast and accurate.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信