Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Consistent Signal Reconstruction from Streaming Multivariate Time Series (2308.12459v2)

Published 23 Aug 2023 in eess.SP and cs.LG

Abstract: Digitalizing real-world analog signals typically involves sampling in time and discretizing in amplitude. Subsequent signal reconstructions inevitably incur an error that depends on the amplitude resolution and the temporal density of the acquired samples. From an implementation viewpoint, consistent signal reconstruction methods have proven a profitable error-rate decay as the sampling rate increases. Despite that, these results are obtained under offline settings. Therefore, a research gap exists regarding methods for consistent signal reconstruction from data streams. Solving this problem is of great importance because such methods could run at a lower computational cost than the existing offline ones or be used under real-time requirements without losing the benefits of ensuring consistency. In this paper, we formalize for the first time the concept of consistent signal reconstruction from streaming time-series data. Then, we present a signal reconstruction method able to enforce consistency and also exploit the spatiotemporal dependencies of streaming multivariate time-series data to further reduce the signal reconstruction error. Our experiments show that our proposed method achieves a favorable error-rate decay with the sampling rate compared to a similar but non-consistent reconstruction.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. A. J. Jerri, “The shannon sampling theorem—its various extensions and applications: A tutorial review,” Proceedings of the IEEE, vol. 65, no. 11, pp. 1565–1596, 1977.
  2. H. D. Luke, “The origins of the sampling theorem,” IEEE Communications Magazine, vol. 37, no. 4, pp. 106–108, 1999.
  3. M. Vetterli, P. Marziliano, and T. Blu, “Sampling signals with finite rate of innovation,” IEEE transactions on Signal Processing, vol. 50, no. 6, pp. 1417–1428, 2002.
  4. W. R. Bennett, “Spectra of quantized signals,” The Bell System Technical Journal, vol. 27, no. 3, pp. 446–472, 1948.
  5. R. M. Gray, “Quantization noise spectra,” IEEE Transactions on information theory, vol. 36, no. 6, pp. 1220–1244, 1990.
  6. N. T. Thao and M. Vetterli, “Deterministic analysis of oversampled a/d conversion and decoding improvement based on consistent estimates,” IEEE Transactions on signal processing, vol. 42, no. 3, pp. 519–531, 1994.
  7. N. T. Thao and M. Vetterli, “Reduction of the mse in r-times oversampled a/d conversion o (1/r) to o (1/r/sup 2/),” IEEE Transactions on Signal Processing, vol. 42, no. 1, pp. 200–203, 1994.
  8. I. Jovanovic and B. Beferull-Lozano, “Oversampled a/d conversion and error-rate dependence of nonbandlimited signals with finite rate of innovation,” IEEE Transactions on Signal Processing, vol. 54, no. 6, pp. 2140–2154, 2006.
  9. PhD thesis, Columbia University, 1993.
  10. B. Beferull-Lozano and A. Ortega, “Efficient quantization for overcomplete expansions in ℝnsuperscriptℝ𝑛\mathbb{R}^{n}blackboard_R start_POSTSUPERSCRIPT italic_n end_POSTSUPERSCRIPT,” IEEE Transactions on Information Theory, vol. 49, no. 1, pp. 129–150, 2003.
  11. S. Rangan and V. K. Goyal, “Recursive consistent estimation with bounded noise,” IEEE Transactions on Information Theory, vol. 47, no. 1, pp. 457–464, 2001.
  12. V. K. Goyal, J. Kovačević, and J. A. Kelner, “Quantized frame expansions with erasures,” Applied and Computational Harmonic Analysis, vol. 10, no. 3, pp. 203–233, 2001.
  13. J. Kovacevic, V. K. Goyal, and M. Vetterli, “Fourier and wavelet signal processing,” Fourier Wavelets. org, pp. 1–294, 2013.
  14. C. Schmidt, C. Kottke, V. Jungnickel, and R. Freund, “High-speed digital-to-analog converter concepts,” in Next-Generation Optical Communication: Components, Sub-Systems, and Systems VI, vol. 10130, pp. 133–141, SPIE, 2017.
  15. S. A. Bazaz and B. Tondu, “Minimum time on-line joint trajectory generator based on low order spline method for industrial manipulators,” Robotics and Autonomous Systems, vol. 29, no. 4, pp. 257–268, 1999.
  16. T. Marcucci, P. Nobel, R. Tedrake, and S. Boyd, “Fast path planning through large collections of safe boxes,” arXiv preprint arXiv:2305.01072, 2023.
  17. E. Ruiz-Moreno, L. M. López-Ramos, and B. Beferull-Lozano, “A trainable approach to zero-delay smoothing spline interpolation,” IEEE Transactions on Signal Processing, vol. 71, pp. 4317–4329, 2023.
  18. H. Salehinejad, S. Sankar, J. Barfett, E. Colak, and S. Valaee, “Recent advances in recurrent neural networks,” arXiv preprint arXiv:1801.01078, 2017.
  19. P. Craven and G. Wahba, “Smoothing noisy data with spline functions: estimating the correct degree of smoothing by the method of generalized cross-validation,” Numerische mathematik, vol. 31, no. 4, pp. 377–403, 1978.
  20. O. Kosheleva and V. Kreinovich, “Why physical processes are smooth or almost smooth: A possible physical explanation based on intuitive ideas behind energy conservation,” Mathematical Structures and Modeling, 2021.
  21. I. J. Schoenberg, “On interpolation by spline functions and its minimal properties,” in On Approximation Theory/Über Approximationstheorie, pp. 109–129, Springer, 1964.
  22. P. J. Green and B. W. Silverman, Nonparametric regression and generalized linear models: a roughness penalty approach. Crc Press, 1993.
  23. G. Wahba, Spline models for observational data. SIAM, 1990.
  24. Cambridge University Press, 2008.
  25. AK Peters/CRC Press, 2002.
  26. Athena scientific, 2012.
  27. L. Peshkin, N. Meuleau, and L. Kaelbling, “Learning policies with external memory,” arXiv preprint cs/0103003, 2001.
  28. A. M. Schäfer, Reinforcement learning with recurrent neural networks. PhD thesis, Osnabrück, Univ., Diss., 2008, 2008.
  29. M. Zhang, Z. McCarthy, C. Finn, S. Levine, and P. Abbeel, “Learning deep neural network policies with continuous memory states,” in 2016 IEEE international conference on robotics and automation (ICRA), pp. 520–527, IEEE, 2016.
  30. A. Agrawal, B. Amos, S. Barratt, S. Boyd, S. Diamond, and J. Z. Kolter, “Differentiable convex optimization layers,” Advances in neural information processing systems, vol. 32, 2019.
  31. K. Slavakis, P. Bouboulis, and S. Theodoridis, “Online learning in reproducing kernel hilbert spaces,” in Academic Press Library in Signal Processing, vol. 1, pp. 883–987, Elsevier, 2014.
  32. E. Ruiz-Moreno and B. Beferull-Lozano, “Tracking of quantized signals based on online kernel regression,” in 2021 IEEE 31st International Workshop on Machine Learning for Signal Processing (MLSP), pp. 1–6, IEEE, 2021.
  33. MIT press, 2016.
  34. P. J. Werbos, “Backpropagation through time: what it does and how to do it,” Proceedings of the IEEE, vol. 78, no. 10, pp. 1550–1560, 1990.
  35. V. Monga, Y. Li, and Y. C. Eldar, “Algorithm unrolling: Interpretable, efficient deep learning for signal and image processing,” IEEE Signal Processing Magazine, vol. 38, no. 2, pp. 18–44, 2021.
  36. S. N. Wood, Generalized additive models: an introduction with R. chapman and hall/CRC, 2006.
  37. K. Cho, B. Van Merriënboer, D. Bahdanau, and Y. Bengio, “On the properties of neural machine translation: Encoder-decoder approaches,” arXiv preprint arXiv:1409.1259, 2014.
  38. D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv preprint arXiv:1412.6980, 2014.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now