基于最近邻法的磨损颗粒链分割

Song Feng, M. Feng, Quan Chen, Kai Zheng, J. Mao
{"title":"基于最近邻法的磨损颗粒链分割","authors":"Song Feng, M. Feng, Quan Chen, Kai Zheng, J. Mao","doi":"10.1109/SDPC.2019.00115","DOIUrl":null,"url":null,"abstract":"Wear particle segmentation is an important step in the analysis and processing of ferrographic images, and it is also a hot topic in the field of ferrographic images. At present, the acquisition of ferrographic images is mostly based on the principle of magnetic field deposition. Wear particles will be chained and accumulated during the deposition process. Therefore, an effective wear particle segmentation method is needed. In this paper, a wear particle segmentation method based on the nearest neighbor algorithm is proposed. The method first decomposes the captured video into images. Then, this method introduces the nearest neighbor algorithm to extract the deposition process of wear particles, uses the distance transformation to form markers, and uses the marker-controlled watershed to solve the segmentation of the wear particle chain.Compared with traditional watershed segmentation algorithm, the problem of over-segmentation and under-segmentation is solved. The experimental results show that the segmentation results of the ferrographic image are accurate and fast, which lays a foundation for the subsequent extraction of the wear particle features.","PeriodicalId":403595,"journal":{"name":"2019 International Conference on Sensing, Diagnostics, Prognostics, and Control (SDPC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Wear Particle Chain Segmentation Based on the Nearest Neighbor Method\",\"authors\":\"Song Feng, M. Feng, Quan Chen, Kai Zheng, J. Mao\",\"doi\":\"10.1109/SDPC.2019.00115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wear particle segmentation is an important step in the analysis and processing of ferrographic images, and it is also a hot topic in the field of ferrographic images. At present, the acquisition of ferrographic images is mostly based on the principle of magnetic field deposition. Wear particles will be chained and accumulated during the deposition process. Therefore, an effective wear particle segmentation method is needed. In this paper, a wear particle segmentation method based on the nearest neighbor algorithm is proposed. The method first decomposes the captured video into images. Then, this method introduces the nearest neighbor algorithm to extract the deposition process of wear particles, uses the distance transformation to form markers, and uses the marker-controlled watershed to solve the segmentation of the wear particle chain.Compared with traditional watershed segmentation algorithm, the problem of over-segmentation and under-segmentation is solved. The experimental results show that the segmentation results of the ferrographic image are accurate and fast, which lays a foundation for the subsequent extraction of the wear particle features.\",\"PeriodicalId\":403595,\"journal\":{\"name\":\"2019 International Conference on Sensing, Diagnostics, Prognostics, and Control (SDPC)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Sensing, Diagnostics, Prognostics, and Control (SDPC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SDPC.2019.00115\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Sensing, Diagnostics, Prognostics, and Control (SDPC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SDPC.2019.00115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

磨粒分割是铁谱图像分析与处理的重要步骤,也是铁谱图像领域的研究热点。目前,铁谱图像的获取多基于磁场沉积原理。在沉积过程中,磨损颗粒会形成链状积聚。因此,需要一种有效的磨损颗粒分割方法。提出了一种基于最近邻算法的磨损颗粒分割方法。该方法首先将捕获的视频分解成图像。然后,该方法引入最近邻算法提取磨损颗粒沉积过程,利用距离变换形成标记,利用标记控制分水岭解决磨损颗粒链的分割问题。与传统分水岭分割算法相比,解决了过分割和欠分割的问题。实验结果表明,铁谱图像的分割结果准确、快速,为后续磨粒特征的提取奠定了基础。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Wear Particle Chain Segmentation Based on the Nearest Neighbor Method
Wear particle segmentation is an important step in the analysis and processing of ferrographic images, and it is also a hot topic in the field of ferrographic images. At present, the acquisition of ferrographic images is mostly based on the principle of magnetic field deposition. Wear particles will be chained and accumulated during the deposition process. Therefore, an effective wear particle segmentation method is needed. In this paper, a wear particle segmentation method based on the nearest neighbor algorithm is proposed. The method first decomposes the captured video into images. Then, this method introduces the nearest neighbor algorithm to extract the deposition process of wear particles, uses the distance transformation to form markers, and uses the marker-controlled watershed to solve the segmentation of the wear particle chain.Compared with traditional watershed segmentation algorithm, the problem of over-segmentation and under-segmentation is solved. The experimental results show that the segmentation results of the ferrographic image are accurate and fast, which lays a foundation for the subsequent extraction of the wear particle features.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信