Problem of minimizing a sum of differences of weighted convolutions (Q828127): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Alexander Kel'Manov / rank | |||
Property / author | |||
Property / author: Sergey Khamidullin / rank | |||
Property / author | |||
Property / author: Alexander Kel'Manov / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Sergey Khamidullin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Posterior detection of a given number of identical subsequences in a quasi-periodic sequence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4428016 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 07:45, 24 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Problem of minimizing a sum of differences of weighted convolutions |
scientific article |
Statements
Problem of minimizing a sum of differences of weighted convolutions (English)
0 references
8 January 2021
0 references
In this paper the problem of minimizing a sum of differences of weighted convolutions is formulated as the problem of optimal summing of elements of two sequences where indices play the role of variables. It is shown that the considered problem can be interpreted as the problem that minimizes the sum of squared distances between the elements of an input sequence and one of the admissible approximating sequences. The considered problem is a generalization of the problems investigated in [\textit{A. V. Kel'manov} et al., Sib. Zh. Ind. Mat. 5, No. 1, 94--108 (2002; Zbl 1075.93539)]. The size of the set of all feasible solutions is estimated. Using a dynamic programming approach and the Bellman's principle of optimality an exact polynomial algorithm solving the considered problem is obtained. The proposed algorithm is tested on two examples of numerical simulation of processing medical signals, namely electrocardiogram (ECG)-like, and photoplethysmogram (PPG)-like pulses distorted by additional noise.
0 references
numerical sequences
0 references
difference of weighted convolutions
0 references
variable length of convolution
0 references
polynomial-time solvability
0 references
linear-time algorithm
0 references
numerical simulation
0 references
ECG-like signal
0 references
PPG-like signal
0 references