Polynomial-Time Solvability of One Optimization Problem Induced by Processing and Analyzing Quasiperiodic ECG and PPG Signals

Alexander Kel’manov, Sergey Khamidullin, Liudmila Mikhailova, Pavel Ruzankin

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

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 (formula presented) time; where N is the duration of the observed signal (the number of points in the time series), (formula presented) is a positive integer number which bounds the fluctuations of the repetition period. If (formula presented) is a part of the input, then the algorithm’s running time is (formula presented), i.e., the algorithm is polynomial. If (formula presented) is a fixed parameter (that is typical for applications), then the running-time of the algorithm is (formula presented), i.e., the algorithm is linear in time. Numerical simulation examples demonstrate the robustness of the algorithm in the presence of additive noise.

Original languageEnglish
Title of host publicationOptimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers
EditorsMilojica Jaćimović, Michael Khachay, Vlasta Malkova, Mikhail Posypkin
PublisherSpringer Gabler
Pages88-101
Number of pages14
ISBN (Print)9783030386023
DOIs
Publication statusPublished - 1 Jan 2020
Event10th International Conference on Optimization and Applications, OPTIMA 2019 - Petrovac, Montenegro
Duration: 30 Sep 20194 Oct 2019

Publication series

NameCommunications in Computer and Information Science
Volume1145 CCIS
ISSN (Print)1865-0929
ISSN (Electronic)1865-0937

Conference

Conference10th International Conference on Optimization and Applications, OPTIMA 2019
CountryMontenegro
CityPetrovac
Period30.09.201904.10.2019

Keywords

  • Discrete optimization problem
  • ECG
  • Linear-time algorithm and Pulse train signal processing
  • Polynomial-time solvability
  • PPG
  • Quasiperiodic

Fingerprint Dive into the research topics of 'Polynomial-Time Solvability of One Optimization Problem Induced by Processing and Analyzing Quasiperiodic ECG and PPG Signals'. Together they form a unique fingerprint.

  • Cite this

    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 M. Jaćimović, M. Khachay, V. Malkova, & M. Posypkin (Eds.), Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers (pp. 88-101). (Communications in Computer and Information Science; Vol. 1145 CCIS). Springer Gabler. https://doi.org/10.1007/978-3-030-38603-0_7