Laplacian Flow Dynamics on Geometric Graphs for Anatomical Modeling of Cerebrovascular Networks
Bibliographic record
Abstract
Generating computational anatomical models of cerebrovascular networks is vital for improving clinical practice and understanding brain oxygen transport. This is achieved by extracting graph-based representations based on pre-mapping of vascular structures. Recent graphing methods can provide smooth vessels trajectories and well-connected vascular topology. However, they require water-tight surface meshes as inputs. Furthermore, adding vessels radii information on their graph compartments restricts their alignment along vascular centerlines. Here, we propose a novel graphing scheme that works with relaxed input requirements and intrinsically captures vessel radii information. The proposed approach is based on deforming geometric graphs constructed within vascular boundaries. Under a laplacian optimization framework, we assign affinity weights on the initial geometry that drives its iterative contraction toward vessels centerlines. We present a mechanism to decimate graph structure at each run and a convergence criterion to stop the process. A refinement technique is then introduced to obtain final vascular models. Our implementation is available on https://github.com/Damseh/VascularGraph. We benchmarked our results with that obtained using other efficient and state-of-the-art graphing schemes, validating on both synthetic and real angiograms acquired with different imaging modalities. The experiments indicate that the proposed scheme produces the lowest geometric and topological error rates on various angiograms. Furthermore, it surpasses other techniques in providing representative models that capture all anatomical aspects of vascular structures.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.002 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".