Suppressing Clutter Components In Ultrasound Color Flow Imaging Using Robust Matrix Completion Algorithm: Simulation And Phantom Study
Bibliographic record
Abstract
In this paper, we propose a novel technique for suppressing clutter in ultrasound Color Flow Imaging (CFI). The unexpected clutter signal originating from slowly moving tissue prevents a clear visualization of vasculature. Using eigen-based filters is a state-of-the-art technique to reject the tissue echo. However, it remains an issue to find the exact rank of clutter and blood subspaces in these algorithms. Additionally, in case of noisy data, linear eigen-based filters lead to inefficient suppression of clutter. Moreover, conventional eigen-based methods are subject to lengthy computation times. To resolve these issues, we consider the task of clutter rejection as a foreground-background separation problem where the moving blood is the foreground and the steady tissue is modeled as the background. This problem is solved by adapting the fast Robust Matrix Completion (fRMC) algorithm for suppressing clutter in ultrasound CFI. The acquired ultrasound frames are stacked into a data matrix, the rank of which is minimized using the In-face Extended Frank-Wolfe method, which extracts the sparse blood component. For this method, manual tuning to determine the rank of clutter and blood sub-spaces is not necessary. Furthermore, the algorithm substantially decreases computation time. We name the proposed technique RAPID-Robust mAtrix decomPosition for suppressIng clutter in ultrasounD. RAPID is validated against simulation and flow phantom data and the results are compared to that of the conventional Singular Value Decomposition (SVD) method. In both of the experiments, RAPID provides a better visualization of the blood vessel than SVD. Furthermore, RAPID improves the execution time by more than 12, 000%.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| 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".