An adaptive geodesic voting method for curvilinear tree structure extraction
Geodesic voting method is known as a powerful tool for extracting curvilinear structures, which is able to find a tree structure from a single point. However, this method may fail to generate accurate results in complex scenarios such as complex network-like structures, due to the limitation of single source point. In order to solve this problem, we propose an adaptive curvature-penalized geodesic voting method where multiple source points with geometric voting constraint can be used for constructing the voting score map. In addition, we exploit the introduced adaptive geodesic voting method for the task of retinal vessel tracking, in conjunction with a deep learning-based junction points detection procedure. Experimental results on both synthetic images and retinal images prove the efficiency of the introduced adaptive geodesic voting method.
Authors
- Jiong Zhang (ORCID: https://orcid.org/0000-0002-1922-9118)
- H. Liang (ORCID: https://orcid.org/0009-0004-9489-550X)
- Tao Chen (ORCID: https://orcid.org/0000-0001-9704-9545)
- Da Chen (ORCID: https://orcid.org/0000-0001-5135-0615)
- Li Ping (ORCID: https://orcid.org/0000-0002-4933-5093)
- Laurent D. Cohen
Institutions
- Centre National de la Recherche Scientifique (FR)
- Qilu University of Technology (CN)
- Shanghai Jiao Tong University (CN)
- Université Paris Sciences et Lettres (FR)
- Tongren Hospital (CN)
- Ningbo Institute of Industrial Technology (CN)
- Université Paris Dauphine-PSL (FR)
Publication Details
- Published
- 2025-02-13
- DOI
- https://doi.org/10.1117/12.3057740
- Primary Topic
- Data Visualization and Analytics
- Type
- article
- Field-Weighted Citation Impact
- 0.00