Occlusion Segmentation: Restore and Segment Invisible Areas for Particle Objects

IF 6.4 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS IEEE Transactions on Automation Science and Engineering Pub Date : 2024-09-04 DOI:10.1109/TASE.2024.3450900
Jinshi Liu;Zhaohui Jiang;Weihua Gui;Zhiwen Chen;Chaobo Zhang
{"title":"Occlusion Segmentation: Restore and Segment Invisible Areas for Particle Objects","authors":"Jinshi Liu;Zhaohui Jiang;Weihua Gui;Zhiwen Chen;Chaobo Zhang","doi":"10.1109/TASE.2024.3450900","DOIUrl":null,"url":null,"abstract":"The occlusion problem has consistently posed a significant challenge in the field of segmentation. Most existing segmentation methods require additional annotations and fail to capture the contour information of occluded regions, thus not truly addressing the occlusion issue. Although segmentation tasks involving particle objects also suffer from occlusion problems, the homogeneity of particle objects offers new possibilities for overcoming this challenge. In this paper, we propose an occlusion segmentation framework for particle objects that does not require additional annotations. This framework only necessitates instance-level segmentation labels to obtain complete contour information of particle objects, including occluded regions. First, we decompose the occlusion segmentation task into a generic instance segmentation task and an occlusion repair task for occluded objects. Then, in order to train the occlusion repair model with only instance segmentation-level labels, we quantitatively analyze the occlusion phenomenon, including the mathematical descriptions of occlusion relationships, degrees, and distributions. Next, we geometrically transform and layer overlay the unobscured samples to construct occlusion samples containing labeling information of the occluded regions. These sample sets are used to train a generative model that predicts the contour information of occluded regions. Finally, we fine-tune or post-process the pre-segmentation model with the particle objects containing restored complete contour information to achieve the final occlusion segmentation. We conducted extensive ablation experiments on both the ore-particle dataset and publicly available cell-particle datasets. The experimental results validate the effectiveness, accuracy, and generalizability of our method. Note to Practitioners—Particle segmentation has been faced with the occlusion problem. In this paper, inspired by the similarity between particle objects, we propose a self-supervised occlusion segmentation framework that does not require additional annotation of occlusion layers. Our approach requires only instance segmentation level annotation without more complex additional manual annotation, which is crucial for practical applications. In addition, we decouple the complex occlusion relation modeling into a binary classification problem without knowing precisely the occlusion hierarchy between particles, which further reduces the difficulty of practical applications. Then, we also propose shading transformations to characterize the inter-particle shading distribution to construct shading sample sets from existing samples. Finally, we use these learned and constructed occlusion sample sets to pre-train the generative model for regenerating the occluded objects to complete the final occlusion segmentation. Although in a generic segmentation task, our approach may have some limitations because the segmented objects may not have an apparent similarity. However, our approach using self-supervision and the objects’ properties provides valuable ideas for solving the occlusion problem. In the future, we will solve the occlusion problem regarding the properties of each class of objects rather than just considering the similarity among particle objects.","PeriodicalId":51060,"journal":{"name":"IEEE Transactions on Automation Science and Engineering","volume":"22 ","pages":"6631-6642"},"PeriodicalIF":6.4000,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Automation Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10665752/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The occlusion problem has consistently posed a significant challenge in the field of segmentation. Most existing segmentation methods require additional annotations and fail to capture the contour information of occluded regions, thus not truly addressing the occlusion issue. Although segmentation tasks involving particle objects also suffer from occlusion problems, the homogeneity of particle objects offers new possibilities for overcoming this challenge. In this paper, we propose an occlusion segmentation framework for particle objects that does not require additional annotations. This framework only necessitates instance-level segmentation labels to obtain complete contour information of particle objects, including occluded regions. First, we decompose the occlusion segmentation task into a generic instance segmentation task and an occlusion repair task for occluded objects. Then, in order to train the occlusion repair model with only instance segmentation-level labels, we quantitatively analyze the occlusion phenomenon, including the mathematical descriptions of occlusion relationships, degrees, and distributions. Next, we geometrically transform and layer overlay the unobscured samples to construct occlusion samples containing labeling information of the occluded regions. These sample sets are used to train a generative model that predicts the contour information of occluded regions. Finally, we fine-tune or post-process the pre-segmentation model with the particle objects containing restored complete contour information to achieve the final occlusion segmentation. We conducted extensive ablation experiments on both the ore-particle dataset and publicly available cell-particle datasets. The experimental results validate the effectiveness, accuracy, and generalizability of our method. Note to Practitioners—Particle segmentation has been faced with the occlusion problem. In this paper, inspired by the similarity between particle objects, we propose a self-supervised occlusion segmentation framework that does not require additional annotation of occlusion layers. Our approach requires only instance segmentation level annotation without more complex additional manual annotation, which is crucial for practical applications. In addition, we decouple the complex occlusion relation modeling into a binary classification problem without knowing precisely the occlusion hierarchy between particles, which further reduces the difficulty of practical applications. Then, we also propose shading transformations to characterize the inter-particle shading distribution to construct shading sample sets from existing samples. Finally, we use these learned and constructed occlusion sample sets to pre-train the generative model for regenerating the occluded objects to complete the final occlusion segmentation. Although in a generic segmentation task, our approach may have some limitations because the segmented objects may not have an apparent similarity. However, our approach using self-supervision and the objects’ properties provides valuable ideas for solving the occlusion problem. In the future, we will solve the occlusion problem regarding the properties of each class of objects rather than just considering the similarity among particle objects.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
遮挡分割:还原和分割粒子对象的隐形区域
遮挡问题一直是分割领域的一大难题。现有的分割方法大多需要额外的标注,无法捕捉遮挡区域的轮廓信息,无法真正解决遮挡问题。尽管涉及粒子对象的分割任务也存在遮挡问题,但粒子对象的同质性为克服这一挑战提供了新的可能性。在本文中,我们提出了一个不需要额外注释的粒子对象遮挡分割框架。该框架只需要实例级分割标签就可以获得完整的粒子物体轮廓信息,包括遮挡区域。首先,我们将遮挡分割任务分解为一个通用的实例分割任务和一个遮挡修复任务。然后,为了训练仅使用实例分割级标签的闭塞修复模型,我们定量分析了闭塞现象,包括闭塞关系、程度和分布的数学描述。接下来,我们对未遮挡的样本进行几何变换和分层叠加,以构建包含遮挡区域标记信息的遮挡样本。这些样本集用于训练生成模型,该模型预测被遮挡区域的轮廓信息。最后,对包含恢复完整轮廓信息的粒子对象对预分割模型进行微调或后处理,实现最终的遮挡分割。我们对矿石颗粒数据集和公开可用的细胞颗粒数据集进行了广泛的烧蚀实验。实验结果验证了该方法的有效性、准确性和通用性。从业者注意:粒子分割一直面临着遮挡问题。在本文中,受粒子对象之间相似性的启发,我们提出了一种不需要额外标注遮挡层的自监督遮挡分割框架。我们的方法只需要实例分割级别的注释,而不需要更复杂的额外手工注释,这对实际应用至关重要。此外,我们在不精确知道粒子间遮挡层次的情况下,将复杂遮挡关系建模解耦为二值分类问题,进一步降低了实际应用的难度。然后,我们还提出了着色变换来表征粒子间着色分布,以从现有样本中构建着色样本集。最后,我们使用这些学习和构建的遮挡样本集来预训练生成模型,以重新生成被遮挡的物体,以完成最终的遮挡分割。虽然在一般的分割任务中,我们的方法可能有一些局限性,因为分割的对象可能没有明显的相似性。然而,我们使用自我监督和物体属性的方法为解决遮挡问题提供了有价值的想法。在未来,我们将根据每一类物体的属性来解决遮挡问题,而不仅仅是考虑粒子物体之间的相似性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Automation Science and Engineering
IEEE Transactions on Automation Science and Engineering 工程技术-自动化与控制系统
CiteScore
12.50
自引率
14.30%
发文量
404
审稿时长
3.0 months
期刊介绍: The IEEE Transactions on Automation Science and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. T-ASE welcomes results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, security, service, supply chains, and transportation. T-ASE addresses a research community willing to integrate knowledge across disciplines and industries. For this purpose, each paper includes a Note to Practitioners that summarizes how its results can be applied or how they might be extended to apply in practice.
期刊最新文献
Hybrid Event-Triggered Fuzzy Secure Consensus for PDE-Based Multi-Agent Systems Subject to Time Delays and Multiple Attacks An Advanced Hierarchical Control Strategy for Modeling and Stability Evaluation of a Novel Series-Connected Energy Routing System Nesterov Accelerated Gradient-Based Fixed-Time Convergent Actor-Critic Control for Nonlinear Systems Zero-Sum Game-based Optimal Estimation-Compensation Control for Multi-Agent Systems under Hybrid Attacks Resilient Synchronization of Multi-Leader MASs under Random Link Failure Constraints
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1