Tracing Retinal Blood Vessels by Matrix-Forest Theorem of Directed Graphs

  • Li Cheng
  • Jaydeep De
  • Xiaowei Zhang
  • Feng Lin
  • Huiqi Li
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8673)


This paper aims to trace retinal blood vessel trees in fundus images. This task is far from being trivial as the crossover of vessels are commonly encountered in image-based vessel networks. Meanwhile it is often crucial to separate the vessel tree structures in applications such as diabetic retinopathy analysis. In this work, a novel directed graph based approach is proposed to cast the task as label propagation over directed graphs, such that the graph is to be partitioned into disjoint sub-graphs, or equivalently, each of the vessel trees is traced and separated from the rest of the vessel network. Then the tracing problem is addressed by making novel usage of the matrix-forest theorem in algebraic graph theory. Empirical experiments on synthetic as well as publicly available fundus image datasets demonstrate the applicability of our approach.


Diabetic Retinopathy Proliferative Diabetic Retinopathy Label Propagation Fundus Image Vessel Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Viswanath, K., McGavin, D.: Diabetic retinopathy: Clinical findings and management. Community Eye Health 16(46), 21–24 (2003)Google Scholar
  2. 2.
    Becker, C., Rigamonti, R., Lepetit, V., Fua, P.: Supervised feature learning for curvilinear structure segmentation. In: Mori, K., Sakuma, I., Sato, Y., Barillot, C., Navab, N. (eds.) MICCAI 2013, Part I. LNCS, vol. 8149, pp. 526–533. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  3. 3.
    Turetken, E., Gonzalez, G., Blum, C., Fua, P.: Automated reconstruction of dendritic and axonal trees by global optimization with geometric priors. Neuroinformatics 9, 279–302 (2011)CrossRefGoogle Scholar
  4. 4.
    Agaev, R.P., Chebotarev, P.Y.: Spanning forests of a digraph and their applications. Automation and Remote Control 62(3), 443–466 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    De, J., Li, H., Cheng, L.: Tracing retinal vessel trees by transductive inference. BMC Bioinformatics 15(20), 1–20 (2014)Google Scholar
  6. 6.
    Harary, F., Norman, R., Cartwright, D.: Structural models: an introduction to the theory of directed graphs. Wiley (1965)Google Scholar
  7. 7.
    Brualdi, R., Ryser, H.: Combinatorial Matrix Theory. Cambridge Uni. Press (1991)Google Scholar
  8. 8.
    Chebotarev, P.Y., Agaev, R.P.: Forest matrices around the laplacian matrix. Linear Algebra and its Applications 356(1-3), 247–253 (2002)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Meyer, C., Stadelmaier, M.: Singular m-matrices and inverse positivity. Linear Algebra and its Applications 22, 139–156 (1978)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Derbeko, P., El-Yaniv, R., Meir, R.: Explicit learning curves for transduction and application to clustering and compression algorithms. J. Artif. Intell. Res. 22, 117–142 (2004)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Staal, J., Abramoff, M., Niemeijer, M., Viergever, M., van Ginneken, B.: Ridge based vessel segmentation in color images of the retina. IEEE Trans. Med. Imag. 23(4), 501–509 (2004)CrossRefGoogle Scholar
  12. 12.
    Hoover, A., Kouznetsova, V., Goldbaum, M.: Locating blood vessels in retinal images by piecewise threshold probing of a matched filter response. IEEE Trans Med Imag 19(3), 203–210 (2000)CrossRefGoogle Scholar
  13. 13.
    Macskassy, S., Provost, F.: Classification in networked data: A toolkit and a univariate case study. JMLR 8, 935–983 (2007)Google Scholar
  14. 14.
    Fouss, F., Francoisse, K., Yen, L., Pirotte, A., Saerens, M.: An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification. Neural Network 31, 53–72 (2012)CrossRefzbMATHGoogle Scholar
  15. 15.
    Zhou, D., Huang, J., Schölkopf, B.: Learning from labeled and unlabeled data on a directed graph. In: ICML (2005)Google Scholar
  16. 16.
    Gillette, T.A., Brown, K.M., Ascoli, G.A.: The diadem metric: comparing multiple reconstructions of the same neuron. Neuroinformatics 9(2-3), 233–245 (2011)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Li Cheng
    • 1
    • 3
  • Jaydeep De
    • 1
    • 2
  • Xiaowei Zhang
    • 1
  • Feng Lin
    • 2
  • Huiqi Li
    • 4
  1. 1.Bioinformatics InstituteA*STARSingapore
  2. 2.School of Computer EngineeringNanyang Technological UniversitySingapore
  3. 3.School of ComputingNational University of SingaporeSingapore
  4. 4.Beijing Institute of TechnologyChina

Personalised recommendations