Time domain principal component analysis for rapid, real‐time 2D MRI reconstruction from undersampled data
Notice bibliographique
Résumé
PURPOSE: A rapid real-time 2D accelerated method was developed for magnetic resonance imaging (MRI) using principal component analysis (PCA) in the temporal domain. This method employs a moving window of previous dynamic frames to reconstruct the current, real-time frame within this window. This technique could be particularly useful in real-time tracking applications such as in MR-guided radiotherapy, where low latency real-time reconstructions are essential. METHODS: The method was tested retrospectively on 15 fully-sampled data sets of lung patient data acquired on a 3T Philips Achieva system. High frequency data are incoherently undersampled, while the central low-frequency data are always acquired to characterize the temporal fluctuations through PCA. The undersampling pattern is derived in such a way that all of k-space is acquired within a pre-determined number of frames. The missing data in the current frame are then filled in by fitting the temporal characterizations to the acquired undersampled data, using a pre-determined number of PCs. A subset of six patients was used to test the contour ability of the images. Various accelerations between 3x and 8x were tested along with the optimal number of PCs for fitting. A comparison was also performed with previous work from our group proposed by Dietz et al. as well as with a standard low resolution acquisition. In order to determine how the method would perform at lower signal to noise ratio (SNR), noise levels of 2×, 4×, and 6× were added to the 3T data. Metrics such as normalised mean square error and Dice coefficient were used to measure the reconstruction image quality and contour ability. RESULTS: The proposed method demonstrated good temporal robustness as consistent metrics were detected for the duration of the imaging session. It was found that the optimal number of PCs for temporal fitting was dependent on the acceleration rate. For the data tested, five PCs were found to be optimal at the acceleration rates of 3× and 4×. This number decreases to three at accelerations of 5× and 6× and further decreases to two at an acceleration rate of 8×, likely due to greater instability with fewer acquired data points. The use of too many PCs for fitting increased the chances of noisy reconstruction which affected contourability. CONCLUSIONS: The proposed 2D real-time MR acceleration method demonstrated greater robustness in the metrics over time when compared with previous real-time PCA methods using metrics such as normalised mean squared error, peak SNR and structural similarity up to an acceleration of 8x. Improved temporal robustness of image structure contourability and accurate definition was also demonstrated using several metrics including the Dice coefficient. Reconstruction of raw acquired data can be performed at approximately 50 ms per frame using an Intel core i5 CPU. The method has the advantage of being very flexible in terms of hardware requirements as it can operate successfully on a single coil channel and does not require specialized computing power to implement in real-time.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,001 | 0,004 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,001 |
| Méta-épidémiologie (sens large) | 0,001 | 0,001 |
| Bibliométrie | 0,001 | 0,002 |
| Études des sciences et des technologies | 0,000 | 0,001 |
| Communication savante | 0,001 | 0,001 |
| Science ouverte | 0,001 | 0,001 |
| Intégrité de la recherche | 0,001 | 0,001 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,003 | 0,001 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».