ArticleJournal of magnetic resonance imaging : JMRI2025
Dynamic Regularized Adaptive Cluster Optimization (DRACO) for Quantitative Cardiac Cine MRI in Complex Arrhythmias.
Article in Journal of magnetic resonance imaging : JMRI, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.
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.
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.
Who cites it
3 citing papers in PubMed.
- Generative MR Multitasking With Complex-Harmonic Cardiac Encoding: Bridging the Gap Between Gated Imaging and Real-Time Imaging.Magnetic resonance in medicine · 2026Article
- Editorial for "Free-Breathing Dynamic, Regularized, Adaptive Cluster Optimization (DRACO) Cine Cardiac MRI in Atrial Fibrillation".Journal of magnetic resonance imaging : JMRI · 2026Article
- Free-Breathing Dynamic, Regularized, Adaptive Cluster Optimization (DRACO) Cine Cardiac MRI in Atrial Fibrillation.Journal of magnetic resonance imaging : JMRI · 2026Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
Abstract
backgroundIrregular cardiac motion can render conventional segmented cine MRI nondiagnostic. Clustering has been proposed for cardiac motion binning and may be optimized for complex arrhythmias. PURPOSE: To develop an adaptive cluster optimization method for irregular cardiac motion, and to generate the corresponding time-resolved cine images. STUDY TYPE: Prospective. SUBJECTS: Thirteen with atrial fibrillation, four with premature ventricular contractions, and one patient in sinus rhythm. FIELD STRENGTH/SEQUENCE: Free-running balanced steady state free precession (bSSFP) with sorted golden-step, reference real-time sequence. ASSESSMENT: Each subject underwent both the sorted golden-step bSSFP and the reference Cartesian real-time imaging. Golden-step bSSFP images were reconstructed using the dynamic regularized adaptive cluster optimization (DRACO) method and k-means clustering. Image quality (4-point Likert scale), signal-to-noise ratio (SNR), contrast-to-noise ratio (CNR), edge sharpness, and ventricular function were assessed. STATISTICAL TESTS: Paired t-tests, Friedman test, regression analysis, Fleiss' Kappa, Bland-Altman analysis. Significance level P < 0.05.
resultsThe DRACO method had the highest percent of images with scores ≥3 (96% for diastolic frame, 93% for systolic frame, and 93% for multiphase cine) and the percentages were significantly higher compared with both the k-means and real-time methods. Image quality scores, SNR, and CNR were significantly different between DRACO vs. k-means and between DRACO vs. real-time. Cardiac function analysis showed no significant differences between DRACO vs. the reference real-time.
conclusionDRACO with time-resolved reconstruction generated high quality images and has early promise for quantitative cine cardiac MRI in patients with complex arrhythmias including atrial fibrillation. LEVEL OF EVIDENCE: 1: TECHNICAL EFFICACY: Stage 2.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.