A GPU-Based, Real-Time Dealiasing Framework for High-Frame-Rate Vector Doppler Imaging
Bibliographic record
Abstract
Vector Doppler is well regarded as a potential way of deriving flow vectors to intuitively visualize complex flow profiles, especially when it is implemented at high frame rates. However, this technique's performance is known to suffer from aliasing artifacts. There is a dire need to devise real-time dealiasing solutions for vector Doppler. In this article, we present a new methodological framework for achieving aliasing-resistant flow vector estimation at real-time throughput from precalculated Doppler frequencies. Our framework comprises a series of compute kernels that have synergized: 1) an extended least squares vector Doppler (ELS-VD) algorithm; 2) single-instruction, multiple-thread (SIMT) processing principles; and 3) implementation on a graphical processing unit (GPU). Results show that this new framework, when executed on an RTX-2080 GPU, can effectively generate aliasing-free flow vector maps using high-frame-rate imaging datasets acquired from multiple transmit-receive angle pairs in a carotid phantom imaging scenario. Over the entire cardiac cycle, the frame processing time for aliasing-resistant vector estimation was measured to be less than 16 ms, which corresponds to a minimum processing throughput of 62.5 frames/s. In a human femoral bifurcation imaging trial with fast flow (150 cm/s), our framework was found to be effective in resolving two-cycle aliasing artifacts at a minimum throughput of 53 frames/s. The framework's processing throughput was generally in the real-time range for practical combinations of ELS-VD algorithmic parameters. Overall, this work represents the first demonstration of real-time, GPU-based aliasing-resistant vector flow imaging using vector Doppler estimation principles.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".