IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0320060.html
   My bibliography  Save this article

FDTransUnet: An aluminum surface defect segmentation model based on feature differentiation

Author

Listed:
  • Mingzhu Tang
  • Wencheng Wang

Abstract

Aiming at the current problems in the field of industrial defect segmentation, such as difficulty of obtaining a large number of defect samples, low recognition accuracy and lack of segmentation accuracy, a surface defect segmentation model for aluminum based on feature differentiation is proposed: FDTransUnet. First, the limited defective samples are effectively expanded by the feature differentiation data augmentation strategy to alleviate the overfitting problem caused by the insufficient sample. Second, the Transformer architecture is added by improving the U-net network, and the improved network combines the global self-attention mechanism of the Transformer and the hierarchical structure of the U-net, which can effectively extract the local and global information in the defect sample. Finally, a composite loss function is constructed to address the problem of unbalanced foreground and background sizes of defective samples and to improve segmentation accuracy. The experimental results show that FDTransUnet achieves 94.5% MPA and 89.7% Dice coefficient on the aluminum surface defect dataset. In the final generalization experiment, FDTransUnet is validated with other mainstream segmentation models on the steel surface defect dataset, and the experiment proves that the segmentation model has good generalization performance and robustness, and can be applied to different scenarios of industrial inspection.

Suggested Citation

  • Mingzhu Tang & Wencheng Wang, 2025. "FDTransUnet: An aluminum surface defect segmentation model based on feature differentiation," PLOS ONE, Public Library of Science, vol. 20(3), pages 1-16, March.
  • Handle: RePEc:plo:pone00:0320060
    DOI: 10.1371/journal.pone.0320060
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0320060
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0320060&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0320060?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0320060. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.