Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1,455

The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.

IEEE Transactions on Signal Processing

·2023·IEEE Transactions on Signal Processing

Abstract

Assume that we observe a large number of signals, all of them with identical, although unknown, shape, but with a different random shift.The objective is to estimate the individual time shifts and their distribution.Such an objective appears in several biological applications like neuroscience or ECG signal processing, in which the estimation of the distribution of the elapsed time between repetitive pulses with a possibly low signal-noise ratio, and without a knowledge of the pulse shape is of interest.We suggest an M-estimator leading to a three-stage algorithm: we first split our data set in blocks, then the shift estimation in each block is done by minimizing a cost function based on the periodogram; the estimated shifts are eventually plugged into a standard density estimator.We show that under mild regularity assumptions the density estimate converges weakly to the true shift distribution.The theory is applied both to simulations and to alignment of real ECG signals.The proposed approach outperforms the standard methods for curve alignment and shift density estimation, even in the case of low signal-to-noise ratio, and is robust to numerous perturbations common in ECG signals.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tsp.78

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 13 references

Cited by

See all 1,455

Metadata

Venue
IEEE Transactions on Signal Processing
Published
2023-10-10
ISSN
  • 1053-587X (ISSN-L)
  • 1941-0476
OpenAlex
W4200346838
Cited by
1,455
References
13
Type
paratext
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: IEEE Transactions on Signal Processing. https://app.cochat.ai/papers/10.1109/tsp.78
The paper
IEEE Transactions on Signal Processing. (2023). IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.78

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.