Evidence map›Paper›PMID 41326550›Full record

ArticleScientific reports2025

Learning to compress electrocardiogram signals on a quick response code.

Apoorva Srivastava, Dipayan Dewan, Amit Patra, Debdoot Sheet

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Apoorva Srivastava *Indian Institute of Technology Kharagpur, Kharagpur, West Bengal, 721302, India. apoorva.s.2311@gmail.com.
Dipayan Dewan *Indian Institute of Technology Kharagpur, Kharagpur, West Bengal, 721302, India.
Amit PatraIndian Institute of Technology Kharagpur, Kharagpur, West Bengal, 721302, India.
Debdoot SheetIndian Institute of Technology Kharagpur, Kharagpur, West Bengal, 721302, India. debdoot@ee.iitkgp.ac.in.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The electrocardiogram (ECG) is a widely acknowledged clinical tool for diagnosis of cardiovascular diseases (CVDs). In low and middle income countries (LMICs), the lack of connected health (CH) systems often results in ECG data being shared via paper records, risking privacy breaches. One potential solution is embedding ECG data within a quick response (QR) code, enabling secure transmission of clinically essential information while preserving patient privacy. In this paper, we propose a learning-based compression method that preserves essential clinical information which is further encoded losslessly using the Brotli algorithm for QR code embedding. We have experimentally validated our approach on publicly available dataset containing ECG recordings from healthy individuals and with 26 distinct CVD pathologies. Key performance is assessed using Percentage Root-Mean-Square Difference (PRD), Structural Similarity Index (SSIM), and Compression Factor (CF) along with morphological features comparisons between original and decompressed lead-II ECG signals. At CF of 82.37, we have attained PRD of 2.70%, SSIM of 0.94 for lead-II ECG signal, and PRD of 2.80%, SSIM of 0.94 for lead-I ECG signal. Our method outperforms state-of-the-art approaches, enabling secure, efficient, and scalable ECG integration into CH systems for continuous monitoring and early detection of CVDs.

Indexed as

Cardiovascular DiseasesData CompressionElectrocardiographySignal Processing, Computer-AssistedAlgorithmsHumans

Identifiers

PMID41326550
PMCPMC12764787

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.