Liyi Zhang
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
Research Subjects
Research Interests
Liyi Zhang has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Yunshan Sun
School of Information Engineering, Tianjin University of Commerce, Tianjin 300134, China
9 shared publications Ting Liu
7 shared publications- Yong Zhang
School of Information Engineering, Tianjin University of Commerce, Tianjin, China
4 shared publications Lei Chen
3 shared publicationsTeng Fei
3 shared publicationsBan Zhe
School of Information Engineering, Tianjin University of Commerce, Tianjin, China
2 shared publications
Latest Publications
- Open Access
- 1 November 2023
- Published by Angle Publishing Co., Ltd. in 網際網路技術學刊
- Vol. 24 (6) , 1249-1262
Improved Bat Algorithm Based on Fast Diving Strategy
Bat algorithm has good global search ability, but it has some problems, such as slow convergence speed in local search stage, low convergence accuracy, easy to fall into local optimization and can not escape. In view of the above defects, inspired by Harris Hawks’s strategy of catching rabbits, this paper introduces the surrounding mechanism of prey, which can quickly approach the food and judge its quality, so as to achieve the purpose of rapid convergence and improve the convergence accuracy. The experiment shows that the improved algorithm of the fast diving strategy is tested by using the test function, and compared with the basic bat algorithm, backtracking bat algorithm and HABC. The improved bat algorithm of the fast diving strategy has better optimization accuracy, faster convergence speed, simple algorithm and higher success rate.
- 1 November 2023
- Published by Angle Publishing Co., Ltd. in 網際網路技術學刊
- Vol. 24 (6) , 1249-1262
Open AccessImproved Bat Algorithm Based on Fast Diving Strategy
Bat algorithm has good global search ability, but it has some problems, such as slow convergence speed in local search stage, low convergence accuracy, easy to fall into local optimization and can not escape. In view of the above defects, inspired by Harris Hawks’s strategy of catching rabbits, this paper introduces the surrounding mechanism of prey, which can quickly approach the food and judge its quality, so as to achieve the purpose of rapid convergence and improve the convergence accuracy. The experiment shows that the improved algorithm of the fast diving strategy is tested by using the test function, and compared with the basic bat algorithm, backtracking bat algorithm and HABC. The improved bat algorithm of the fast diving strategy has better optimization accuracy, faster convergence speed, simple algorithm and higher success rate.
- Open Access
- 29 July 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (15) , 3335
A Wireless Channel Equalization Method Based on Hybrid Whale Optimization: For Constant Modulus Blind Equalization System
This paper proposes a wireless channel equalization method applied to the constant modulus blind equalization system, which addresses the slow convergence and strong randomness in the initialization of equalizer weights in the constant modulus blind equalization algorithm (CMA) by introducing a hybrid arithmetic whale optimization algorithm (HAWOA). The mean square error in the CMA is utilized as the cost function for the HAWOA to obtain a more effective initial weights for the equalizer. To validate the superiority of the hybrid arithmetic whale constant modulus blind equalization algorithm, tests are conducted on the equalization system using 16QAM and 64QAM signals. The simulation results demonstrate that the proposed algorithm achieved better initial weights compared to the CMA and the constant modulus blind equalization algorithm based on the whale optimization algorithm. It can obtain the desired mean square error with a lower symbol error rate in fewer iterations. Furthermore, the hybrid arithmetic whale constant modulus blind equalization algorithm exhibited faster convergence in optimizing initial weights, effectively enhancing the equalization performance of the CMA in wireless channels while ensuring timeliness.
- 29 July 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (15) , 3335
Open AccessA Wireless Channel Equalization Method Based on Hybrid Whale Optimization: For Constant Modulus Blind Equalization System
This paper proposes a wireless channel equalization method applied to the constant modulus blind equalization system, which addresses the slow convergence and strong randomness in the initialization of equalizer weights in the constant modulus blind equalization algorithm (CMA) by introducing a hybrid arithmetic whale optimization algorithm (HAWOA). The mean square error in the CMA is utilized as the cost function for the HAWOA to obtain a more effective initial weights for the equalizer. To validate the superiority of the hybrid arithmetic whale constant modulus blind equalization algorithm, tests are conducted on the equalization system using 16QAM and 64QAM signals. The simulation results demonstrate that the proposed algorithm achieved better initial weights compared to the CMA and the constant modulus blind equalization algorithm based on the whale optimization algorithm. It can obtain the desired mean square error with a lower symbol error rate in fewer iterations. Furthermore, the hybrid arithmetic whale constant modulus blind equalization algorithm exhibited faster convergence in optimizing initial weights, effectively enhancing the equalization performance of the CMA in wireless channels while ensuring timeliness.
- 1 October 2022
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 56 (5) , 438-446
Adaptive Bat Algorithm Based on Historical Population Control
Bat algorithm, as a new type of swarm intelligence algorithm, has excellent optimization ability and wide application space, as well as the convergence spe
- 1 October 2022
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 56 (5) , 438-446
Adaptive Bat Algorithm Based on Historical Population Control
Bat algorithm, as a new type of swarm intelligence algorithm, has excellent optimization ability and wide application space, as well as the convergence spe
- Open Access
- 16 August 2019
- Published by MDPI AG in Algorithms
- Vol. 12 (8) , 174
A Novel Blind Restoration and Reconstruction Approach for CT Images Based on Sparse Representation and Hierarchical Bayesian-MAP
Computed tomography (CT) image reconstruction and restoration are very important in medical image processing, and are associated together to be an inverse problem. Image iterative reconstruction is a key tool to increase the applicability of CT imaging and reduce radiation dose. Nevertheless, traditional image iterative reconstruction methods are limited by the sampling theorem and also the blurring of projection data will propagate unhampered artifact in the reconstructed image. To overcome these problems, image restoration techniques should be developed to accurately correct a wide variety of image degrading effects in order to effectively improve image reconstruction. In this paper, a blind image restoration technique is embedded in the compressive sensing CT image reconstruction, which can result in a high-quality reconstruction image using fewer projection data. Because a small amount of data can be obtained by radiation in a shorter time, high-quality image reconstruction with less data is equivalent to reducing radiation dose. Technically, both the blurring process and the sparse representation of the sharp CT image are first modeled as a serial of parameters. The sharp CT image will be obtained from the estimated sparse representation. Then, the model parameters are estimated by a hierarchical Bayesian maximum posteriori formulation. Finally, the estimated model parameters are optimized to obtain the final image reconstruction. We demonstrate the effectiveness of the proposed method with the simulation experiments in terms of the peak signal to noise ratio (PSNR), and structural similarity index (SSIM).
- 16 August 2019
- Published by MDPI AG in Algorithms
- Vol. 12 (8) , 174
Open AccessA Novel Blind Restoration and Reconstruction Approach for CT Images Based on Sparse Representation and Hierarchical Bayesian-MAP
Computed tomography (CT) image reconstruction and restoration are very important in medical image processing, and are associated together to be an inverse problem. Image iterative reconstruction is a key tool to increase the applicability of CT imaging and reduce radiation dose. Nevertheless, traditional image iterative reconstruction methods are limited by the sampling theorem and also the blurring of projection data will propagate unhampered artifact in the reconstructed image. To overcome these problems, image restoration techniques should be developed to accurately correct a wide variety of image degrading effects in order to effectively improve image reconstruction. In this paper, a blind image restoration technique is embedded in the compressive sensing CT image reconstruction, which can result in a high-quality reconstruction image using fewer projection data. Because a small amount of data can be obtained by radiation in a shorter time, high-quality image reconstruction with less data is equivalent to reducing radiation dose. Technically, both the blurring process and the sparse representation of the sharp CT image are first modeled as a serial of parameters. The sharp CT image will be obtained from the estimated sparse representation. Then, the model parameters are estimated by a hierarchical Bayesian maximum posteriori formulation. Finally, the estimated model parameters are optimized to obtain the final image reconstruction. We demonstrate the effectiveness of the proposed method with the simulation experiments in terms of the peak signal to noise ratio (PSNR), and structural similarity index (SSIM).
- Open Access
- 31 July 2019
- Published by MDPI AG in Algorithms
- Vol. 12 (8) , 155
A Rigid Motion Artifact Reduction Method for CT Based on Blind Deconvolution
In computed tomography (CT), artifacts due to patient rigid motion often significantly degrade image quality. This paper suggests a method based on iterative blind deconvolution to eliminate motion artifacts. The proposed method alternately reconstructs the image and reduces motion artifacts in an iterative scheme until the difference measure between two successive iterations is smaller than a threshold. In this iterative process, Richardson–Lucy (RL) deconvolution with spatially adaptive total variation (SATV) regularization is inserted into the iterative process of the ordered subsets expectation maximization (OSEM) reconstruction algorithm. The proposed method is evaluated on a numerical phantom, a head phantom, and patient scan. The reconstructed images indicate that the proposed method can reduce motion artifacts and provide high-quality images. Quantitative evaluations also show the proposed method yielded an appreciable improvement on all metrics, reducing root-mean-square error (RMSE) by about 30% and increasing Pearson correlation coefficient (CC) and mean structural similarity (MSSIM) by about 15% and 20%, respectively, compared to the RL-OSEM method. Furthermore, the proposed method only needs measured raw data and no additional measurements are needed. Compared with the previous work, it can be applied to any scanning mode and can realize six degrees of freedom motion artifact reduction, so the artifact reduction effect is better in clinical experiments.
- 31 July 2019
- Published by MDPI AG in Algorithms
- Vol. 12 (8) , 155
Open AccessA Rigid Motion Artifact Reduction Method for CT Based on Blind Deconvolution
In computed tomography (CT), artifacts due to patient rigid motion often significantly degrade image quality. This paper suggests a method based on iterative blind deconvolution to eliminate motion artifacts. The proposed method alternately reconstructs the image and reduces motion artifacts in an iterative scheme until the difference measure between two successive iterations is smaller than a threshold. In this iterative process, Richardson–Lucy (RL) deconvolution with spatially adaptive total variation (SATV) regularization is inserted into the iterative process of the ordered subsets expectation maximization (OSEM) reconstruction algorithm. The proposed method is evaluated on a numerical phantom, a head phantom, and patient scan. The reconstructed images indicate that the proposed method can reduce motion artifacts and provide high-quality images. Quantitative evaluations also show the proposed method yielded an appreciable improvement on all metrics, reducing root-mean-square error (RMSE) by about 30% and increasing Pearson correlation coefficient (CC) and mean structural similarity (MSSIM) by about 15% and 20%, respectively, compared to the RL-OSEM method. Furthermore, the proposed method only needs measured raw data and no additional measurements are needed. Compared with the previous work, it can be applied to any scanning mode and can realize six degrees of freedom motion artifact reduction, so the artifact reduction effect is better in clinical experiments.
- Open Access
Applications of a Strong Track Filter and LDA for On-Line Identification of a Switched Reluctance Machine Stator Inter-Turn Shorted-Circuit Fault
Reliability is pivotal significance for switched reluctance machine drives (SRD) applied to safety essential transportation and industrial fields. An inter-turn shorted-circuit fault (ISCF) could incite the machine to operate in unbalanced status, resulting in the noise increases. In the event such a fault remains untreated, the fault will further destroy the rest of the normal phases, even leading to a tragic incident for the entire drive application. To improve the reliability of SRD, an efficient on-line fault diagnosis method for ISCF should be proposed. This paper is focused on employing the strong track filter (STF) to achieve real-time phase resistance differences between before and after ISCF, which are used as features to diagnose the fault occurrence and the fault phase. Furthermore, a classification namely as linear discriminant analysis (LDA) is selected to estimate fault severity. Finally, simulation and experiments correspond to various running statuses are executed and their results can verify that the diagnosis method has accuracy and robustness.
Open AccessApplications of a Strong Track Filter and LDA for On-Line Identification of a Switched Reluctance Machine Stator Inter-Turn Shorted-Circuit Fault
Reliability is pivotal significance for switched reluctance machine drives (SRD) applied to safety essential transportation and industrial fields. An inter-turn shorted-circuit fault (ISCF) could incite the machine to operate in unbalanced status, resulting in the noise increases. In the event such a fault remains untreated, the fault will further destroy the rest of the normal phases, even leading to a tragic incident for the entire drive application. To improve the reliability of SRD, an efficient on-line fault diagnosis method for ISCF should be proposed. This paper is focused on employing the strong track filter (STF) to achieve real-time phase resistance differences between before and after ISCF, which are used as features to diagnose the fault occurrence and the fault phase. Furthermore, a classification namely as linear discriminant analysis (LDA) is selected to estimate fault severity. Finally, simulation and experiments correspond to various running statuses are executed and their results can verify that the diagnosis method has accuracy and robustness.
- 22 January 2018
- Published by Springer Nature in Cluster Computing
- Vol. 22 (S1) , 895-903
A new DOA estimation algorithm based on compressed sensing
- 22 January 2018
- Published by Springer Nature in Cluster Computing
- Vol. 22 (S1) , 895-903
A new DOA estimation algorithm based on compressed sensing
- 21 November 2017
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 10 (5) , 1703-1712
An indoor gas leakage source localization algorithm using distributed maximum likelihood estimation in sensor networks
- 21 November 2017
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 10 (5) , 1703-1712
An indoor gas leakage source localization algorithm using distributed maximum likelihood estimation in sensor networks
- 24 May 2017
- Published by Springer Nature in Cluster Computing
- Vol. 20 (4) , 2905-2917
Distributed Gaussian mixture model-based particle filter method for chemical pollution source localization with sensor network
- 24 May 2017
- Published by Springer Nature in Cluster Computing
- Vol. 20 (4) , 2905-2917
Distributed Gaussian mixture model-based particle filter method for chemical pollution source localization with sensor network
- 6 May 2017
- Published by SAGE Publications in Journal of X-Ray Science and Technology
- Vol. 25 (5) , 721-736
Rigid motion artifact reduction in CT using frequency domain analysis
BACKGROUND: It is often unrealistic to assume that the subject remains stationary during a computed tomography (CT) imaging scan. A patient rigid motion can be decomposed into a translation and a rotation around an origin. How to minimize the motion impact on image quality is important. OBJECTIVE: To eliminate artifacts caused by patient rigid motion during a CT scan, this study investigated a new method based on frequency domain analysis to estimate and compensate motion impact. METHODS: Motion parameters was first determined by the magnitude correlation of projections in frequency domain. Then, the estimated parameters were applied to compensate for the motion effects in the reconstruction process. Finally, this method was extended to helical CT. RESULTS: In fan-beam CT experiments, the simulation results showed that the proposed method was more accurate and faster on the performance of motion estimation than using Helgason-Ludwig consistency condition method (HLCC). Furthermore, the reconstructed images on both simulated and human head experiments indicated that the proposed method yielded superior results in artifact reduction. CONCLUSIONS: The proposed method is a new tool for patient motion compensation, with a potential for practical application. It is not only applicable to motion correction in fan-beam CT imaging, but also to helical CT.
- 6 May 2017
- Published by SAGE Publications in Journal of X-Ray Science and Technology
- Vol. 25 (5) , 721-736
Rigid motion artifact reduction in CT using frequency domain analysis
BACKGROUND: It is often unrealistic to assume that the subject remains stationary during a computed tomography (CT) imaging scan. A patient rigid motion can be decomposed into a translation and a rotation around an origin. How to minimize the motion impact on image quality is important. OBJECTIVE: To eliminate artifacts caused by patient rigid motion during a CT scan, this study investigated a new method based on frequency domain analysis to estimate and compensate motion impact. METHODS: Motion parameters was first determined by the magnitude correlation of projections in frequency domain. Then, the estimated parameters were applied to compensate for the motion effects in the reconstruction process. Finally, this method was extended to helical CT. RESULTS: In fan-beam CT experiments, the simulation results showed that the proposed method was more accurate and faster on the performance of motion estimation than using Helgason-Ludwig consistency condition method (HLCC). Furthermore, the reconstructed images on both simulated and human head experiments indicated that the proposed method yielded superior results in artifact reduction. CONCLUSIONS: The proposed method is a new tool for patient motion compensation, with a potential for practical application. It is not only applicable to motion correction in fan-beam CT imaging, but also to helical CT.