2013
DOI: 10.1214/13-aoas676
|View full text |Cite
|
Sign up to set email alerts
|

Fréchet means of curves for signal averaging and application to ECG data analysis

Abstract: Signal averaging is the process that consists in computing a mean shape from a set of noisy signals.In the presence of geometric variability in time in the data, the usual Euclidean mean of the raw data yields a mean pattern that does not reflect the typical shape of the observed signals. In this setting, it is necessary to use alignment techniques for a precise synchronization of the signals, and then to average the aligned data to obtain a consistent mean shape. In this paper, we study the numerical performa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(11 citation statements)
references
References 36 publications
0
11
0
Order By: Relevance
“…Example 1.2 Assume that there is a deterministic time series x ∈ R N which models some "prototype" evolution of a quantity, say the prototype heartbeat in a patient's ECG. This prototype is unknown, but one records a lot of samples of it run at different speeds and contaminated by noise (compare [6]). A model for these observations is then y ( ) n = x h ( ) (n) + w ( ) n , n= 1, .…”
Section: Remark 11mentioning
confidence: 99%
See 1 more Smart Citation
“…Example 1.2 Assume that there is a deterministic time series x ∈ R N which models some "prototype" evolution of a quantity, say the prototype heartbeat in a patient's ECG. This prototype is unknown, but one records a lot of samples of it run at different speeds and contaminated by noise (compare [6]). A model for these observations is then y ( ) n = x h ( ) (n) + w ( ) n , n= 1, .…”
Section: Remark 11mentioning
confidence: 99%
“…The currently used method [6,31,33], consists in first trying to align the different samples, i.e., to estimate the time-changes h ( ) , and to average afterwards. This seems to work well in regimes where the noise w ( ) is small (large signal-to-noise ratio), but will break down if this is not the case.…”
Section: Remark 11mentioning
confidence: 99%
“…As we previously remarked in Section 1, this preference for manifold-valued random variables is because the assumption that the sample space is a vector or affine space is too restrictive for a wide class of real situations. Interested readers may refer to Bhattacharya & Dunson (2012) and Bigot (2013) (and references therein) to see additional realistic applications where the sample space of a random variable is modelled by a Riemannian manifold.…”
Section: Extension To Riemannian Manifoldsmentioning
confidence: 99%
“…Clearly, the best choice of registration parameters j , j for each subject j is the minimizer of M( , ) with respect to ( , ), ie, The solution to problem (12) produces the optimal values for registration parameters j , j for the sample, and by substituting these values into (10), we obtain the exact form of the discretized Fréchet mean. The optimization procedure relies on a gradient descent algorithm similar to the one proposed in Bigot et al, 23 in a different context. If needed, using a kernel approximation similar to the one described above, we obtain continuous or smooth approximations of the Fréchet mean estimator̂.…”
Section: Estimation Of the Fréchet Mean Curve And Registration Of Thementioning
confidence: 99%