Searcharxiv⌕ Search

arXiv subjects

Stéphanie Bricq

Publications and source records attributed to Stéphanie Bricq.

2 recordsLinked to original sources

Simulation-to-Real First-Break Segmentation for Efficient Inversion in Musculoskeletal Ultrasound Tomography

Full-waveform inversion (FWI) is a promising strategy for quantitative musculoskeletal ultrasound computed tomography (USCT), but bone-related scattering, attenuation, and signal degradation make it highly sensitive to the accuracy of the initial acoustic-property distributions and prone to cycle skipping. First-arrival traveltimes provide important kinematic information for initial-model construction, yet conventional trace-wise picking is unreliable when arrivals are weak, spatially heterogeneous, or buried in system noise. We propose a learning-assisted reconstruction pipeline that combines segmentation-based first-arrival extraction with hybrid full-waveform inversion (HFWI), which incorporates Rytov-approximation-based traveltime information together with waveform fitting during the early inversion stage. A lightweight 2D U-Net treats the first-arrival trajectory across receiver channels as a first-break segmentation target and exploits its spatial continuity rather than processing each trace independently. To address both limited manual annotations and the simulation-to-real gap, the network is pretrained on task-specific simulations augmented with real system-noise recordings, followed by stage-wise training with progressively increased signal degradation and decoder-only fine-tuning using limited weakly labeled experimental data. The method is evaluated on in vitro phantom, ex vivo bovine-limb, and in vivo human-thigh datasets. Compared with conventional STA/LTA picking, the proposed network yields more spatially coherent first-arrival trajectories, lower mean extraction errors, and processes a full-matrix-capture dataset within seconds. When integrated into HFWI, the extracted arrivals improve initial-model construction and lead to stable subsequent FWI reconstructions, including challenging cases with estimated local first-arrival SNRs below 3 dB.

eess.IV↗

MRI-PET Registration with Automated Algorithm in Pre-clinical Studies

Magnetic Resonance Imaging (MRI) and Positron Emission Tomography (PET) automatic 3-D registration is implemented and validated for small animal image volumes so that the high-resolution anatomical MRI information can be fused with the low spatial resolution of functional PET information for the localization of lesion that is currently in high demand in the study of tumor of cancer (oncology) and its corresponding preparation of pharmaceutical drugs. Though many registration algorithms are developed and applied on human brain volumes, these methods may not be as efficient on small animal datasets due to lack of intensity information and often the high anisotropy in voxel dimensions. Therefore, a fully automatic registration algorithm which can register not only assumably rigid small animal volumes such as brain but also deformable organs such as kidney, cardiac and chest is developed using a combination of global affine and local B-spline transformation models in which mutual information is used as a similarity criterion. The global affine registration uses a multi-resolution pyramid on image volumes of 3 levels whereas in local B-spline registration, a multi-resolution scheme is applied on the B-spline grid of 2 levels on the finest resolution of the image volumes in which only the transform itself is affected rather than the image volumes. Since mutual information lacks sufficient spatial information, PCA is used to inject it by estimating initial translation and rotation parameters. It is computationally efficient since it is implemented using C++ and ITK library, and is qualitatively and quantitatively shown that this PCA-initialized global registration followed by local registration is in close agreement with expert manual registration and outperforms the one without PCA initialization tested on small animal brain and kidney.

cs.CV↗