Huanyu Zhao
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
Huanyu Zhao has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Chaoyi Pang
School of Computer Science and Data Engineering, NingboTech University, Ningbo, China
4 shared publications - Tongliang Li
Institute of Biology, Hebei Academy of Sciences, Shijiazhuang, Hebei 050011, China
3 shared publications - Jian Yang
The School of Computer Science and Technology, Donghua University, Shanghai, China
2 shared publications Tongliang Li
Institute of Applied Mathematics Hebei Academy of Sciences 050081 Shijiazhuang Hebei Province P. R. China
2 shared publications- Bo Wang
Harbin Institute of Technology
1 shared publication Chaoyi Pang
Zhejiang University (NIT)
1 shared publication
Latest Publications
- Open Access
- 1 September 2024
- Published by China Science Publishing & Media Ltd. in JOURNAL OF SHENZHEN UNIVERSITY SCIENCE AND ENGINEERING
- Vol. 41 (5) , 574-582
An optimal L∞-PLA algorithm for trajectory data compression
With the application and development of global positioning system, huge amounts of real-time trajectory data are collected, which gives a challenge for data transmission, storage and analysis. To attack this issue, data compression technology based on piecewise linear approximation (PLA), which is simple and intuitive, less compression storage and faster data transmission, has been widely researched. Currently, the optimal online PLA algorithm can not effectively compress multi-dimensional trajectory data. This paper presented a novel multi-dimensional compression problem under maximum error bound (mDisPLA∞), and proposed an optimal online PLA algorithm MDisPLA to solve it. MDisPLA used a divide-and-conquer strategy to extend the one-dimensional optimal PLA algorithm for optimizing compression of multi-dimensional trajectory data. It can generate the minimum number of disconnected straight lines in linear time complexity, and these lines are quality-ensured, i.e., the synchronous error between the original point and corresponding recovered one is controlled. With experimental tests by comparing MDisPLA with the state-of-the-art algorithm implemented based on cone intersection using the synchronous Euclidean distance (CISED) on trajectory data sets, it demonstrates that MDisPLA can be stable to generate the quality-ensured lines. It is faster by 14 times than CISED with lower memory requirements, and can reduce the number of segments by 48% and the storage number by 10.5%. MDisPLA significantly improves processing speed and reduces storage while maintaining compression quality.
- 1 September 2024
- Published by China Science Publishing & Media Ltd. in JOURNAL OF SHENZHEN UNIVERSITY SCIENCE AND ENGINEERING
- Vol. 41 (5) , 574-582
Open AccessAn optimal L∞-PLA algorithm for trajectory data compression
With the application and development of global positioning system, huge amounts of real-time trajectory data are collected, which gives a challenge for data transmission, storage and analysis. To attack this issue, data compression technology based on piecewise linear approximation (PLA), which is simple and intuitive, less compression storage and faster data transmission, has been widely researched. Currently, the optimal online PLA algorithm can not effectively compress multi-dimensional trajectory data. This paper presented a novel multi-dimensional compression problem under maximum error bound (mDisPLA∞), and proposed an optimal online PLA algorithm MDisPLA to solve it. MDisPLA used a divide-and-conquer strategy to extend the one-dimensional optimal PLA algorithm for optimizing compression of multi-dimensional trajectory data. It can generate the minimum number of disconnected straight lines in linear time complexity, and these lines are quality-ensured, i.e., the synchronous error between the original point and corresponding recovered one is controlled. With experimental tests by comparing MDisPLA with the state-of-the-art algorithm implemented based on cone intersection using the synchronous Euclidean distance (CISED) on trajectory data sets, it demonstrates that MDisPLA can be stable to generate the quality-ensured lines. It is faster by 14 times than CISED with lower memory requirements, and can reduce the number of segments by 48% and the storage number by 10.5%. MDisPLA significantly improves processing speed and reduces storage while maintaining compression quality.
- 26 September 2023
- Published by Springer Nature in Health Information Science and Systems
- Vol. 11 (1) , 1-10
An error-bounded median filter for correcting ECG baseline wander
The baseline wander (BLW) in electrocardiogram (ECG) is a common disturbance that has a significant influence on the ECG wave pattern recognition. Many methods, such as IIR filter, mean filter, etc., can be used to correct BLW; However, most of them work on the original ECG signals. Compressed ECG data are economic for data storage and transmission, and if the baseline correction can be processed on them, it will be more efficient than we decompress them first and then do such correction. In this paper, we propose a new type of median filter CM_Filter, which works on the synopses of straight lines achieved from ECG by piecewise linear approximation (PLA) under maximum error bound. In CM_Filter, a heuristic strategy “Quick-Finding” is deduced by a property of straight lines in order to get the quality-assured median values from the synopses. The extended experimental tests demonstrate that the proposed filter is very efficient in execution time, and effective for correcting both slow and abrupt ECG baseline wander.
- 26 September 2023
- Published by Springer Nature in Health Information Science and Systems
- Vol. 11 (1) , 1-10
An error-bounded median filter for correcting ECG baseline wander
The baseline wander (BLW) in electrocardiogram (ECG) is a common disturbance that has a significant influence on the ECG wave pattern recognition. Many methods, such as IIR filter, mean filter, etc., can be used to correct BLW; However, most of them work on the original ECG signals. Compressed ECG data are economic for data storage and transmission, and if the baseline correction can be processed on them, it will be more efficient than we decompress them first and then do such correction. In this paper, we propose a new type of median filter CM_Filter, which works on the synopses of straight lines achieved from ECG by piecewise linear approximation (PLA) under maximum error bound. In CM_Filter, a heuristic strategy “Quick-Finding” is deduced by a property of straight lines in order to get the quality-assured median values from the synopses. The extended experimental tests demonstrate that the proposed filter is very efficient in execution time, and effective for correcting both slow and abrupt ECG baseline wander.
- 24 September 2022
- Published by Springer Nature
- p. 500-508
Research on Speed Control System of Permanent Magnet Synchronous Motor Based on Fuzzy PID
- 24 September 2022
- Published by Springer Nature
- p. 500-508
Research on Speed Control System of Permanent Magnet Synchronous Motor Based on Fuzzy PID
- 4 June 2021
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 15 (5) , 1-10
DP-UserPro: differentially private user profile construction and publication
- 4 June 2021
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 15 (5) , 1-10
DP-UserPro: differentially private user profile construction and publication
- 17 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 34 (10414347) , 1
An Optimal Online Semi-connected PLA Algorithm with Maximum Error Bound
Piecewise Linear Approximation (PLA) is one of the most widely used approaches for representing a time series with a set of approximated line segments. With this compressed form of representation, many large complicated time series can be efficiently stored, transmitted and analyzed. In this article, with the introduced concept of “semi-connection” that allowing two representation lines to be connected at a point between two consecutive time stamps, we propose a new optimal linear-time PLA algorithm SemiOptConnAlg for generating the least number of semi-connected line segments with guaranteed maximum error bound. With extended experimental tests, we demonstrate that the proposed algorithm is very efficient in execution time and achieves better performances than the state-of-art solutions.
- 17 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 34 (10414347) , 1
An Optimal Online Semi-connected PLA Algorithm with Maximum Error Bound
Piecewise Linear Approximation (PLA) is one of the most widely used approaches for representing a time series with a set of approximated line segments. With this compressed form of representation, many large complicated time series can be efficiently stored, transmitted and analyzed. In this article, with the introduced concept of “semi-connection” that allowing two representation lines to be connected at a point between two consecutive time stamps, we propose a new optimal linear-time PLA algorithm SemiOptConnAlg for generating the least number of semi-connected line segments with guaranteed maximum error bound. With extended experimental tests, we demonstrate that the proposed algorithm is very efficient in execution time and achieves better performances than the state-of-art solutions.
- 20 December 2019
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 11 (7) , 1483-1499
An online PLA algorithm with maximum error bound for generating optimal mixed-segments
- 20 December 2019
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 11 (7) , 1483-1499
An online PLA algorithm with maximum error bound for generating optimal mixed-segments
- 9 June 2015
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 9 (2) , 243-249
Analyze EEG signals with extreme learning machine based on PMIS feature selection
- 9 June 2015
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 9 (2) , 243-249
Analyze EEG signals with extreme learning machine based on PMIS feature selection
- 7 November 2014
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 7 (3) , 365-374
An improved algorithm for segmenting online time series with error bound guarantee
- 7 November 2014
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 7 (3) , 365-374
An improved algorithm for segmenting online time series with error bound guarantee
- 28 September 2009
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 24 (5) , 833-843
H-Trust: A Group Trust Management System for Peer-to-Peer Desktop Grid
- 28 September 2009
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 24 (5) , 833-843
H-Trust: A Group Trust Management System for Peer-to-Peer Desktop Grid