{"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}
引用次数: 16
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.<>