Staff Members - Benha University
Graph-based segmentation of corneal epithelium and endothelium in Optical Coherence Tomography images
Investigative Ophthalmology & Visual Science • 2019
Publication Information
Authors
Amr Elsawy, Vatookarn Roongpoovapatr, Taher Kamel Eleiwa, Giovanni Gregori, Mohamed Abdel-Mottaleb, Mohamed Abou Shousha
Keywords
Not Available
Journal
Investigative Ophthalmology & Visual Science
Publisher
The Association for Research in Vision and Ophthalmology
Volume
60
Issue
9
Pages
2138
publication.type
International
Paper Link
Open Link
Supplementary Materials
Not Available
Abstract
Epithelial and the Endothelial surfaces of abnormal cornea images obtained using high definition optical coherence tomography (HD-OCT).
Methods: Thirty-six patients were imaged using HD-OCT (Envisu R2210, Bioptigen, Buffalo Grove, IL, USA). These included patients with different pathologies: Dry eye (6 eyes), Keratoconus (6 eyes), Fuchs Dystrophy (6 eyes), Corneal Graft Rejection (6 eyes), Stem Cells Deficiency (6 eyes) and normal controls (6 eyes). All the images were manually segmented by two expert graders. The graph-based automated segmentation algorithm is based on a two stages approach. A directed graph was constructed using image pixels as the graph vertices. The Epithelial and the Endothelial boundaries were initially segmented using an edge energy between graph vertices based on the normalized gradient .
Methods: Thirty-six patients were imaged using HD-OCT (Envisu R2210, Bioptigen, Buffalo Grove, IL, USA). These included patients with different pathologies: Dry eye (6 eyes), Keratoconus (6 eyes), Fuchs Dystrophy (6 eyes), Corneal Graft Rejection (6 eyes), Stem Cells Deficiency (6 eyes) and normal controls (6 eyes). All the images were manually segmented by two expert graders. The graph-based automated segmentation algorithm is based on a two stages approach. A directed graph was constructed using image pixels as the graph vertices. The Epithelial and the Endothelial boundaries were initially segmented using an edge energy between graph vertices based on the normalized gradient .