RL-USRegi: Autonomous Ultrasound Registration for Radiation-Free Spinal Surgical Navigation Using Reinforcement Learning
Notice bibliographique
Résumé
Registration of intraoperative ultrasound (iUS) with preoperative CT represents a significant yet challenging task in the context of radiation-free spinal surgical navigation. The presence of thickness response artifacts in US images poses a considerable obstacle to the accurate extraction of bone boundaries. Furthermore, US-CT registration typically necessitates the detection and correspondence of high-quality landmarks at the initial stage. This can be accomplished by surgeons who have undergone extensive training in the localization of standard spinal US views, enabling them to identify key vertebral landmarks for subsequent precise registration. In this paper, we propose a fully automated iUS registration method that employs a limited number of spinal US views as observation objects. Specifically, three-dimensional vertebral meshes segmented from the preoperative CT images are superimposed on the US images and then fed to the reinforcement learning (RL) agent for sequential decision-making. The proposed method achieves fully automatic US-CT registration without relying on prespecified initialization. This is achieved by training the agent to approach bone surfaces on several randomly selected 2D US views. The instability of RL-based iUS registration is primarily attributable to the difficulty of correlating long-range information within the neural network. To address this issue, we propose a Field of View Separation (FoVS) module. The proposed approach employs separate encoders for US and mesh images, followed by cross-attention aggregation, which facilitates information flow between non-adjacent pixels. This approach enables pretraining of feature extraction on distinct encoders and the application of supplementary loss for enhanced feature matching precision, thereby significantly improving the learning capability and stability of the network. Furthermore, a refinement module is introduced to correct the results of the RL registration, which improves the stability of the registration process. To ascertain the efficacy of each module, action, and auxiliary task, comprehensive experiments are conducted. The results demonstrate that the performance of the RL agent is enhanced by the associated modules and auxiliary tasks. The registration exhibited an angular error of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$8.83 \; \pm \; 4.69$ </tex-math></inline-formula> degrees and a translational error of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$3.34 \; \pm \; 1.42$ </tex-math></inline-formula> mm, achieving the state-of-the-art (SOTA) results. It is noteworthy that fine-tuning the model prior to the surgical phase can significantly reduce the registration error, which is a promising outcome for its clinical translation.Note to Practitioners—The objective of this study is to address the issue of image registration using iUS in conjunction with preoperative CT scans in the context of spine surgery. The current 2D/3D image registration methods are constrained by several limitations. Firstly, they often exhibit reduced accuracy, and require high-quality images in substantial quantities. Secondly, there is a lack of effective mechanisms to rectify errors identified after the registration process. This paper proposes a fully automated registration framework based on RL, which incorporates image rendering and mesh clipping to enable continuous adjustment of the pose of 3D data, thereby facilitating 2D/3D registration. The framework employs the distinctive attributes of iUS images and incorporates a refinement module to evaluate registration accuracy, thereby facilitating the rectification of any registration issues. The proposed framework was tested on both sheep lumbar subjects and human lumbar phantoms, demonstrating the highest level of performance to date and indicating its potential for integration into surgical navigation systems.
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 distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,001 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,001 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
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 tête enseignante, 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 ».