PubMed Health⌕ Search

PubMed · 16504009

Reference signal extraction from corrupted ECG using wavelet decomposition for MRI sequence triggering: application to small animals.

Abstract

BACKGROUND: Present developments in Nuclear Magnetic Resonance (NMR) imaging techniques strive for improved spatial and temporal resolution performances. However, trying to achieve the shortest gradient rising time with high intensity gradients has its drawbacks: It generates high amplitude noises that get superimposed on the simultaneously recorded electrophysiological signals, needed to synchronize moving organ images. Consequently, new strategies have to be developed for processing these collected signals during Magnetic Resonance Imaging (MRI) examinations. The aim of this work is to extract an efficient reference signal, from an electrocardiogram (ECG) that was contaminated by the NMR artefacts. This may be used for image triggering and/or cardiac rhythm monitoring. METHODS: Our method, based on sub-band decomposition using wavelet filters, is tested on various ECG signals recorded during three imaging sequences: Gradient Echo (GE), Fast Spin Echo (FSE) and Inversion Recovery with Spin Echo (IRSE). In order to define the most adapted wavelet functions to use according to the excitation protocols, noise generated by each imaging sequence is recorded and analysed. After exploring noise models along with information found in the literature, a group of 14 wavelets, members of three families (Daubechies, Coiflets, Symlets), is selected for the study. The extraction process is carried out by decomposing the contaminated ECG signals into 8 scales using a given wavelet function, then combining the sub-bands necessary for cardiac synchronization, i.e. those containing the essential part of the QRS energy, to construct a reference signal. RESULTS: The efficiency of the presented method has been tested on a group of quite representative signals containing: highly contaminated (mean SNR<--5 dB) simulated ECGs that replicate normal and pathological human heart beats, as well as some pathological and healthy rodents' actual ECG records. Despite the weak SNR of the contaminated ECG, the performances were quite satisfactory. When comparing the wavelet performances, one may notice that for a given sequence, some wavelets are more efficient for processing than others; for GE, FSE and IRSE sequence, good synchronisation condition is accomplished with coif5, sym8, and sym4 respectively. CONCLUSION: Sub-band decomposition proved to be very suitable for extracting a reference signal from a corrupted ECG for MRI triggering. An appropriate choice of the wavelet function, in accordance with the image sequence type, could considerably improve the quality of the reference signal for better image synchronization.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dima Abi-Abdallah, Eric Chauvet, Latifa Bouchet-Fakri, Alain Bataillard, André Briguet, Odette Fokapu. 2006-02-20. Reference signal extraction from corrupted ECG using wavelet decomposition for MRI sequence triggering: application to small animals.. https://doi.org/10.1186/1475-925x-5-11

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6&#xd7; to 17.6&#xd7; faster than POASTA, and 7.3&#xd7; faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9&#xd7; to 16.9&#xd7; speedup on short reads. Moreover, Theseus is 1.5&#xd7; to 36.3&#xd7; faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗