De Gu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
De Gu has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Jianchu Liu
Information Materials and Intelligent Sensing Laboratory of Anhui Province, Anhui University, Hefei, China
3 shared publications - Jishuai Wang
School of Biomedical Engineering (Suzhou), Division of Life Sciences and Medicine, University of Science and Technology of China, Hefei 230026, China
2 shared publications - Minghao Lv
Key Laboratory of Advanced Process Control for Light Industry (Ministry of Education), Jiangnan University, Wuxi, China
2 shared publications - Feifan Shen
NingboTech University
1 shared publication - Ji Li
Shanghai Institute of Satellite Engineering, Shanghai, China
1 shared publication - Jiaqi Zheng
School of Mechanical Engineering and Automation, College of Science & Technology Ningbo University, Ningbo 315300, China
1 shared publication
Latest Publications
- 10 September 2025
- Published by Springer Nature in Journal of Vibration Engineering & Technologies
- Vol. 13 (7) , 1-17
A Dual-Path Wavelet Dynamic Network for Intelligent Bearing Fault Diagnosis
- 10 September 2025
- Published by Springer Nature in Journal of Vibration Engineering & Technologies
- Vol. 13 (7) , 1-17
A Dual-Path Wavelet Dynamic Network for Intelligent Bearing Fault Diagnosis
- 2 November 2024
- Published by Springer Nature in Multimedia Systems
- Vol. 30 (6) , 1-14
Vicsgaze: a gaze estimation method using self-supervised contrastive learning
- 2 November 2024
- Published by Springer Nature in Multimedia Systems
- Vol. 30 (6) , 1-14
Vicsgaze: a gaze estimation method using self-supervised contrastive learning
- 26 March 2024
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (36) , 83867-83887
Highly efficient gaze estimation method using online convolutional re-parameterization
- 26 March 2024
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (36) , 83867-83887
Highly efficient gaze estimation method using online convolutional re-parameterization
- 1 September 2022
- Published by SPIE-Intl Soc Optical Eng in Optical Engineering
- Vol. 61 (09) , 093106-14
Shack–Hartmann wavefront sensor based on Kalman filter
The Shack–Hartmann wavefront sensor (SHWFS) traditionally employs the center of gravity (CoG), windowing, and thresholding CoG (TCoG) algorithms to measure wavefront aberrations. Nevertheless, these algorithms yield low accuracy in a low signal-to-noise ratio (SNR) environment, and therefore, we propose a measurement algorithm based on the Kalman filter to correct the three algorithms’ centroid position of the Shack–Hartmann spot. When the Euclidean distance between the reference centroid in a sub-aperture and the measurement centroid exceeds a certain threshold, the sub-apertures centroid position is untrusted and must be corrected. Several simulation experiments are conducted in three environments: no noise, Poisson noise, and Gaussian noise; they demonstrate that the proposed algorithm effectively improves the centroid’s accuracy by more than 10% and ensures real-time performance for the adaptive optics system. In addition, experimental results on wavefront reconstruction tasks reveal that our algorithm produces wavefronts close to the original.
- 1 September 2022
- Published by SPIE-Intl Soc Optical Eng in Optical Engineering
- Vol. 61 (09) , 093106-14
Shack–Hartmann wavefront sensor based on Kalman filter
The Shack–Hartmann wavefront sensor (SHWFS) traditionally employs the center of gravity (CoG), windowing, and thresholding CoG (TCoG) algorithms to measure wavefront aberrations. Nevertheless, these algorithms yield low accuracy in a low signal-to-noise ratio (SNR) environment, and therefore, we propose a measurement algorithm based on the Kalman filter to correct the three algorithms’ centroid position of the Shack–Hartmann spot. When the Euclidean distance between the reference centroid in a sub-aperture and the measurement centroid exceeds a certain threshold, the sub-apertures centroid position is untrusted and must be corrected. Several simulation experiments are conducted in three environments: no noise, Poisson noise, and Gaussian noise; they demonstrate that the proposed algorithm effectively improves the centroid’s accuracy by more than 10% and ensures real-time performance for the adaptive optics system. In addition, experimental results on wavefront reconstruction tasks reveal that our algorithm produces wavefronts close to the original.
- Open Access
Quality-Relevant Monitoring of Batch Processes Based on Stochastic Programming with Multiple Output Modes
To implement the quality-relevant monitoring scheme for batch processes with multiple output modes, this paper presents a novel methodology based on stochastic programming. Bringing together tools from stochastic programming and ensemble learning, the developed methodology focuses on the robust monitoring of process quality-relevant variables by taking the stochastic nature of batch process parameters explicitly into consideration. To handle the problem of missing data and lack of historical batch data, a bagging approach is introduced to generate individual quality-relevant sub-datasets, which are used to construct the corresponding monitoring sub-models. For each model, stochastic programming is used to construct an optimal quality trajectory, which is regarded as the reference for online quality monitoring. Then, for each sub-model, a corresponding control limit is obtained by computing historical residuals between the actual output and the optimal trajectory. For online monitoring, the current sample is examined by all sub-models, and whether the monitoring statistic exceeds the control limits is recorded for further analysis. The final step is ensemble learning via Bayesian fusion strategy, which is under the probabilistic framework. The implementation and effectiveness of the developed methodology are demonstrated through two case studies, including a numerical example, and a simulated fed-batch penicillin fermentation process.
Open AccessQuality-Relevant Monitoring of Batch Processes Based on Stochastic Programming with Multiple Output Modes
To implement the quality-relevant monitoring scheme for batch processes with multiple output modes, this paper presents a novel methodology based on stochastic programming. Bringing together tools from stochastic programming and ensemble learning, the developed methodology focuses on the robust monitoring of process quality-relevant variables by taking the stochastic nature of batch process parameters explicitly into consideration. To handle the problem of missing data and lack of historical batch data, a bagging approach is introduced to generate individual quality-relevant sub-datasets, which are used to construct the corresponding monitoring sub-models. For each model, stochastic programming is used to construct an optimal quality trajectory, which is regarded as the reference for online quality monitoring. Then, for each sub-model, a corresponding control limit is obtained by computing historical residuals between the actual output and the optimal trajectory. For online monitoring, the current sample is examined by all sub-models, and whether the monitoring statistic exceeds the control limits is recorded for further analysis. The final step is ensemble learning via Bayesian fusion strategy, which is under the probabilistic framework. The implementation and effectiveness of the developed methodology are demonstrated through two case studies, including a numerical example, and a simulated fed-batch penicillin fermentation process.
- Open Access
- 1 January 2015
- Published by Science Publishing Group in Automation, Control and Intelligent Systems
- Vol. 3 (6) , 112
Financial Risk Management for Designing Multi-echelon Supply Chain Networks Under Demand Uncertainty
This paper presents a methodology to include financial risk management for the design of multiproduct, multi-echelon supply chain networks under uncertainty. The method is in the framework of two-stage stochastic programming. Definitions of financial risk and downside risk are adapted. Using these definitions, financial risk management constraints are introduced and a new two-stage stochastic programming model is established. Case studies illustrate the applicability of such financial risk management. Trade-offs between expected cost and risk are also analyzed.
- 1 January 2015
- Published by Science Publishing Group in Automation, Control and Intelligent Systems
- Vol. 3 (6) , 112
Open AccessFinancial Risk Management for Designing Multi-echelon Supply Chain Networks Under Demand Uncertainty
This paper presents a methodology to include financial risk management for the design of multiproduct, multi-echelon supply chain networks under uncertainty. The method is in the framework of two-stage stochastic programming. Definitions of financial risk and downside risk are adapted. Using these definitions, financial risk management constraints are introduced and a new two-stage stochastic programming model is established. Case studies illustrate the applicability of such financial risk management. Trade-offs between expected cost and risk are also analyzed.
- Open Access
- 22 June 2014
- Published by Wiley in Abstract and Applied Analysis
- Vol. 2014, 1-11
Boundary Recognition by Simulating a Diffusion Process in Wireless Sensor Networks
Wireless sensor networks (WSN) are becoming increasingly promising in practice. As the predeployment design and optimization are usually unpractical in random deployment scenarios, the global optimum of the WSN’s performance is achievable only if the topology dependent self-organizing process acquires the overview of the WSN, in which the boundary is the most important. The idea of this paper comes from the fact that contours only break on the geometrical boundary and the WSN are discrete sampling systems of real environments. By simulating a diffusion process in discrete form, the end point of semi-contours suggests the boundary nodes of a WSN. The simulation cases show the algorithm is well worked in WSN with average degree higher than 10. The boundary recognition could be very valuable for other algorithms dedicated to optimize the overall performance of WSN.
- 22 June 2014
- Published by Wiley in Abstract and Applied Analysis
- Vol. 2014, 1-11
Open AccessBoundary Recognition by Simulating a Diffusion Process in Wireless Sensor Networks
Wireless sensor networks (WSN) are becoming increasingly promising in practice. As the predeployment design and optimization are usually unpractical in random deployment scenarios, the global optimum of the WSN’s performance is achievable only if the topology dependent self-organizing process acquires the overview of the WSN, in which the boundary is the most important. The idea of this paper comes from the fact that contours only break on the geometrical boundary and the WSN are discrete sampling systems of real environments. By simulating a diffusion process in discrete form, the end point of semi-contours suggests the boundary nodes of a WSN. The simulation cases show the algorithm is well worked in WSN with average degree higher than 10. The boundary recognition could be very valuable for other algorithms dedicated to optimize the overall performance of WSN.