Abstract
This paper describes a new framework for the automated tracking of the central retinal vein in retinal images. The procedure first computes a binary image of the retinal vasculature, then obtains the skeleton (medial axis) of the vascular network. Terminal and branching points of the network are then located, and the network converted into a graph representation including length and thickness information for all vessels. Finally, a MaxMin approach is used to locate the central vein:The candidates central vein are the minimal paths from the optic disk to all terminal nodes found using Dijkstra algorithm. The actual central vein is selected among the all candidates by maximizing a merit function estimating the total vessel area in the image. Results are presented and compared with those provided by a manual classification on 20 images of the DRIVE set. An overall performance ratio of 92% is achieved. ©2006 IEEE.
Original language | English |
---|---|
Title of host publication | 2006 IEEE International Conference on Image Processing, ICIP 2006 - Proceedings |
Pages | 1925-1928 |
Number of pages | 4 |
DOIs | |
Publication status | Published - 2006 |
Event | 13th IEEE International Conference on Image Processing 2006 - Atlanta, GA, United States Duration: 8 Oct 2006 → 11 Oct 2006 |
Conference
Conference | 13th IEEE International Conference on Image Processing 2006 |
---|---|
Abbreviated title | ICIP 2006 |
Country/Territory | United States |
City | Atlanta, GA |
Period | 8/10/06 → 11/10/06 |
Keywords
- Central
- Graph
- Retinal
- Vein
- Vessel