Abstract
This paper is devoted to an unexplored discrete optimization problem, which can be interpreted as a problem of least mean squares approximation of some observed discrete-time signal (a numerical time series) by an unobservable quasiperiodic (almost periodic) pulse signal generated by a pulse with a given pattern (reference) shape. Quasiperiodicity is understood, first, in the sense of admissible fluctuations of the interval between repetitions of the reference pulse, and second, in the sense of admissible nonlinear time expansions of its reference shape. Such problems are common in biomedical applications related to monitoring and analyzing electrocardiogram (ECG), photoplethysmogram (PPG), and several other signals. In the optimization model, the number of generated (admissible or approximating) quasiperiodic pulse sequences grows exponentially with the duration of the discrete-time signal (i.e., with the number of points in the time series). The size of the admissible solutions set also grows exponentially. However, despite that exponential growth, we have constructively proved the optimization problem polynomial-time solvability. Namely, we propose an algorithm that finds an optimal solution to the problem in \(\mathcal {O} (T_{\max }^{3}N)\) time; where N is the duration of the observed signal (the number of points in the time series), \( T_{\max } \le N \) is a positive integer number which bounds the fluctuations of the repetition period. If \(T_{\max }\) is a part of the input, then the algorithm’s running time is \( \mathcal {O} (N^{4}) \), i.e., the algorithm is polynomial. If \(T_{\max }\) is a fixed parameter (that is typical for applications), then the running-time of the algorithm is \( \mathcal {O} (N) \), i.e., the algorithm is linear in time. Numerical simulation examples demonstrate the robustness of the algorithm in the presence of additive noise.
A. Kel’manov—Deceased 1 December 2019.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Lin, C., Mailhes, C., Tourneret, J.-Y.: P- and T-wave delineation in ECG signals using a Bayesian approach and a partially collapsed Gibbs sampler. IEEE Trans. Biomed. Eng. 57(12), 2840–2849 (2010)
Akhbari, M., Shamsollahi, M.B., Sayadi, O., Armoundas, A.A., Jutten, C.: ECG segmentation and fiducial point extraction using multi hidden Markov model. Comput. Biol. Med. 79, 21–29 (2016)
Zhang, D., Zuo, W., Wang, P.: Computational Pulse Signal Analysis. Springer, Singapore (2018). https://doi.org/10.1007/978-981-10-4044-3
Kel’manov, A.V., Khamidullin, S.A.: A posteriori detection of a given number of truncated subsequences in a quasiperiodic Sequence. Pattern Recogn. Image Anal. 10(4), 500–513 (2000)
Kel’manov, A.V., Khamidullin, S.A.: Posterion detection of a given number of identical subsequences in a quasi-periodic sequence. Comp. Math. Math. Phys. 41(5), 762–774 (2001)
Kel’manov, A.V., Jeon, B.: A posteriori joint detection and discrimination of pulses in a quasiperiodic pulse train. IEEE Trans. Signal Process. 52(3), 645–656 (2004)
Kel’manov, A.V., Khamidullin, S.A.: A posteriori detection of a quasiperiodically recurring fragment in numerical sequences in the presence of noise and data loss. Pattern Recogn. Image Anal. 14(3), 421–434 (2004)
Kel’manov, A.V., Mikhailova, L.V.: A posteriori joint detection of reference fragments in a quasi-periodic sequence. Comp. Math. Math. Phys. 48(5), 850–865 (2008)
Kel’manov, A.V.: Off-line detection of a quasi-periodically recurring fragment in a numerical sequence. Proc. Steklov Inst. Math. 263(2 Suppl.), S84–S92 (2008)
Kel’manov, A.V., Mikhailova, L.V.: Joint detection of a given number of reference fragments in a quasi-periodic sequence and its partition into segments containing series of identical fragments. Comp. Math. Math. Phys. 46(1), 165–181 (2006)
Voskoboynikova, G., Khairetdinov, M.: Numerical modeling of posteriori algorithms for the geophysical monitoring. CCIS 549, 190–200 (2015)
Carter, J.A., Agol, E., et al.: Kepler-36: a pair of planets with neighboring orbits and dissimilar densities. Science 337(6094), 556–559 (2012)
Carter, J.A., Agol, E.: The quasiperiodic automated transit search algorithm. Astrophys. J. 765(2), 132 (2013)
Rajni, R., Kaur, I.: Electrocardiogram signal analysis - an overview. Int. J. Comput. Appl. 84(7), 22–25 (2013)
https://www.comm.utoronto.ca/~biometrics/PPG_Dataset/index.html
Shelley, K., Shelley, S.: Pulse oximeter waveform: photoelectric plethysmography. In: Carol, L., Hines, R., Blitt, C. (eds.) Clinical Monitoring, pp. 420–428. W.B. Saunders Company, Philadelphia (2001)
Acknowledgments
The study was supported by the Russian Foundation for Basic Research, projects 19-07-00397 and 19-01-00308, by the Russian Academy of Science (the Program of basic research), project 0314-2019-0015, and by the Russian Ministry of Science and Education under the 5–100 Excellence Programme.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Kel’manov, A., Khamidullin, S., Mikhailova, L., Ruzankin, P. (2020). Polynomial-Time Solvability of One Optimization Problem Induced by Processing and Analyzing Quasiperiodic ECG and PPG Signals. In: Jaćimović, M., Khachay, M., Malkova, V., Posypkin, M. (eds) Optimization and Applications. OPTIMA 2019. Communications in Computer and Information Science, vol 1145. Springer, Cham. https://doi.org/10.1007/978-3-030-38603-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-38603-0_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-38602-3
Online ISBN: 978-3-030-38603-0
eBook Packages: Computer ScienceComputer Science (R0)