Global Ultrasound Elastography in Spatial and Temporal Domains
Bibliographic record
Abstract
In this paper, a novel computationally efficient quasi-static ultrasound elastography technique is introduced by optimizing an energy function. Unlike conventional elastography techniques, three radio frequency (RF) frames are considered to devise a nonlinear cost function consisting of data intensity similarity term, spatial regularization terms and, most importantly, temporal continuity terms. We optimize the aforesaid cost function efficiently to obtain the time-delay estimation (TDE) of all samples between the first two and last two frames of ultrasound images simultaneously, and spatially differentiate the TDE to generate axial strain map. A novelty in our spatial and temporal regularizations is that they adaptively change based on the data, which leads to substantial improvements in TDE. We handle the computational complexity resulting from incorporation of all samples from all three frames by converting our optimization problem to a sparse linear system of equations. Consideration of both spatial and temporal continuity makes the algorithm more robust to signal decorrelation than the previous algorithms. We name the proposed method GUEST: Global Ultrasound Elastography in Spatial and Temporal directions. We validated our technique with simulation, experimental phantom, and in vivo liver data and compared the results with two recently proposed TDE methods. In all the experiments, GUEST substantially outperforms other techniques in terms of signal-to-noise ratio (SNR), contrast-to-noise ratio (CNR), and strain ratio (SR) of the strain images.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".