Recognition of a Quasi-Periodic Sequence Containing an Unknown Number of Nonlinearly Extended Reference Subsequences

A previously unstudied optimization problem induced by noise-proof recognition of a quasi-periodic sequence, namely, by the recognition of a sequence of length generated by a sequence belonging to a given finite set (alphabet) of sequences is considered. Each sequence from generates an exponentially sized set consisting of all sequences of length containing (as subsequences) a varying number of admissible quasi-periodic (fluctuational) repeats of . Each quasi-periodic repeat is generated by admissible transformations of U , namely, by shifts and extensions. The recognition problem is to choose a sequence from and to approximate by an element of the sequence set . The approximation criterion is the minimum of the sum of the squared distances between the elements of the sequences. We show that the considered problem is equivalent to the problem of summing the elements of two numerical sequences so as to minimize the sum of an unknown number of terms, each being the difference between the nonweighted autoconvolution of extended to a variable length (by multiple repeats of its elements) and a weighted convolution of this extended sequence with a subsequence of Y . It is proved that the considered optimization problem and the recognition problem are both solvable in polynomial time. An algorithm is constructed and its applicability for solving model application problems of noise-proof processing of ECG- and PPG-like quasi-periodic signals (electrocardiogram- and photoplethysmogram-like signals) is illustrated using numerical examples.