Length-adaptive graph search for automatic segmentation of pathological features in optical coherence tomography images

  • Keller B
  • Cunefare D
  • Grewal D
  • et al.
33Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

Abstract

Abstract.We introduce a metric in graph search and demonstrate its application for segmenting retinal optical coherence tomography (OCT) images of macular pathology. Our proposed “adjusted mean arc length” (AMAL) metric is an adaptation of the lowest mean arc length search technique for automated OCT segmentation. We compare this method to Dijkstra’s shortest path algorithm, which we utilized previously in our popular graph theory and dynamic programming segmentation technique. As an illustrative example, we show that AMAL-based length-adaptive segmentation outperforms the shortest path in delineating the retina/vitreous boundary of patients with full-thickness macular holes when compared with expert manual grading.

Cite

CITATION STYLE

APA

Keller, B., Cunefare, D., Grewal, D. S., Mahmoud, T. H., Izatt, J. A., & Farsiu, S. (2016). Length-adaptive graph search for automatic segmentation of pathological features in optical coherence tomography images. Journal of Biomedical Optics, 21(7), 076015. https://doi.org/10.1117/1.jbo.21.7.076015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free