arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2312.05100cs.CVcs.LG

通过子网络创建与选择实现表面缺陷分割的持续学习

Continual learning for surface defect segmentation by subnetwork creation and selection

Delft University of Technology(代尔夫特理工大学);Brown University(布朗大学)

Aleksandr Dekhovich, Miguel A. Bessa

AI总结:

提出持续学习算法 LDA-CP&S,通过迭代剪枝为每类缺陷创建子网络并用 LDA 选择,在增量表面缺陷分割中避免遗忘,性能较现有方法提升一倍且接近联合训练。

摘要:

我们提出了一种名为 LDA-CP&S 的新型持续(或称终身)学习算法,该算法在执行分割任务时不会发生灾难性遗忘。该方法被应用于两个不同的表面缺陷分割问题,这些问题以增量方式学习,即每次只提供一种缺陷类型的数据,同时仍能够预测此前见过的所有缺陷。我们的方法通过迭代剪枝为每种缺陷类型创建一个与缺陷相关的子网络,并训练一个基于线性判别分析(LDA)的分类器。在推理阶段,我们首先用 LDA 预测缺陷类型,然后使用所选子网络预测表面缺陷。我们将该方法与其他持续学习方法进行比较,结果显示出显著改进:在两个数据集上,与现有方法相比,平均交并比提升了一倍。重要的是,当所有训练数据(所有缺陷)同时可见时,我们的方法取得了与联合训练相当的结果。

英文摘要:

We introduce a new continual (or lifelong) learning algorithm called LDA-CP&S that performs segmentation tasks without undergoing catastrophic forgetting. The method is applied to two different surface defect segmentation problems that are learned incrementally, i.e. providing data about one type of defect at a time, while still being capable of predicting every defect that was seen previously. Our method creates a defect-related subnetwork for each defect type via iterative pruning and trains a classifier based on linear discriminant analysis (LDA). At the inference stage, we first predict the defect type with LDA and then predict the surface defects using the selected subnetwork. We compare our method with other continual learning methods showing a significant improvement -- mean Intersection over Union better by a factor of two when compared to existing methods on both datasets. Importantly, our approach shows comparable results with joint training when all the training data (all defects) are seen simultaneously

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑