Bing Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Bing Yang has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
Jian Xiong
2 shared publicationsChong Zhong
1 shared publicationFei Wang
Department of Software Engineering, School of Software, Yunnan University, Kunming, China
1 shared publicationHao Li
Department of Software Engineering, School of Software, Yunnan University, Kunming, China
1 shared publicationJiaying He
Zhaotong University
1 shared publication- Lidong Chen
Beijing University of Technology, Beijing, People's Republic of China
1 shared publication
Latest Publications
- Open Access
- 25 August 2026
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 21 (8) , e0356870
LYEU-Net: A lightweight yet efficient U-Net with multibranch feature aggregation for pavement crack segmentation
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 .
- 25 August 2026
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 21 (8) , e0356870
Open AccessLYEU-Net: A lightweight yet efficient U-Net with multibranch feature aggregation for pavement crack segmentation
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 .
- Open Access
- 10 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 899-906
Application of NSGA-Ⅱ in multi-objective flexible job shop scheduling for solid wood custom furniture
- 10 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 899-906
Open AccessApplication of NSGA-Ⅱ in multi-objective flexible job shop scheduling for solid wood custom furniture
- 26 August 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 147
Location and path planning for urban emergency rescue by a hybrid clustering and ant colony algorithm approach
- 26 August 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 147
Location and path planning for urban emergency rescue by a hybrid clustering and ant colony algorithm approach
- 20 December 2022
- Published by Elsevier in Knowledge-Based Systems
- Vol. 262
Deep reinforcement learning based on transformer and U-Net framework for stock trading
- 20 December 2022
- Published by Elsevier in Knowledge-Based Systems
- Vol. 262
Deep reinforcement learning based on transformer and U-Net framework for stock trading
- 2 February 2021
- Published by Taylor & Francis in Transportation Letters
- Vol. 14 (4) , 407-415
ST-FVGAN: filling series traffic missing values with generative adversarial network
The imputation of time series traffic flow data is of great significance to the intelligent transportation, urban planning, and road emergency handling. This paper proposes a filling missing time series traffic data with Generative Adversarial Network (ST-FVGAN), which not only considers the spatio-temporal correlation and utilizes the idea of data generating of the Generative Adversarial Network, but also considers the external factors and introduces a more comprehensive loss function. Specifically, the model firstly constructs a Generator network which is composed of convolutional layer, residual block, and pixelshuffle block for the better potential distribution of the existing data, and then use the Discriminator network for the input judging. Experiments are conducted on the open-source TaxiBJ GPS dataset, and evaluated by the root mean square error (RMSE) index. The experimental results show that our model has the better accurate and reasonable performance than the traditional imputation methods
- 2 February 2021
- Published by Taylor & Francis in Transportation Letters
- Vol. 14 (4) , 407-415
ST-FVGAN: filling series traffic missing values with generative adversarial network
The imputation of time series traffic flow data is of great significance to the intelligent transportation, urban planning, and road emergency handling. This paper proposes a filling missing time series traffic data with Generative Adversarial Network (ST-FVGAN), which not only considers the spatio-temporal correlation and utilizes the idea of data generating of the Generative Adversarial Network, but also considers the external factors and introduces a more comprehensive loss function. Specifically, the model firstly constructs a Generator network which is composed of convolutional layer, residual block, and pixelshuffle block for the better potential distribution of the existing data, and then use the Discriminator network for the input judging. Experiments are conducted on the open-source TaxiBJ GPS dataset, and evaluated by the root mean square error (RMSE) index. The experimental results show that our model has the better accurate and reasonable performance than the traditional imputation methods
- 1 January 2012
- Published by Springer Nature
- p. 423-428
Design for Water-Saving Irrigation Based on Electronic Technology Sensor and Wireless Data Transmission
- 1 January 2012
- Published by Springer Nature
- p. 423-428
Design for Water-Saving Irrigation Based on Electronic Technology Sensor and Wireless Data Transmission