Ruohai Di
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ruohai Di has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Peng Wang
Institute for Interdisciplinary and Innovation Research, Xi'an Technological University, Xi'an 710021, China
3 shared publications - Chuchao He
School of Electronic Information Engineering Xi'an Technological University Xi'an China
2 shared publications - Xiaoyan Li
School of Electronics and Information Engineering, Xi’an Technological University
2 shared publications - Zhigang Lv
School of Electronic Information Engineering, Xi'an Technological University, Xi'an 710021, China
2 shared publications - Chu Wang
School of Electronic Information Engineering, Xi'an Technological University, Xi'an 710021, China
1 shared publication - Hanxiao Feng
School of Electronic Information Engineering, Xi’an Technological University, Xi’an 710021, China
1 shared publication
Latest Publications
- 17 March 2026
- Published by Elsevier in ISA Transactions
- Vol. 175, 42-57
Recoverable fault behavior oriented diagnostic-prognostic hybrid framework for proton exchange membrane fuel cells
- 17 March 2026
- Published by Elsevier in ISA Transactions
- Vol. 175, 42-57
Recoverable fault behavior oriented diagnostic-prognostic hybrid framework for proton exchange membrane fuel cells
- Open Access
MFE-YOLO: A Multi-Scale Feature Enhanced Network for PCB Defect Detection with Cross-Group Attention and FIoU Loss
The detection of defects in Printed Circuit Boards (PCBs) is a critical yet challenging task in industrial quality control, characterized by the prevalence of small targets and complex backgrounds. While deep learning models like YOLOv5 have shown promise, they often lack the ability to quantify predictive uncertainty, leading to overconfident errors in challenging scenarios—a major source of false alarms and reduced reliability in automated manufacturing inspection lines. From a Bayesian perspective, this overconfidence signifies a failure in probabilistic calibration, which is crucial for trustworthy automated inspection. To address this, we propose MFE-YOLO, a Bayesian-enhanced detection framework built upon YOLOv5 that systematically integrates uncertainty-aware mechanisms to improve both accuracy and operational reliability in real-world settings. First, we construct a multi-background PCB defect dataset with diverse substrate colors and shapes, enhancing the model’s ability to generalize beyond the single-background bias of existing data. Second, we integrate the Convolutional Block Attention Module (CBAM), reinterpreted through a Bayesian lens as a feature-wise uncertainty weighting mechanism, to suppress background interference and amplify salient defect features. Third, we propose a novel FIoU loss function, redesigned within a probabilistic framework to improve bounding box regression accuracy and implicitly capture localization uncertainty, particularly for small defects. Extensive experiments demonstrate that MFE-YOLO achieves state-of-the-art performance, with mAP@0.5 and mAP@0.5:0.95 values of 93.9% and 59.6%, respectively, outperforming existing detectors, including YOLOv8 and EfficientDet. More importantly, the proposed framework yields better-calibrated confidence scores, significantly reducing false alarms and enabling more reliable human-in-the-loop verification. This work provides a deployable, uncertainty-aware solution for high-throughput PCB inspection, advancing toward trustworthy and efficient quality control in modern manufacturing environments.
Open AccessMFE-YOLO: A Multi-Scale Feature Enhanced Network for PCB Defect Detection with Cross-Group Attention and FIoU Loss
The detection of defects in Printed Circuit Boards (PCBs) is a critical yet challenging task in industrial quality control, characterized by the prevalence of small targets and complex backgrounds. While deep learning models like YOLOv5 have shown promise, they often lack the ability to quantify predictive uncertainty, leading to overconfident errors in challenging scenarios—a major source of false alarms and reduced reliability in automated manufacturing inspection lines. From a Bayesian perspective, this overconfidence signifies a failure in probabilistic calibration, which is crucial for trustworthy automated inspection. To address this, we propose MFE-YOLO, a Bayesian-enhanced detection framework built upon YOLOv5 that systematically integrates uncertainty-aware mechanisms to improve both accuracy and operational reliability in real-world settings. First, we construct a multi-background PCB defect dataset with diverse substrate colors and shapes, enhancing the model’s ability to generalize beyond the single-background bias of existing data. Second, we integrate the Convolutional Block Attention Module (CBAM), reinterpreted through a Bayesian lens as a feature-wise uncertainty weighting mechanism, to suppress background interference and amplify salient defect features. Third, we propose a novel FIoU loss function, redesigned within a probabilistic framework to improve bounding box regression accuracy and implicitly capture localization uncertainty, particularly for small defects. Extensive experiments demonstrate that MFE-YOLO achieves state-of-the-art performance, with mAP@0.5 and mAP@0.5:0.95 values of 93.9% and 59.6%, respectively, outperforming existing detectors, including YOLOv8 and EfficientDet. More importantly, the proposed framework yields better-calibrated confidence scores, significantly reducing false alarms and enabling more reliable human-in-the-loop verification. This work provides a deployable, uncertainty-aware solution for high-throughput PCB inspection, advancing toward trustworthy and efficient quality control in modern manufacturing environments.
- Open Access
MonoDFNet: Monocular 3D Object Detection with Depth Fusion and Adaptive Optimization
Monocular 3D object detection refers to detecting 3D objects using a single camera. This approach offers low sensor costs, high resolution, and rich texture information, making it widely adopted. However, monocular sensors face challenges from environmental factors like occlusion and truncation, leading to reduced detection accuracy. Additionally, the lack of depth information poses significant challenges for predicting 3D positions. To address these issues, this paper presents a monocular 3D object detection method based on improvements to MonoCD, designed to enhance detection accuracy and robustness in complex environments. In order to effectively obtain and integrate depth information, this paper designs a multi-branch depth prediction with weight sharing module. Furthermore, an adaptive focus mechanism is proposed to emphasize target regions while minimizing interference from irrelevant areas. The experimental results demonstrate that MonoDFNet achieves significant improvements over existing methods, with AP3D gains of +4.09% (Easy), +2.78% (Moderate), and +1.63% (Hard), confirming its effectiveness in 3D object detection.
Open AccessMonoDFNet: Monocular 3D Object Detection with Depth Fusion and Adaptive Optimization
Monocular 3D object detection refers to detecting 3D objects using a single camera. This approach offers low sensor costs, high resolution, and rich texture information, making it widely adopted. However, monocular sensors face challenges from environmental factors like occlusion and truncation, leading to reduced detection accuracy. Additionally, the lack of depth information poses significant challenges for predicting 3D positions. To address these issues, this paper presents a monocular 3D object detection method based on improvements to MonoCD, designed to enhance detection accuracy and robustness in complex environments. In order to effectively obtain and integrate depth information, this paper designs a multi-branch depth prediction with weight sharing module. Furthermore, an adaptive focus mechanism is proposed to emphasize target regions while minimizing interference from irrelevant areas. The experimental results demonstrate that MonoDFNet achieves significant improvements over existing methods, with AP3D gains of +4.09% (Easy), +2.78% (Moderate), and +1.63% (Hard), confirming its effectiveness in 3D object detection.
- Open Access
- 30 July 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (15) , 3344
Bayesian Network Structure Learning Using Improved A* with Constraints from Potential Optimal Parent Sets
Learning the structure of a Bayesian network and considering the efficiency and accuracy of learning has always been a hot topic for researchers. This paper proposes two constraints to solve the problem that the A* algorithm, an exact learning algorithm, is not efficient enough to search larger networks. On the one hand, the parent–child set constraints reduce the number of potential optimal parent sets. On the other hand, the path constraints are obtained from the potential optimal parent sets to constrain the search process of the A* algorithm. Both constraints are proposed based on the potential optimal parent sets. Experiments show that the time efficiency of the A* algorithm can be significantly improved, and the ability of the A* algorithm to search larger Bayesian networks can be improved by the two constraints. In addition, compared with the globally optimal Bayesian network learning using integer linear programming (GOBNILP) algorithm and the max–min hill-climbing (MMHC) algorithm, which are state of the art, the A* algorithm enhanced by constraints still performs well in most cases.
- 30 July 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (15) , 3344
Open AccessBayesian Network Structure Learning Using Improved A* with Constraints from Potential Optimal Parent Sets
Learning the structure of a Bayesian network and considering the efficiency and accuracy of learning has always been a hot topic for researchers. This paper proposes two constraints to solve the problem that the A* algorithm, an exact learning algorithm, is not efficient enough to search larger networks. On the one hand, the parent–child set constraints reduce the number of potential optimal parent sets. On the other hand, the path constraints are obtained from the potential optimal parent sets to constrain the search process of the A* algorithm. Both constraints are proposed based on the potential optimal parent sets. Experiments show that the time efficiency of the A* algorithm can be significantly improved, and the ability of the A* algorithm to search larger Bayesian networks can be improved by the two constraints. In addition, compared with the globally optimal Bayesian network learning using integer linear programming (GOBNILP) algorithm and the max–min hill-climbing (MMHC) algorithm, which are state of the art, the A* algorithm enhanced by constraints still performs well in most cases.
- Open Access
Constrained Adjusted Maximum a Posteriori Estimation of Bayesian Network Parameters
Maximum a posteriori estimation (MAP) with Dirichlet prior has been shown to be effective in improving the parameter learning of Bayesian networks when the available data are insufficient. Given no extra domain knowledge, uniform prior is often considered for regularization. However, when the underlying parameter distribution is non-uniform or skewed, uniform prior does not work well, and a more informative prior is required. In reality, unless the domain experts are extremely unfamiliar with the network, they would be able to provide some reliable knowledge on the studied network. With that knowledge, we can automatically refine informative priors and select reasonable equivalent sample size (ESS). In this paper, considering the parameter constraints that are transformed from the domain knowledge, we propose a Constrained adjusted Maximum a Posteriori (CaMAP) estimation method, which is featured by two novel techniques. First, to draw an informative prior distribution (or prior shape), we present a novel sampling method that can construct the prior distribution from the constraints. Then, to find the optimal ESS (or prior strength), we derive constraints on the ESS from the parameter constraints and select the optimal ESS by cross-validation. Numerical experiments show that the proposed method is superior to other learning algorithms.
Open AccessConstrained Adjusted Maximum a Posteriori Estimation of Bayesian Network Parameters
Maximum a posteriori estimation (MAP) with Dirichlet prior has been shown to be effective in improving the parameter learning of Bayesian networks when the available data are insufficient. Given no extra domain knowledge, uniform prior is often considered for regularization. However, when the underlying parameter distribution is non-uniform or skewed, uniform prior does not work well, and a more informative prior is required. In reality, unless the domain experts are extremely unfamiliar with the network, they would be able to provide some reliable knowledge on the studied network. With that knowledge, we can automatically refine informative priors and select reasonable equivalent sample size (ESS). In this paper, considering the parameter constraints that are transformed from the domain knowledge, we propose a Constrained adjusted Maximum a Posteriori (CaMAP) estimation method, which is featured by two novel techniques. First, to draw an informative prior distribution (or prior shape), we present a novel sampling method that can construct the prior distribution from the constraints. Then, to find the optimal ESS (or prior strength), we derive constraints on the ESS from the parameter constraints and select the optimal ESS by cross-validation. Numerical experiments show that the proposed method is superior to other learning algorithms.