Combining Total Variation Regularization with Window-Based Time Delay Estimation in Ultrasound Elastography
Bibliographic record
Abstract
A major challenge of free-hand palpation ultrasound elastography (USE) is estimating the displacement of RF samples between pre- and post-compressed RF data. The problem of displacement estimation is ill-posed since the displacement of one sample by itself cannot be uniquely calculated. To resolve this problem, two categories of methods have emerged. The first category assumes that the displacement of samples within a small window surrounding the reference sample is constant. The second class imposes smoothness regularization and optimizes an energy function. Herein, we propose a novel method that combines both approaches, and as such, is more robust to noise. The second contribution of this work is the introduction of the L1 norm as the regularization term in our cost function, which is often referred to as the total variation (TV) regularization. Compared to previous work that used the L2 norm regularization, optimization of the new cost function is more challenging. However, the advantages of using the L1 norm are twofold. First, it leads to substantial improvement in the sharpness of displacement estimates. Second, to optimize the cost function with the L1 norm regularization, we use an iterative method that further increases the robustness. We name our proposed method tOtal Variation Regularization and WINDow-based time delay estimation (OVERWIND) and show that it is robust to signal decorrelation and generates sharp displacement and strain maps for simulated, experimental phantom and in-vivo data. In particular, OVERWIND improves strain contrast-to-noise ratio (CNR) by 27.26%, 144.05%, and 49.90% on average in simulation, phantom, and in-vivo data, respectively, compared to our recent Global Ultrasound Elastography (GLUE) method.
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.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".