Papers โ€บ Geodesic Tracking via New Data-driven Connections of Cartan Type for Vascular Tree Tracking

Geodesic Tracking via New Data-driven Connections of Cartan Type for Vascular Tree Tracking

23 Aug 2022arXiv:2208.11004links table onlyarchive 2025-07-28

Nicky van den Berg, Bart Smets, Gautam Pai, Jean-Marie Mirebeau, Remco Duits

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We introduce a data-driven version of the plus Cartan connection on the homogeneous space ๐•„โ‚‚ of 2D positions and orientations. We formulate a theorem that describes all shortest and straight curves (parallel velocity and parallel momentum, respectively) with respect to this new data-driven connection and corresponding Riemannian manifold. Then we use these shortest curves for geodesic tracking of complex vasculature in multi-orientation image representations defined on ๐•„โ‚‚. The data-driven Cartan connection characterizes the Hamiltonian flow of all geodesics. It also allows for improved adaptation to curvature and misalignment of the (lifted) vessel structure that we track via globally optimal geodesics. We compute these geodesics numerically via steepest descent on distance maps on ๐•„โ‚‚ that we compute by a new modified anisotropic fast-marching method. Our experiments range from tracking single blood vessels with fixed endpoints to tracking complete vascular trees in retinal images. Single vessel tracking is performed in a single run in the multi-orientation image representation, where we project the resulting geodesics back onto the underlying image. The complete vascular tree tracking requires only two runs and avoids prior segmentation, placement of extra anchor points, and dynamic switching between geodesic models. Altogether we provide a geodesic tracking method using a single, flexible, transparent, data-driven geodesic model providing globally optimal curves which correctly follow highly complex vascular structures in retinal images. All experiments in this article can be reproduced via documented Mathematica notebooks available at GitHub (https://github.com/NickyvdBerg/DataDrivenTracking).

PaperPDFCode

Code

nickyvdberg/datadriventracking officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change ยท a person checks every report against the paper or source before anything changes; decisions are listed on /corrections