IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0356870.html

LYEU-Net: A lightweight yet efficient U-Net with multibranch feature aggregation for pavement crack segmentation

Author

Listed:
  • Bing Yang
  • Jiaying He
  • Yuncheng Shen

Abstract

Accurate segmentation of pavement cracks is crucial for intelligent transportation systems. However, a critical research gap exists in current methodologies: high-performance models require substantial computational resources, which renders them unsuitable for edge deployment, whereas existing lightweight models often sacrifice segmentation accuracy for low resource use. To address this challenge, we propose LYEU-Net, a lightweight yet efficient U-Net architecture that is designed to balance accuracy and efficiency. The model incorporates three key innovations: a feature extraction module (FEM) for improved salient feature extraction using skip connections, a multibranch feature extraction module (MBM) for efficient multiscale contextual feature capture, and a feature aggregation module (FAM) for adaptive feature weighting to refine decoder outputs. Experimental results across four diverse datasets (Crack500, ShadowCrack, GAPs384, and AigleRN-TRIMM) show that LYEU-Net achieves the best mIoU among the compared methods with only 0.134M parameters and 0.347G FLOPs. It improves precision and mIoU over existing methods, although slight decreases in recall or F1 score on some datasets indicate a precision–recall trade-off. This work provides a viable solution for real-time crack detection on mobile devices. The code and data are available at https://github.com/yangbing668/LYEU-Net.

Suggested Citation

  • Bing Yang & Jiaying He & Yuncheng Shen, 2026. "LYEU-Net: A lightweight yet efficient U-Net with multibranch feature aggregation for pavement crack segmentation," PLOS ONE, Public Library of Science, vol. 21(8), pages 1-20, August.
  • Handle: RePEc:plo:pone00:0356870
    DOI: 10.1371/journal.pone.0356870
    as

    Download full text from publisher

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

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

    File URL: https://libkey.io/10.1371/journal.pone.0356870?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:0356870. 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.