A Novel Bounded-Error Piecewise Linear Approximation Algorithm for Streaming Sensor Data in Edge Computing

  • Jeng-Wei Lin
  • Shih-wei Liao
  • Fang-Yie LeuEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1035)


Many studies show that many Data compression schemes, like Bounded-Error Piecewise Linear Approximation (BEPLA) methods, have been proposed to lower the length sensor data, aiming to mitigating data transmission energies. When an error bound is given, these data compression schemes consider how to represent original sensor data by using fewer line segments. In this paper, besides BEPLA, we further deal with resolution reduction, which called Swing-RR (Resolution Reduction) sets a new restriction on the position of line segment endpoints. Our simulating results on existing datasets indicate that the length of compressed data is actually lowered.


  1. 1.
    Kawahara, M., Chiu, Y.J., Berger, T.: High-speed software implementation of Huffman coding. In: Proceedings of 1998 Data Compression Conference, p. 553 (1998)Google Scholar
  2. 2.
    Marcelloni, F., Vecchio, M.: A simple algorithm for data compression in wireless sensor networks. IEEE Commun. Lett. 12(6), 411–413 (2008). Scholar
  3. 3.
    Javed, M.Y., Nadeem, A.: Data compression through adaptive Huffman coding schemes. In: Proceedings of IEEE TENCON 2000, pp. 187–190 (2000)Google Scholar
  4. 4.
    Hakimi, S.L., Schmeichel, E.F.: Fitting polygonal functions to a set of points in the plane. CVGIP: Graph. Models Image Process. 53(2), 132–136 (1991)zbMATHGoogle Scholar
  5. 5.
    Elmeleegy, H., Elmagarmid, A.K., Cecchet, E., Aref, W.G., Zwaenepoel, W.: Online piece-wise linear approximation of numerical streams with precision guarantees. Proc. VLDB Endow. 2(1), 145–156 (2009)CrossRefGoogle Scholar
  6. 6.
    Luo, G., Yi, K., Cheng, S.W., Li, Z., Fan, W., He, C., Mu, Y.: Piecewise linear approximation of streaming time series data with max-error guarantees. In: 2015 IEEE 31st International Conference on Data Engineering, pp. 173–184 (2015)Google Scholar
  7. 7.
    Xie, Q., Pang, C., Zhou, X., Zhang, X., Deng, K.: Maximum error-bounded piecewise linear representation for online stream approximation. VLDB J. 23(6), 915–937 (2014)CrossRefGoogle Scholar
  8. 8.
    Zhao, H., Dong, Z., Li, T., Wang, X., Pang, C.: Segmenting time series with connected lines under maximum error bound. Inf. Sci. 345, 1–8 (2016)CrossRefGoogle Scholar
  9. 9.
    Gritzali, F., Papakonstantinou, G.: A fast piecewise linear approximation algorithm. Sig. Process. 5(3), 221–227 (1983)CrossRefGoogle Scholar
  10. 10.
    O’Rourke, J.: An on-line algorithm for fitting straight lines between data ranges. Commun. ACM 24(9), 574–578 (1981)CrossRefGoogle Scholar
  11. 11.
    Chen, Y., Keogh, E., Hu, B., Begum, N., Bagnall, A., Mueen, A., Batista, G.: The UCR time series classification archive 2015. Accessed 7 July 2018
  12. 12.
    IEEE Computer Society. IEEE Standard for Floating-Point Arithmetic. IEEE Standard 754-2008Google Scholar
  13. 13.
    Lin, J.W., Liao, S.W., Leu, F.Y.: Sensor data compression using bounded error piecewise linear approximation with resolution reduction. Energies 12, 1–20 (2019)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of Information ManagementTunghai UniversityTaichung CityTaiwan
  2. 2.Department of Computer Science and Information EngineeringNational Taiwan UniversityTaipei CityTaiwan
  3. 3.Department of Computer ScienceTunghai UniversityTaichung CityTaiwan

Personalised recommendations