Linghao Zeng
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
Linghao Zeng has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Feng Lian
School of Automation Science and Engineering, Xian Jiaotong University, Xian, China
3 shared publications - Guanghua Zhang
Faculty of Electronics and Information, Xi’an Jiaotong University, Xi’an 710000, China
3 shared publications Na Fu
State Key Laboratory of Astronautic Dynamics, Xian Satellite Control Center, Xian, China
3 shared publicationsShasha Dai
Xian Satellite Control Center, Xian, China
2 shared publicationsChongzhao Han
1 shared publication- Chongzhao Han
Ministry of Education Key Laboratory for Intelligent Networks and Network Security (MOE KLINNS), School of Electronics and Information Engineering, Xi’an Jiaotong University, Xi’an 710049, China
1 shared publication
Latest Publications
- 5 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (20) , 43422-43439
Gaussian-Kernel-Based Maximum Correntropy Kalman Filter With Adaptive Kernel Scale Selection
Dynamic systems often encounter disturbances like sensor outliers, which violate the Gaussian noise assumption in traditional Kalman filters. While maximum correntropy Kalman filters (MCKF) address this issue by utilizing higher-order statistical information, their performance critically depends on the manual selection of a kernel scale parameter. Existing methods with fixed or empirically adjusted kernel scales struggle to handle disturbances of varying intensities, limiting practical applications. This paper presents a novel adaptive Maximum Correntropy Kalman Filter (MCKF) framework. The key contributions are as follows: (1) Adaptive Kernel Scale Optimization: The kernel scale is modeled as a probabilistic variable, and variational Bayesian inference is employed to jointly estimate the system state, enabling automatic kernel scale optimization during the recursive process. (2) Theoretical Analysis and Extension: The computational complexity of the proposed algorithm is analyzed in the context of linear systems, and its theoretical connection to traditional correlation entropy filters is established. Furthermore, the method is extended to nonlinear systems. (3) Performance Enhancement: Experimental evaluations on typical single-target tracking task and complex nonlinear scenario demonstrate that the proposed approach outperforms existing methods. Under various types of noise interference, the average position estimation error is reduced by 40–60%, highlighting its superior adaptability and robustness. In addition, the algorithm is successfully applied to real-world battery State of Charge (SOC) estimation in Internet of Things (IoT) scenarios, demonstrating its practical value in embedded energy management systems.
- 5 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (20) , 43422-43439
Gaussian-Kernel-Based Maximum Correntropy Kalman Filter With Adaptive Kernel Scale Selection
Dynamic systems often encounter disturbances like sensor outliers, which violate the Gaussian noise assumption in traditional Kalman filters. While maximum correntropy Kalman filters (MCKF) address this issue by utilizing higher-order statistical information, their performance critically depends on the manual selection of a kernel scale parameter. Existing methods with fixed or empirically adjusted kernel scales struggle to handle disturbances of varying intensities, limiting practical applications. This paper presents a novel adaptive Maximum Correntropy Kalman Filter (MCKF) framework. The key contributions are as follows: (1) Adaptive Kernel Scale Optimization: The kernel scale is modeled as a probabilistic variable, and variational Bayesian inference is employed to jointly estimate the system state, enabling automatic kernel scale optimization during the recursive process. (2) Theoretical Analysis and Extension: The computational complexity of the proposed algorithm is analyzed in the context of linear systems, and its theoretical connection to traditional correlation entropy filters is established. Furthermore, the method is extended to nonlinear systems. (3) Performance Enhancement: Experimental evaluations on typical single-target tracking task and complex nonlinear scenario demonstrate that the proposed approach outperforms existing methods. Under various types of noise interference, the average position estimation error is reduced by 40–60%, highlighting its superior adaptability and robustness. In addition, the algorithm is successfully applied to real-world battery State of Charge (SOC) estimation in Internet of Things (IoT) scenarios, demonstrating its practical value in embedded energy management systems.
- Open Access
- 28 November 2023
- Published by MDPI AG in Remote Sensing
- Vol. 15 (23) , 5543
Filtering in Triplet Markov Chain Model in the Presence of Non-Gaussian Noise with Application to Target Tracking
In hidden Markov chain (HMC) models, widely used for target tracking, the process noise and measurement noise are in general assumed to be independent and Gaussian for mathematical simplicity. However, the independence and Gaussian assumptions do not always hold in practice. For instance, in a typical radar tracking application, the measurement noise is correlated over time as the sampling frequency of a radar is generally much higher than the bandwidth of the measurement noise. In addition, target maneuvers and measurement outliers imply that the process noise and measurement noise are non-Gaussian. To solve this problem, we resort to triplet Markov chain (TMC) models to describe stochastic systems with correlated noise and derive a new filter under the maximum correntropy criterion to deal with non-Gaussian noise. By stacking the state vector, measurement vector, and auxiliary vector into a triplet state vector, the TMC model can capture the complete dynamics of stochastic systems, which may be subjected to potential parameter uncertainty, non-stationarity, or error sources. Correntropy is used to measure the similarity of two random variables; unlike the commonly used minimum mean square error criterion, which uses only second-order statistics, correntropy uses second-order and higher-order information, and is more suitable for systems in the presence of non-Gaussian noise, particularly some heavy-tailed noise disturbances. Furthermore, to reduce the influence of round-off errors, a square-root implementation of the new filter is provided using QR decomposition. Instead of the full covariance matrices, corresponding Cholesky factors are recursively calculated in the square-root filtering algorithm. This is more numerically stable for ill-conditioned problems compared to the conventional filter. Finally, the effectiveness of the proposed algorithms is illustrated via three numerical examples.
- 28 November 2023
- Published by MDPI AG in Remote Sensing
- Vol. 15 (23) , 5543
Open AccessFiltering in Triplet Markov Chain Model in the Presence of Non-Gaussian Noise with Application to Target Tracking
In hidden Markov chain (HMC) models, widely used for target tracking, the process noise and measurement noise are in general assumed to be independent and Gaussian for mathematical simplicity. However, the independence and Gaussian assumptions do not always hold in practice. For instance, in a typical radar tracking application, the measurement noise is correlated over time as the sampling frequency of a radar is generally much higher than the bandwidth of the measurement noise. In addition, target maneuvers and measurement outliers imply that the process noise and measurement noise are non-Gaussian. To solve this problem, we resort to triplet Markov chain (TMC) models to describe stochastic systems with correlated noise and derive a new filter under the maximum correntropy criterion to deal with non-Gaussian noise. By stacking the state vector, measurement vector, and auxiliary vector into a triplet state vector, the TMC model can capture the complete dynamics of stochastic systems, which may be subjected to potential parameter uncertainty, non-stationarity, or error sources. Correntropy is used to measure the similarity of two random variables; unlike the commonly used minimum mean square error criterion, which uses only second-order statistics, correntropy uses second-order and higher-order information, and is more suitable for systems in the presence of non-Gaussian noise, particularly some heavy-tailed noise disturbances. Furthermore, to reduce the influence of round-off errors, a square-root implementation of the new filter is provided using QR decomposition. Instead of the full covariance matrices, corresponding Cholesky factors are recursively calculated in the square-root filtering algorithm. This is more numerically stable for ill-conditioned problems compared to the conventional filter. Finally, the effectiveness of the proposed algorithms is illustrated via three numerical examples.
- Open Access
- 28 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 115120-115130
Gaussian-Beta Filters With Unknown Probability of Measurement Loss
Data loss is ubiquitous in practical engineering applications due to communication delay or congestion. Data loss rate is a key metric to evaluate the reliability of state estimation. To jointly estimate system state and data loss rate, we propose a class of Gaussian-Beta filters for linear and moderate nonlinear Gaussian state-space models with unknown probability of measurement loss. In the filters, the arrival of the measurement at each time is formulated as a binary random variable, which is determined by the classical threshold technology. In addition, the hidden state and the unknown probability of measurement loss are modeled as a product of Gaussian and Beta distributions, and the form remains unchanged through recursive operations. Simulation results verify the effectiveness of the proposed Gaussian-Beta filters compared with the existing filtering algorithms.
- 28 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 115120-115130
Open AccessGaussian-Beta Filters With Unknown Probability of Measurement Loss
Data loss is ubiquitous in practical engineering applications due to communication delay or congestion. Data loss rate is a key metric to evaluate the reliability of state estimation. To jointly estimate system state and data loss rate, we propose a class of Gaussian-Beta filters for linear and moderate nonlinear Gaussian state-space models with unknown probability of measurement loss. In the filters, the arrival of the measurement at each time is formulated as a binary random variable, which is determined by the classical threshold technology. In addition, the hidden state and the unknown probability of measurement loss are modeled as a product of Gaussian and Beta distributions, and the form remains unchanged through recursive operations. Simulation results verify the effectiveness of the proposed Gaussian-Beta filters compared with the existing filtering algorithms.
- Open Access
- 5 September 2022
- Published by Frontiers Media SA in Frontiers in Energy Research
- Vol. 10
State estimation for dynamic systems with higher-order autoregressive moving average non-Gaussian noise
The classical Kalman filter is a very important state estimation approach, which has been widely used in many engineering applications. The Kalman filter is optimal for linear dynamic systems with independent Gaussian noises. However, the independence and Gaussian assumptions may not be satisfied in practice. On the one hand, modeling physical systems usually results in discrete-time state-space models with correlated process and measurement noises. On the other hand, the noise is non-Gaussian when the system is disturbed by heavy-tailed noise. In this case, the performance of the Kalman filter will deteriorate, or even diverge. This paper is devoted to addressing the state estimation problem of linear dynamic systems with high-order autoregressive moving average (ARMA) non-Gaussian noise. First, a triplet Markov model is introduced to model the system with high-order ARMA noise, since this model relaxes the independence assumption of the hidden Markov model. Then, a new filter is derived based on correntropy, instead of the commonly used minimum mean square error (MMSE), to deal with non-Gaussian noise. Unlike the MMSE, which uses only second-order statistics of error, correntropy can capture second-order and higher-order statistics. Finally, simulation results verify the effectiveness of the proposed algorithm.
- 5 September 2022
- Published by Frontiers Media SA in Frontiers in Energy Research
- Vol. 10
Open AccessState estimation for dynamic systems with higher-order autoregressive moving average non-Gaussian noise
The classical Kalman filter is a very important state estimation approach, which has been widely used in many engineering applications. The Kalman filter is optimal for linear dynamic systems with independent Gaussian noises. However, the independence and Gaussian assumptions may not be satisfied in practice. On the one hand, modeling physical systems usually results in discrete-time state-space models with correlated process and measurement noises. On the other hand, the noise is non-Gaussian when the system is disturbed by heavy-tailed noise. In this case, the performance of the Kalman filter will deteriorate, or even diverge. This paper is devoted to addressing the state estimation problem of linear dynamic systems with high-order autoregressive moving average (ARMA) non-Gaussian noise. First, a triplet Markov model is introduced to model the system with high-order ARMA noise, since this model relaxes the independence assumption of the hidden Markov model. Then, a new filter is derived based on correntropy, instead of the commonly used minimum mean square error (MMSE), to deal with non-Gaussian noise. Unlike the MMSE, which uses only second-order statistics of error, correntropy can capture second-order and higher-order statistics. Finally, simulation results verify the effectiveness of the proposed algorithm.
- Open Access
A Priori-Based Subarray Selection Algorithm for DOA Estimation
A finer direction-of-arrival (DOA) estimation result needs a large and dense array; it may, however, encounter the mutual coupling effect, which degrades the performance of DOA estimation. There is a new approach to mitigating this effect by using a nonuniform array to achieve DOA estimation. In this paper, we consider a priori DOA estimation, which is easily obtained from tracking results. The a priori DOA requires us to pay close attention to the high possibility of where the DOA will appear; then, a weight according to the prior probability distribution of DOA is added to each direction, which leads the sensing matrix of DOA estimation to be near low-rank. Thus, according to the low-rank matrix approximation theory, an optimal low-rank approximate matrix is obtained and an algorithm is proposed to select the elements of the original array according to right singular vectors of the approximate matrix. After that, the impacts of different weights are analyzed, and a mixed weight is presented which has flexibility for common use. Finally, a number of numerical simulations are carried out, and the results verify the effectiveness of the proposed methods.
Open AccessA Priori-Based Subarray Selection Algorithm for DOA Estimation
A finer direction-of-arrival (DOA) estimation result needs a large and dense array; it may, however, encounter the mutual coupling effect, which degrades the performance of DOA estimation. There is a new approach to mitigating this effect by using a nonuniform array to achieve DOA estimation. In this paper, we consider a priori DOA estimation, which is easily obtained from tracking results. The a priori DOA requires us to pay close attention to the high possibility of where the DOA will appear; then, a weight according to the prior probability distribution of DOA is added to each direction, which leads the sensing matrix of DOA estimation to be near low-rank. Thus, according to the low-rank matrix approximation theory, an optimal low-rank approximate matrix is obtained and an algorithm is proposed to select the elements of the original array according to right singular vectors of the approximate matrix. After that, the impacts of different weights are analyzed, and a mixed weight is presented which has flexibility for common use. Finally, a number of numerical simulations are carried out, and the results verify the effectiveness of the proposed methods.